Увійти

Готові списки джерел за темами / Grammar, comparative and general Parsing / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Grammar, comparative and general Parsing.

Статті в журналах з теми "Grammar, comparative and general Parsing"

Автор: Grafiati

Опубліковано: 4 червня 2021

Оновлено: 13 лютого 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Grammar, comparative and general Parsing".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

KIM, JONG-BOK, Jaehyung Yang, and sanghoun Song. "Parsing Korean Comparative Constructions in a Typed-Feature Structure Grammar." Language and Information 14, no. 1 (June 30, 2010): 1–24. http://dx.doi.org/10.29403/li.14.1.1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Cooper, William E. "Parsing, Language Learning, and the Grammar." Contemporary Psychology: A Journal of Reviews 30, no. 6 (June 1985): 451–52. http://dx.doi.org/10.1037/023835.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Shi, Zhi Yuan, Yu Qiang Sun, Yu Wan Gu, Fu Quan Ji, and Jing Fen Du. "The Study about Parsing of RGG Grammar." Advanced Materials Research 204-210 (February 2011): 255–58. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.255.

Повний текст джерела

Анотація:

Visualization is the main form of human-computer interaction. The grammar formal description of visual language opens and explores the s application cope and theoretical research field of grammar. At present, graph grammar describing visual language is one of the best the formal methods. In the paper, formal parsing method of RGG grammar is studied deeply, a parsing algorithm about RGG grammar is described, and its application on Petri net is discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Bao, Lei. "A Trajectory Classification Model Using Grammar Parsing." IEEE Access 8 (2020): 218416–23. http://dx.doi.org/10.1109/access.2020.3042614.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Cousot, Patrick, and Radhia Cousot. "Parsing as abstract interpretation of grammar semantics." Theoretical Computer Science 290, no. 1 (January 2003): 531–44. http://dx.doi.org/10.1016/s0304-3975(02)00034-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Juffs, Alan. "Grammar and parsing and a transition theory." Applied Psycholinguistics 27, no. 1 (January 2006): 69–71. http://dx.doi.org/10.1017/s0142716406060115.

Повний текст джерела

Анотація:

The article by Clahsen and Felser (CF) on grammatical processing in language learning is a timely and much-needed synthesis of research on this topic. It correctly identifies both morphological processing and syntactic processing as key areas that require attention. This commentary raises two issues: the relationship between the grammar and the parser, and the need for a transition theory in adult second language (L2) learning.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Gildea, Daniel. "Grammar Factorization by Tree Decomposition." Computational Linguistics 37, no. 1 (March 2011): 231–48. http://dx.doi.org/10.1162/coli_a_00040.

Повний текст джерела

Анотація:

We describe the application of the graph-theoretic property known as treewidth to the problem of finding efficient parsing algorithms. This method, similar to the junction tree algorithm used in graphical models for machine learning, allows automatic discovery of efficient algorithms such as the O(n4) algorithm for bilexical grammars of Eisner and Satta. We examine the complexity of applying this method to parsing algorithms for general Linear Context-Free Rewriting Systems. We show that any polynomial-time algorithm for this problem would imply an improved approximation algorithm for the well

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Sun, Weiwei, and Xiaojun Wan. "Data-driven, PCFG-based and Pseudo-PCFG-based Models for Chinese Dependency Parsing." Transactions of the Association for Computational Linguistics 1 (December 2013): 301–14. http://dx.doi.org/10.1162/tacl_a_00229.

Повний текст джерела

Анотація:

We present a comparative study of transition-, graph- and PCFG-based models aimed at illuminating more precisely the likely contribution of CFGs in improving Chinese dependency parsing accuracy, especially by combining heterogeneous models. Inspired by the impact of a constituency grammar on dependency parsing, we propose several strategies to acquire pseudo CFGs only from dependency annotations. Compared to linguistic grammars learned from rich phrase-structure treebanks, well designed pseudo grammars achieve similar parsing accuracy and have equivalent contributions to parser ensemble. Moreo

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Kallmeyer, L., W. Maier, Y. Parmentier, and J. Dellert. "TuLiPA - Parsing extensions of TAG with range concatenation grammars." Bulletin of the Polish Academy of Sciences: Technical Sciences 58, no. 3 (September 1, 2010): 377–91. http://dx.doi.org/10.2478/v10175-010-0036-0.

