an lr categoryneutral parser

Báo cáo khoa học: "AN LR CATEGORY-NEUTRAL PARSER WITH LEFT CORNER PREDICTION" pdf

Báo cáo khoa học: "AN LR CATEGORY-NEUTRAL PARSER WITH LEFT CORNER PREDICTION" pdf

Ngày tải lên : 23/03/2014, 20:20
... skeleton which is needed for feature annotation. It must be efficient and it must fail as soon as an error is encountered, in order to limit backtracking. An LR( k) parser (Knuth 1965) has these properties, ... prediction in a modified LR parser. ON LINGUISTIC THEORY For a parser to be linguistically motivated, it must be transparent to a linguistic theory, under some precise notion of transparency (see ... deterministic on unambiguous input, and it has been proved to recognize only valid prefixes. In our parser, we compile the grammar shown above into an LALR(1) (Aho and Ullma~n 1972) parse table....
  • 3
  • 132
  • 0
Tài liệu Báo cáo khoa học: "Integrating Syntactic Priming into an Incremental Probabilistic Parser, with an Application to Psycholinguistic Modeling" ppt

Tài liệu Báo cáo khoa học: "Integrating Syntactic Priming into an Incremental Probabilistic Parser, with an Application to Psycholinguistic Modeling" ppt

Ngày tải lên : 20/02/2014, 12:20
... Roland and Renate de Mori. 1990. A cache-based nat- ural language model for speech recognition. IEEE Tran- sanctions on Pattern Analysis and Machine Intelligence 12(6):570–583. Roark, Brian and ... simpler and more gen- eral mechanism, and that the copy mechanism is not needed. This conclusion is strengthened when we turn to consider the performance of the parser on the standard Penn Treebank ... Sturt, and Frank Keller. 2005. Paral- lelism in coordination as an instance of syntactic priming: Evidence from corpus-based modeling. In Proceedings of the Human Language Technology Conference and...
  • 8
  • 444
  • 0
Tài liệu Báo cáo khoa học: "Evaluating the Accuracy of an Unlexicalized Statistical Parser on the PARC DepBank" docx

Tài liệu Báo cáo khoa học: "Evaluating the Accuracy of an Unlexicalized Statistical Parser on the PARC DepBank" docx

Ngày tải lên : 20/02/2014, 12:20
... evaluate the accuracy of an unlexi- calized statistical parser, trained on 4K treebanked sentences from balanced data and tested on the PARC DepBank. We demonstrate that a parser which is compet- itive ... Taipei, Taiwan. 134–140. Carroll, J., E. Briscoe and A. Sanfilippo. 1998. Parser evalu- ation: a survey and a new proposal. In Proceedings of the 1st International Conference on Language Resources and Evaluation, ... Corpus variation and parser performance. In Proceedings of the Empirical Methods in Natural Lan- guage Processing (EMNLP’01), Pittsburgh, PA. Inui, K., V. Sornlertlamvanich, H. Tanaka and T. Tokunaga. 1997....
  • 8
  • 543
  • 0
Báo cáo khoa học: "Learning a Compositional Semantic Parser using an Existing Syntactic Parser" pot

Báo cáo khoa học: "Learning a Compositional Semantic Parser using an Existing Syntactic Parser" pot

Ngày tải lên : 23/03/2014, 16:21
... Competition and manually translated into En- glish (Kuhlmann et al., 2004). For GEOQUERY, 880 English questions were gathered from vari- ous sources and manually translated into Prolog queries (Tang and ... Performance on GEOQUERY. available): SCISSOR (Ge and Mooney, 2005), an integrated syntactic-semantic parser; KRISP (Kate and Mooney, 2006), an SVM-based parser using string kernels; WASP (Wong and ... semantic analyzers. This paper presents an approach to learning semantic parsers that uses parse trees from an existing s yntactic analyzer to drive the interpretation process. The learned parser...
  • 9
  • 277
  • 0
Tài liệu Báo cáo khoa học: "An Improved Parser for Data-Oriented Lexical-Functional Analysis" doc

Tài liệu Báo cáo khoa học: "An Improved Parser for Data-Oriented Lexical-Functional Analysis" doc

Ngày tải lên : 20/02/2014, 18:20
... frontier nodes and deletes all subtrees they dominate. Like Root, it also removes the φ links of the deleted nodes and erases any semantic form that corresponds to any of those nodes. For instance, if ... Procedure for Quantitatively Comparing the Syntactic Coverage of English", Proceedings DARPA Workshop, Pacific Grove, Morgan Kaufmann. R. Bod, 1993. "Using an Annotated Language Corpus ... Category- matching and Uniqueness; and the third definition groups all fragments which satisfy Category- matching, Uniqueness and Coherence. Bod & Kaplan point out that the Completeness condition cannot...
  • 8
  • 408
  • 0
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx

Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx

Ngày tải lên : 20/02/2014, 18:20
... steps of the LR au- tomaton, which as usual reads input from left to right and manipulates a stack. We can divide the stack elements into two classes. One class contains the LR states from ... symbol A to range over stacks and substrings of stacks, and the symbol X to range over elements from A4. A configuration (A, w) of the automaton con- sists of a stack A • $ and a remaining ... algorithm from Schabes and Vijay-Shanker (1990) is incorrect, and then provides an example of how our new algorithm works. Some extensions are discussed in Sec- tion 6, and the implementation...
  • 7
  • 413
  • 0
Tài liệu Báo cáo khoa học: "Guiding an HPSG Parser using Semantic and Pragmatic Expectations" pdf

Tài liệu Báo cáo khoa học: "Guiding an HPSG Parser using Semantic and Pragmatic Expectations" pdf

Ngày tải lên : 20/02/2014, 21:20
... Pollard, Carl. and Sag, Ivan A., "Information-Based Syntax and Semantics: Volume 1, Fundamentals", Center for the Study of Language and Information, 1987. Schegloff, E.A. and Sacks, ... Terry. 1983. "Language as a Cognitive Process", Addison-Wesley, Menlo Park, CA. 297 Guiding an HPSG Parser using Semantic and Pragmatic Expectations Jim Skon Computer and Information ... SUMMARY Pragmatic knowledge about language usage in routine conversational contexts can be highly compiled. This knowledge can be used to produce semantic and syntactic expectations about next...
  • 3
  • 379
  • 0
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot

Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot

Ngày tải lên : 22/02/2014, 10:20
... Aho and Ullman (1987) and Aho and Johnson (1974), and more formal definitions and notations of a feature- based grammar formalism from Pollard and Sag (1987) and Shieber (1986). 2 The LR ... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics ... takes a current state and an input string to return a next action, and GOTO takes a previous state and a syntactic category to return a next state. States of the LR parser are sets of dotted...
  • 6
  • 334
  • 0
Báo cáo khoa học: "AMBIGUITY RESOLUTION IN THE HUMAN SYNTACTIC PARSER: AN EXPERIMENTAL STUDY" ppt

Báo cáo khoa học: "AMBIGUITY RESOLUTION IN THE HUMAN SYNTACTIC PARSER: AN EXPERIMENTAL STUDY" ppt

Ngày tải lên : 08/03/2014, 18:20
... received; and (2) when an anlysis is attempted, then the analysis that serves as the resolution of the ambiguity is adopted without consideration of any other possible analyses (if any others ... following models as candidates for describing the human parser: DPA with either kind of parallelism, IPA-with-strong-parallelism, or Abandonment-with- parallel-reanalysis. (Abandonment might work ... modifications.) It can be noted that while bottom-up mechanisms are logically capable of only Delayed Analysis, top-down mechanisms are capable of either Immediate or Delayed Analysis. Another type...
  • 5
  • 352
  • 0
Báo cáo khoa học: "COPING WITH DYNAMIC SYNTACTIC STRATEGIES: AN EXPERIMENTAL ENVIRONMENT FOR AN EXPERIMENTAL PARSER" pptx

Báo cáo khoa học: "COPING WITH DYNAMIC SYNTACTIC STRATEGIES: AN EXPERIMENTAL ENVIRONMENT FOR AN EXPERIMENTAL PARSER" pptx

Ngày tải lên : 09/03/2014, 01:20
... specifies an active edge and an inactive edge that can extend it. An insertion task specifies a nondeterministie unification act, and a virtual task involves extension of an edge to include an inactive ... lexicon and in the transition network. ii) After the verb is detected: on the one hand there is an edge that, if extended, would not satisfy an obligatory impulse, on the other hand, one ... hypothesis. The object is already there, analyzed for the other reading and does not need to be reanalyzed. So a Milano is taken as the filler for the impulse and the analysis is concluded properly....
  • 7
  • 290
  • 0
Báo cáo khoa học: "Complexity Metrics in an Incremental Right-corner Parser" pdf

Báo cáo khoa học: "Complexity Metrics in an Incremental Right-corner Parser" pdf

Ngày tải lên : 23/03/2014, 16:20
... reflects plausible accounts of human language processing as incremental (Tanenhaus et al., 1995; Brants and Crocker, 2000), as considering hypotheses proba- bilistically in parallel (Dahan and Gaskell, 2007), as ... (Cowan, 2001), and as requiring more memory storage for center-embedding structures than for right- or left-branching ones (Chomsky and Miller, 1963; Gibson, 1998). Also, unlike most other parsers, ... variation in the performance of predictors. 1196 Evan Chen, Edward Gibson, and Florian Wolf. 2005. Online syntactic storage costs in sentence com- prehension. Journal of Memory and Language, 52(1):144–169. Noam...
  • 10
  • 311
  • 0
Báo cáo khoa học: "An Incremental Connectionist Phrase Structure Parser" potx

Báo cáo khoa học: "An Incremental Connectionist Phrase Structure Parser" potx

Ngày tải lên : 23/03/2014, 20:20
... which can be activated at any time. If the parser does not have enough space to store all the nodes for the new word's tree, then any node which has both a head and an immediate parent can ... Investigating Natural Language. Technical Re- port MS-CIS-90-94, University of Pennsylvania, Philadelphia, PA, 1990. [Shastri and Ajjanagadde, 1990] Lokendra Shastri and Venkat Ajjanagadde. From ... dependent on a few nodes is important both because it simplifies the parser& apos;s rules and because nodes which are no longer going to be in- volved in any equations can be forgotten. Nodes must...
  • 2
  • 231
  • 0
Báo cáo khoa học: "LR Parsers For Natural Languages" pot

Báo cáo khoa học: "LR Parsers For Natural Languages" pot

Ngày tải lên : 24/03/2014, 01:21
... Tops-20. One good feature of an MLR parser (and of an LR parser) is that, even if the parser is to run on a small computer, the construction of the parsing table can be done on more powerful, ... while standard LR parsers can not handle ambi~juous languages. The recent literature[8] shows that the belief "natural languages are not context-free" is not necessarily true, and there ... table) decides to what state the parser should go aftera reduce action. The exact definition and operation of LR parsers can be found in Aho and Ulhnan [4]. We can see that there are two multiple...
  • 4
  • 299
  • 0