Повний текст джерела

Анотація:

TuLiPA - Parsing extensions of TAG with range concatenation grammarsIn this paper we present a parsing framework for extensions of Tree Adjoining Grammar (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with Shared Nodes (TT-MCTAG), a TAG-extension which has been proposed to deal with scrambling in free word order languages such as German. The central strategy of the parser is such that the incoming TT-MCTAG (or TAG) is transformed into an equivalent Range Concatenation Grammar (RCG) which, in turn, is then used

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Cousot, Patrick, and Radhia Cousot. "Grammar semantics, analysis and parsing by abstract interpretation." Theoretical Computer Science 412, no. 44 (October 2011): 6135–92. http://dx.doi.org/10.1016/j.tcs.2011.06.005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Jabri, Riad. "A generic parser for strings and trees." Computer Science and Information Systems 9, no. 1 (2012): 381–410. http://dx.doi.org/10.2298/csis101109004j.

Повний текст джерела

Анотація:

In this paper, we propose a two fold generic parser. First, it simulates the behavior of multiple parsing automata. Second, it parses strings drawn from either a context free grammar, a regular tree grammar, or from both. The proposed parser is based on an approach that defines an extended version of an automaton, called positionparsing automaton (PPA) using concepts from LR and regular tree automata, combined with a newly introduced concept, called state instantiation and transition cloning. It is constructed as a direct mapping from a grammar, represented in an expanded list format. However,

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Kumari, B. Venkata Seshu, and Ramisetty Rajeshwara Rao. "Improving Telugu Dependency Parsing using Combinatory Categorial Grammar Supertags." ACM Transactions on Asian and Low-Resource Language Information Processing 14, no. 1 (January 30, 2015): 1–10. http://dx.doi.org/10.1145/2693190.2693191.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Kromann, Matthias Trautner. "Optimality parsing and local cost functions in Discontinuous Grammar." Electronic Notes in Theoretical Computer Science 53 (April 2004): 163–79. http://dx.doi.org/10.1016/s1571-0661(05)82581-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Kulkarni, Amba. "Sanskrit Parsing Following Indian Theories of Verbal Cognition." ACM Transactions on Asian and Low-Resource Language Information Processing 20, no. 2 (April 8, 2021): 1–38. http://dx.doi.org/10.1145/3418061.

Повний текст джерела

Анотація:

Pāṇini’s grammar is an important milestone in the Indian grammatical tradition. Unlike grammars of other languages, it is almost exhaustive and together with the theories of śābdabodha (verbal cognition), this grammar provides a system for language analysis as well as generation. The theories of śābdabodha describe three conditions necessary for verbal cognition. They are ākāṅkṣā (expectancy), yogyatā (meaning congruity), and sannidhi (proximity). We examine them from a computational viewpoint and provide appropriate computational models for their representation. Next, we describe the design o

Стилі APA, Harvard, Vancouver, ISO та ін.

15

DEVRIESE, DOMINIQUE, and FRANK PIESSENS. "Finally tagless observable recursion for an abstract grammar model." Journal of Functional Programming 22, no. 6 (July 10, 2012): 757–96. http://dx.doi.org/10.1017/s0956796812000226.

Повний текст джерела

Анотація:

AbstractWe define a finally tagless, shallow embedding of a typed grammar language. In order to avoid the limitations of traditional parser combinator libraries (no bottom-up parsing, no full grammar analysis or transformation), we require object-language recursion to be observable in the meta-language. Since existing proposals for recursive constructs are not fully satisfactory, we propose new finally tagless primitive recursive constructs to solve the problem. To do this in a well-typed way, we require considerable infrastructure, for which we reuse techniques from the multirec generic progr

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Gildea, Daniel, and Giorgio Satta. "Synchronous Context-Free Grammars and Optimal Parsing Strategies." Computational Linguistics 42, no. 2 (June 2016): 207–43. http://dx.doi.org/10.1162/coli_a_00246.

Повний текст джерела

Анотація:

The complexity of parsing with synchronous context-free grammars is polynomial in the sentence length for a fixed grammar, but the degree of the polynomial depends on the grammar. Specifically, the degree depends on the length of rules, the permutations represented by the rules, and the parsing strategy adopted to decompose the recognition of a rule into smaller steps. We address the problem of finding the best parsing strategy for a rule, in terms of space and time complexity. We show that it is NP-hard to find the binary strategy with the lowest space complexity. We also show that any algori

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Underwood, William. "Grammar-Based Specification and Parsing of Binary File Formats." International Journal of Digital Curation 7, no. 1 (March 9, 2012): 95–106. http://dx.doi.org/10.2218/ijdc.v7i1.217.

Повний текст джерела

Анотація:

The capability to validate and view or play binary file formats, as well as to convert binary file formats to standard or current file formats, is critically important to the preservation of digital data and records. This paper describes the extension of context-free grammars from strings to binary files. Binary files are arrays of data types, such as long and short integers, floating-point numbers and pointers, as well as characters. The concept of an attribute grammar is extended to these context-free array grammars. This attribute grammar has been used to define a number of chunk-based and

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Hill, Steve. "Combinators for parsing expressions." Journal of Functional Programming 6, no. 3 (May 1996): 445–64. http://dx.doi.org/10.1017/s0956796800001799.

Повний текст джерела

Анотація:

AbstractThis paper describes a scheme for constructing parsers based on the top-down combinator approach. In particular, it describes a set of combinators for parsing expressions described by ambiguous grammars with precedence and associativity rules. The new combinators embody the mechanical grammar manipulations typically employed to remove left-recursion and hence help to avoid the possibility of a non-terminating parser. A number of approaches to the problem are described—the most elegant and efficient method is based on continuation passing. As a practical demonstration, a parser for the

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Zhang, Xun, Yantao Du, Weiwei Sun, and Xiaojun Wan. "Transition-Based Parsing for Deep Dependency Structures." Computational Linguistics 42, no. 3 (September 2016): 353–89. http://dx.doi.org/10.1162/coli_a_00252.

Повний текст джерела

Анотація:

Derivations under different grammar formalisms allow extraction of various dependency structures. Particularly, bilexical deep dependency structures beyond surface tree representation can be derived from linguistic analysis grounded by CCG, LFG, and HPSG. Traditionally, these dependency structures are obtained as a by-product of grammar-guided parsers. In this article, we study the alternative data-driven, transition-based approach, which has achieved great success for tree parsing, to build general dependency graphs. We integrate existing tree parsing techniques and present two new transition

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Mohamad Zulkufli, Nurul Liyana, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin, and Azeddine Messikh. "Watson–Crick Context-Free Grammars: Grammar Simplifications and a Parsing Algorithm." Computer Journal 61, no. 9 (January 10, 2018): 1361–73. http://dx.doi.org/10.1093/comjnl/bxx128.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Johnstone, Adrian, Elizabeth Scott, and Giorgios Economopoulos. "The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms." Electronic Notes in Theoretical Computer Science 110 (December 2004): 97–113. http://dx.doi.org/10.1016/j.entcs.2004.06.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Qi, Shanshan, Limin Zheng, and Feiyu Shang. "Dependency Parsing-based Entity Relation Extraction over Chinese Complex Text." ACM Transactions on Asian and Low-Resource Language Information Processing 20, no. 4 (June 9, 2021): 1–34. http://dx.doi.org/10.1145/3450273.

Повний текст джерела

Анотація:

Open Relation Extraction (ORE) plays a significant role in the field of Information Extraction. It breaks the limitation that traditional relation extraction must pre-define relational types in the annotated corpus and specific domains restrictions, to realize the goal of extracting entities and the relation between entities in the open domain. However, with the increase of sentence complexity, the precision and recall of Entity Relation Extraction will be significantly reduced. To solve this problem, we present an unsupervised Clause_CORE method based on Chinese grammar and dependency parsing

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Lehmann, Christian. "A survey of general comparative grammar." Journal of Linguistics 24, no. 1 (March 1988): 175–87. http://dx.doi.org/10.1017/s0022226700011609.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Habert, Benoît, and Christian Jacquemin. "Constructions Nominales à Contraintes Fortes et Grammaires D'unification." Lingvisticæ Investigationes. International Journal of Linguistics and Language Resources 19, no. 2 (January 1, 1995): 401–28. http://dx.doi.org/10.1075/li.19.2.10hab.

Повний текст джерела

Анотація:

Irregular nominal compounds can be defined as noun phrases having a regular syntactic construction but having restrictions on their syntactic variations and specific semantic behaviours. The aim of our study is to bring to the fore some of the constraints which have to be taken into account for the realisation of a parser for non lexicalised nominal compounds. Therefore, two nominal compounds are studied from a linguistic standpoint. The first one verre à vin (wineglass) can be classified as a true compound noun although accepting several modifications. The second one verre de vin (glass of wi

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Rodriguez-Leon, C., and L. Garcia-Forte. "Solving difficult LR parsing conflicts by postponing them." Computer Science and Information Systems 8, no. 2 (2011): 517–31. http://dx.doi.org/10.2298/csis101116008r.

Повний текст джерела

Анотація:

Though yacc-like LR parser generators provide ways to solve shift-reduce conflicts using token precedences, no mechanisms are provided for the resolution of difficult shift-reduce or reduce-reduce conflicts. To solve this kind of conflicts the language designer has to modify the grammar. All the solutions for dealing with these difficult conflicts branch at each alternative, leading to the exploration of the whole search tree. These strategies differ in the way the tree is explored: GLR, Backtracking LR, Backtracking LR with priorities, etc. This paper explores an entirely different path: to e

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Lightfoot, David. "Problems with variable properties in syntax." Cadernos de Linguística 2, no. 1 (January 13, 2021): 01–19. http://dx.doi.org/10.25189/2675-4916.2021.v2.n1.id306.

Повний текст джерела

Анотація:

Like those birds born to chirp, humans are born to parse; children are predisposed to assign linguistic structures to the amorphous externalization of the thoughts that we encounter. This yields a view of variable properties quite different from one based on parameters defined at Universal Grammar (UG). Our approach to language acquisition makes two contributions to Minimalist thinking. First, in accordance with general Minimalist goals, we minimize the pre-wired components of internal languages, dispensing with three separate, central entities: parameters, an evaluation metric for rating the

Стилі APA, Harvard, Vancouver, ISO та ін.

27

SRINIVAS, B. "Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars." Natural Language Engineering 2, no. 4 (December 1996): 367–68. http://dx.doi.org/10.1017/s1351324997001642.

Повний текст джерела

Анотація:

There are currently two philosophies for building grammars and parsers: hand-crafted, wide coverage grammars; and statistically induced grammars and parsers. Aside from the methodological differences in grammar construction, the linguistic knowledge which is overt in the rules of handcrafted grammars is hidden in the statistics derived by probabilistic methods, which means that generalizations are also hidden and the full training process must be repeated for each domain. Although handcrafted wide coverage grammars are portable, they can be made more efficient when applied to limited domains,

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Gerber, Stefan, and Helmar Burkhart. "Number-Crunching Software and the Input Problem: Guidelines and a Case Study." Scientific Programming 3, no. 1 (1994): 1–11. http://dx.doi.org/10.1155/1994/123687.

Повний текст джерела

Анотація:

Most of the number-crunching software running on supercomputers lack a concept for an error-free input processing. The programs often terminate after several hours due to user input errors. We present an analysis of this input problem. First, we separate the input parsing system from the number-crunching code. Second, we define a general grammar suitable for an automatic generation of a parsing system using the LEX/YACC tools. This concept leads to an input system that is easy to use and the generated input data for the number-crunching software is as error free as possible. We discuss the imp

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Goldberg, Yoav, and Michael Elhadad. "Word Segmentation, Unknown-word Resolution, and Morphological Agreement in a Hebrew Parsing System." Computational Linguistics 39, no. 1 (March 2013): 121–60. http://dx.doi.org/10.1162/coli_a_00137.

Повний текст джерела

Анотація:

We present a constituency parsing system for Modern Hebrew. The system is based on the PCFG-LA parsing method of Petrov et al. 2006 , which is extended in various ways in order to accommodate the specificities of Hebrew as a morphologically rich language with a small treebank. We show that parsing performance can be enhanced by utilizing a language resource external to the treebank, specifically, a lexicon-based morphological analyzer. We present a computational model of interfacing the external lexicon and a treebank-based parser, also in the common case where the lexicon and the treebank fol

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Cohen, Shay B., and Daniel Gildea. "Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication." Computational Linguistics 42, no. 3 (September 2016): 421–55. http://dx.doi.org/10.1162/coli_a_00254.

Повний текст джерела

Анотація:

We describe a recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time O(nωd) where M(m) = O(mω) is the running time for m × m matrix multiplication and d is the “contact rank” of the LCFRS—the maximal number of combination and non-combination points that appear in the grammar rules. We also show that this algorithm can be used as a subroutine to obtain a recognition algorithm for general binary LCFRS with running time O(nωd+1). The currently best known ω is smaller than 2.38. Our result provides another proof for the best known result for pa

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Leo, Joop M. I. M. "A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead." Theoretical Computer Science 82, no. 1 (May 1991): 165–76. http://dx.doi.org/10.1016/0304-3975(91)90180-a.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Reeves, J., and R. Pacheco Pardo. "Parsing China's power: Sino-Mongolian and Sino-DPRK relations in comparative perspective." International Relations of the Asia-Pacific 13, no. 3 (May 23, 2013): 449–77. http://dx.doi.org/10.1093/irap/lct007.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Henderson, James, Paola Merlo, Ivan Titov, and Gabriele Musillo. "Multilingual Joint Parsing of Syntactic and Semantic Dependencies with a Latent Variable Model." Computational Linguistics 39, no. 4 (December 2013): 949–98. http://dx.doi.org/10.1162/coli_a_00158.

Повний текст джерела

Анотація:

Current investigations in data-driven models of parsing have shifted from purely syntactic analysis to richer semantic representations, showing that the successful recovery of the meaning of text requires structured analyses of both its grammar and its semantics. In this article, we report on a joint generative history-based model to predict the most likely derivation of a dependency parser for both syntactic and semantic dependencies, in multiple languages. Because these two dependency structures are not isomorphic, we propose a weak synchronization at the level of meaningful subsequences of

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Michaelis, Laura A. "The Comparative Conditional in Latin." Annual Meeting of the Berkeley Linguistics Society 18, no. 1 (August 25, 1992): 166. http://dx.doi.org/10.3765/bls.v18i1.1594.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

SENGUPTA, P., and B. B. CHAUDHURI. "A MORPHO-SYNTACTIC ANALYSIS BASED LEXICAL SUBSYSTEM." International Journal of Pattern Recognition and Artificial Intelligence 07, no. 03 (June 1993): 595–619. http://dx.doi.org/10.1142/s0218001493000303.

Повний текст джерела

Анотація:

A lexical subsystem that contains a morphological level parser is necessary for processing natural languages in general and inflectional languages in particular. Such a subsystem should be able to generate the surface form (i.e. as it appears in a natural sentence) of a word, given the sequence of morphemes constituting the word. Conversely, and more importantly, the subsystem should be able to parse a word into its constituent morphemes. A formalism which enables the lexicon writer to specify the lexicon of an inflectional language is discussed. The specifications are used to build up a lexic

Стилі APA, Harvard, Vancouver, ISO та ін.

36

WAGERS, MATTHEW W., and COLIN PHILLIPS. "Multiple dependencies and the role of the grammar in real-time comprehension." Journal of Linguistics 45, no. 2 (June 4, 2009): 395–433. http://dx.doi.org/10.1017/s0022226709005726.

Повний текст джерела

Анотація:

Wh-dependencies are known to be formed rapidly in real-time comprehension. The parser posits the location of gap sites in advance of the bottom-up evidence for missing constituents, and must therefore have a means of deciding when and where to project dependencies. Previous studies have observed that the parser avoids building ungrammatical wh-dependencies, for example, by restricting the search for gap sites from island domains. This paper tests the stronger claim that constraints are not merely respected, but that grammatical knowledge actively prompts the construction of some representation

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Wang, Liu, Lejian Liao, Kai Yang, and Hai Tan. "A Case Study of Question Answering in Automatic Tourism Service Packaging." Cybernetics and Information Technologies 13, Special-Issue (December 1, 2013): 143–52. http://dx.doi.org/10.2478/cait-2013-0045.

Повний текст джерела

Анотація:

Abstract While Web Question Answering System (WQAS) has made great progress in Internet currently, a major limitation of the information sources that current WQASs are using is limited to static page texts. Content information that many users-are interested in, is provided dynamically to Web through programs. Web services are becoming the dominant forms of such sorts of programs. In this paper, a novel model is proposed to address the problem of natural language answering based Web services. The expansions of OWL-S are used to describe the services, and predicate tuples retrieved from question

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Tian, Ying. "Comparative Study on “Sentence Rewriting for Semantic Parsing” and “Graph-Based Translation Via Graph Segmentation”." Journal of Physics: Conference Series 1852, no. 4 (April 1, 2021): 042021. http://dx.doi.org/10.1088/1742-6596/1852/4/042021.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Haque, Md Majharul, Suraiya Pervin, and Zerina Begum. "Rule Based Replacement of Pronoun by Corresponding Noun for Bangla News Documents." International Journal of Technology Diffusion 8, no. 2 (April 2017): 26–42. http://dx.doi.org/10.4018/ijtd.2017040102.

Повний текст джерела

Анотація:

The object of this research work is to replace pronoun by corresponding noun for Bangla news documents. To the best of our knowledge, this is the first initiative to solve the problem of dangling pronoun where corresponding noun is not available. If the information retrieval procedures extract any sentence with dangling pronoun, it may raise confusion to the user. To mitigate this problem, a method has been proposed here by using general and special tagging, dependency parsing, full name identifying and finally pronoun replacing. For achieving the target of this method, 3000 Bangla news docume

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Huang, Liang, Hao Zhang, Daniel Gildea, and Kevin Knight. "Binarization of Synchronous Context-Free Grammars." Computational Linguistics 35, no. 4 (December 2009): 559–95. http://dx.doi.org/10.1162/coli.2009.35.4.35406.

Повний текст джерела

Анотація:

Systems based on synchronous grammars and tree transducers promise to improve the quality of statistical machine translation output, but are often very computationally intensive. The complexity is exponential in the size of individual grammar rules due to arbitrary re-orderings between the two languages. We develop a theory of binarization for synchronous context-free grammars and present a linear-time algorithm for binarizing synchronous rules when possible. In our large-scale experiments, we found that almost all rules are binarizable and the resulting binarized rule set significantly improv

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Slivnik, Bostjan. "LL conflict resolution using the embedded left LR parser." Computer Science and Information Systems 9, no. 3 (2012): 1105–24. http://dx.doi.org/10.2298/csis111216023s.

Повний текст джерела

Анотація:

A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded left LR(k) parser is capable of (a) producing the prefix of the left parse of the input string and (b) stopping not on the end-of-file marker but on any string from the set of lookahead strings fixed at the parser generation time. The conditions regarding the termination of the embedded left LR(k) parser if used within LL(k) (and similar) parsers are defined and examined in-depth. It is proved that an LL(k) parser augmented with a set of embedded left LR(k) parsers ca

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Lin, Ming Huei. "Effects of Data-Driven Learning on College Students of Different Grammar Proficiencies: A Preliminary Empirical Assessment in EFL Classes." SAGE Open 11, no. 3 (July 2021): 215824402110299. http://dx.doi.org/10.1177/21582440211029936.

Повний текст джерела

Анотація:

This article reports a pre–post comparative study investigating whether the data-driven learning (DDL) approach has different pedagogical effects on grammar students of English as a foreign language (EFL) with different levels of English proficiency. The study entailed a treatment group (TG) of 95 first-year undergraduates who learned grammar using DDL and a control group (CG) of 84 students who received no grammar treatment. Most of the participants were 18 or 19 years old, with only a few outliers, aged 17 or 20. The grammar performance and learning attitudes in both groups (their motivation

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Edmonds, Mark, Feng Gao, Hangxin Liu, Xu Xie, Siyuan Qi, Brandon Rothrock, Yixin Zhu, Ying Nian Wu, Hongjing Lu, and Song-Chun Zhu. "A tale of two explanations: Enhancing human trust by explaining robot behavior." Science Robotics 4, no. 37 (December 18, 2019): eaay4663. http://dx.doi.org/10.1126/scirobotics.aay4663.

Повний текст джерела

Анотація:

The ability to provide comprehensive explanations of chosen actions is a hallmark of intelligence. Lack of this ability impedes the general acceptance of AI and robot systems in critical tasks. This paper examines what forms of explanations best foster human trust in machines and proposes a framework in which explanations are generated from both functional and mechanistic perspectives. The robot system learns from human demonstrations to open medicine bottles using (i) an embodied haptic prediction model to extract knowledge from sensory feedback, (ii) a stochastic grammar model induced to cap

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Rutten, Gijsbert. "‘Lowthian’ Linguistics across the North Sea." Historiographia Linguistica 39, no. 1 (March 22, 2012): 43–60. http://dx.doi.org/10.1075/hl.39.1.04rut.

Повний текст джерела

Анотація:

Summary This paper focuses on Dutch grammar-writing in the 18th century so as to put the linguistic works of Robert Lowth (1710–1787) in an international, comparative perspective. It demonstrates that certain characteristics of the “Lowthian” approach to grammar and of 18th-century English linguistics in general are parallelled by similar developments in the history of Dutch linguistics. The transition from normative grammar to prescriptive grammar which characterises the English late 18th century has a counterpart in the Dutch development from ‘civil’ to national grammar. Lowth’s recognition

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Westergaard, Marit. "Linguistic variation and micro-cues in first language acquisition." Linguistic Variation 14, no. 1 (November 25, 2014): 26–45. http://dx.doi.org/10.1075/lv.14.1.02wes.

Повний текст джерела

Анотація:

Children are often exposed to considerable variation in the input. Nevertheless, there is very little overgeneralization in child language data and children are typically found to make errors of omission, not errors of commission, a fact which is often referred to as conservative learning. In this paper, these findings are accounted for by a model of micro-cues, a generative approach to language acquisition arguing that children are sensitive to fine syntactic distinctions from early on. The micro-cues are small pieces of abstract syntactic structure resulting from parsing the input. This mean

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Stobbe, Nina, Gesche Westphal-Fitch, Ulrike Aust, and W. Tecumseh Fitch. "Visual artificial grammar learning: comparative research on humans, kea ( Nestor notabilis ) and pigeons ( Columba livia )." Philosophical Transactions of the Royal Society B: Biological Sciences 367, no. 1598 (July 19, 2012): 1995–2006. http://dx.doi.org/10.1098/rstb.2012.0096.

Повний текст джерела

Анотація:

Artificial grammar learning (AGL) provides a useful tool for exploring rule learning strategies linked to general purpose pattern perception. To be able to directly compare performance of humans with other species with different memory capacities, we developed an AGL task in the visual domain. Presenting entire visual patterns simultaneously instead of sequentially minimizes the amount of required working memory. This approach allowed us to evaluate performance levels of two bird species, kea ( Nestor notabilis ) and pigeons ( Columba livia ), in direct comparison to human participants. After

Стилі APA, Harvard, Vancouver, ISO та ін.

47

PYE, CLIFTON. "The poverty of the Mayan stimulus." Journal of Child Language 39, no. 3 (August 19, 2011): 611–36. http://dx.doi.org/10.1017/s0305000911000183.

Повний текст джерела

Анотація:

ABSTRACTPoverty of the stimulus (POS) arguments have instigated considerable debate in the recent linguistics literature. This article uses the comparative method to challenge the logic of POS arguments. Rather than question the premises of POS arguments, the article demonstrates how POS arguments for individual languages lead to a reductio ad absurdum as POS arguments from genetically related languages are compared. Comparison leads to different contradictions for poverty of the negative stimulus (PONS) and poverty of the positive stimulus (POPS) arguments. Comparing PONS arguments leads to t

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Fitch, W. Tecumseh, and Angela D. Friederici. "Artificial grammar learning meets formal language theory: an overview." Philosophical Transactions of the Royal Society B: Biological Sciences 367, no. 1598 (July 19, 2012): 1933–55. http://dx.doi.org/10.1098/rstb.2012.0103.

Повний текст джерела

Анотація:

Formal language theory (FLT), part of the broader mathematical theory of computation, provides a systematic terminology and set of conventions for describing rules and the structures they generate, along with a rich body of discoveries and theorems concerning generative rule systems. Despite its name, FLT is not limited to human language, but is equally applicable to computer programs, music, visual patterns, animal vocalizations, RNA structure and even dance. In the last decade, this theory has been profitably used to frame hypotheses and to design brain imaging and animal-learning experiment

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Culicover, Peter W., and Ray Jackendoff. "The View from the Periphery: The English Comparative Correlative." Linguistic Inquiry 30, no. 4 (October 1999): 543–71. http://dx.doi.org/10.1162/002438999554200.

Повний текст джерела

Анотація:

The English comparative correlative construction (e.g., The more you eat, the fatter you get) embeds like an ordinary CP, and each of its clauses displays an ordinary long-distance dependency. However, the connection between the two clauses is not ordinary: they are connected paratactically in syntax, but the first clause is interpreted as if it were a subordinate clause. The construction's mixture of the general and the idiosyncratic at all levels of detail challenges the distinction between “core” and “periphery” in grammar and the assumption that some level of underlying syntax directly mir

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Buivytė, Giedrė. "The Manifestations of Fate in Medieval Germanic Poetry and Lithuanian Folk Songs." Aktuālās problēmas literatūras un kultūras pētniecībā: rakstu krājums, no. 26/2 (March 11, 2021): 8–21. http://dx.doi.org/10.37384/aplkp.2021.26-2.008.

Повний текст джерела

Анотація:

Reflections of mythical worldview are embedded in traditional oral poetry, viz. Old Icelandic collection of poems Poetic Edda, Old English poem Beowulf, and Lithuanian folk songs. Archaic motifs and archetypal imagery are conveyed by means of poetic grammar (alliteration, kennings, epithets, etc.). Through interpretation, the hidden (symbolic) meaning of the poetic grammar is unveiled, and the connection between the two worlds, the sacred (the divine) and the profane (the human) (Eliade 1959), is exposed. To advance the analysis of poetic narrative, the methodology employed in the paper combin

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!