an efficient contextfree parsing algorithm for natural languages

... 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 Parsing ... Carl and Ivan A. Sag 1987. Information-Based Syntax and Semantics VoI.1. CSLI Lecture Notes 13. Stanford: CSLI. Shieber, S. 1985. "Using Restriction to Extend Parsing Algorithms for ... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics...

Ngày tải lên: 22/02/2014, 10:20

Ngày tải lên: 31/03/2014, 18:20

... Parmentier, and Johannes Dellert. 2008. De- veloping an MCTAG for German with an RCG- based parser. In Proceedings of LREC-2008, Mar- rakech, Morocco. Wolfgang Maier and Anders Søgaard. 2008. Tree- banks ... Clergerie. 2001. Guided parsing of Range Concatenation Languages. In Pro- ceedings of ACL, pages 42–49. Tilman Becker, Aravind K. Joshi, and Owen Rambow. 1991. Long-distance scrambling and tree adjoining grammars. ... adjacent variables can be concatenated), it is called an in- stantiated predicate and the result of applying φ to all predicates in c, if defined, is called an instanti- ated clause. We also introduce range...

Ngày tải lên: 08/03/2014, 01:20

... used for the analysis were from the administrative claims data. To test the performance of the effectiveness algorithm and to see whether it was similar for non-biologic RA treatments, we performed ... made substantial contributions to conception and design, and to the analysis and interpretation of the data. TRM and GWC handled acquisition of data. All authors contributed to the manuscript ... optimization of the algorithm would be desirable, but substantially more data would be required for this approach and for validation. Finally, as an additional opportunity to extend the algorithm in...

Ngày tải lên: 25/10/2012, 10:45

... Proceedings of COLING’02. K. van Deemter and S. Peters. 1996. Semantic Ambiguity and Underspecification. CSLI, Stanford. E. Vestre. 1991. An algorithm for generating non-redundant quantifier scopings. In ... semantics: An introduction. Journal of Language and Computation. To appear. M. Egg, A. Koller, and J. Niehren. 2001. The Constraint Language for Lambda Structures. Logic, Language, and Information, ... rules. For instance, proper names and pronouns (which the ERG analyses as scope- bearers, although they can be reduced to constants without scope) can be permuted with anything. In- definites and...

Ngày tải lên: 20/02/2014, 12:20

... recursion and is generally less efficient. Nondeterministic LC parsing is the foundation of a very efficient parsing algorithm [7], related to Tomita's algorithm and Earley's algorithm. ... than most other parsing algorithms for many grammars, but their tabular realizations can never compute the same subderivation twice. This rep- resents an optimum in a range of possible parsing ... common-prefix (CP) parsing, which are al- gorithms capable of simultaneous processing of all com- mon prefixes. ELR and CP parsing are the foundation of tabular parsing algorithms and a parallel parsing...

Ngày tải lên: 17/03/2014, 09:20

... f(g) are called the rank and fan-out of p, respectively, written r(p) and f(p). The rank and fan-out of G, written r(G) and f(G), respectively, are the max- imum rank and fan-out among all of ... tree. Several parsing algorithms for LCFRS or equi- valent formalisms are found in the literature; see for instance (Seki et al., 1991; Boullier, 2004; Bur- den and Ljungl ¨ of, 2005). All of these algorithms work ... constituents. Many applications use LCFRSs where the fan-out (a measure of the discontinuity of phrases) is not allowed to be greater than 2. We present an ef- ficient algorithm for transforming LCFRS with...

Ngày tải lên: 23/03/2014, 16:21

... proposed for natural languages (see Chen-Main and Joshi (2007) for an overview), it seems that there are no important natural language phenomena that can be described by LCFRS and not by TT-MCTAG. Any ... Gram- mars (Cremers and Mayer, 1973) and Vector- TAG (Rambow, 1994), V-TAG for short, and it is crucial for the polynomial parsing algorithm. The non-simultaneity seems to be an advantage when using ... in the size of the input string. The algorithm can be eas- ily converted into a parsing algorithm. The ba- sic idea is to use a parsing algorithm for TAG, and impose on-the-fly additional restrictions...

Ngày tải lên: 23/03/2014, 16:21

... Natural Language Processing probably because: 1. It has been thought that natural languages are not context-free, whereas LR parsers can deal only with context-free languages. 2. Natural languages ... 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 ... progralnming languages. For natural languages, however, it is sometimes necessary for a parser to produce more than one parse tree. For example, consider the following short story. I saw the man with...

Ngày tải lên: 24/03/2014, 01:21

Ngày tải lên: 31/03/2014, 06:20

Ngày tải lên: 18/06/2014, 22:20

Ngày tải lên: 21/06/2014, 18:20

Ngày tải lên: 08/07/2014, 17:06

Ngày tải lên: 08/08/2013, 08:38

... wish to thank our colleagues Kerima Benkerimi, David Elworthy, Peter Gibbins, Inn Johnson, Andrew Kay and Antonio Sanfilippo at SLE, and our anonymous reviewers for useful feedback and discussions ... as translation coverage is extended and new lan- guage pairs are added. 5 Conclusion We have presented a polynomial complexity gener- ation algorithm which can form part of any Shake- and-Bake ... component has performed consistently better. References V. Allegranza, P. Bennett, J. Durand, F. van Eynde, L. Humphreys, P. Schmidt, and E. Steiner. 1991. Linguistics for Machine Translation:...

Ngày tải lên: 20/02/2014, 22:20

... III PERFORMANCE OF THE ALGORITHM The algorithm as described has been implemented in Simula 67 on a DEC ELI091 and applied to a corpus of some 300 words in 75 languages and dialects of Vanuatu. ... (Abramowitz and Stegun 1970). B. Vowel/Consonant Correspondences Disallowing correspondences between vowels and consonants vastly improved the performance of the algorltbm. No human intervention ... AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian National University GPO Box 4, Canberra 2601 AUSTRALIA...

Ngày tải lên: 21/02/2014, 20:20

... means that the most significant alterations in grammar rules from the standpoint of natural- language parsing will not be those that affect the formation of particular rules within the same format. ... as the actual parsing algorithm and to view the remaining portions as forms of input data. 5. Leaving aside the matters of rule format and input data, two further questions can be raised con- ... the same format. 4. Another point raised in connection with the separation of grammar and algorithm is that the gram- mar table constitutes a set of input data to the particu- lar algorithm, ...

Ngày tải lên: 07/03/2014, 18:20

... arise in natural language parsing with naive top-down and bottom-up parsers. In natural lan- guage parsing, these problems are resolved by intro- ducing a more sophisticated derivation mechanism, ... derivation steps in TD and HD, and the number of passive and active edges in GCF and GCO. The decimals in parentheses show the ratio of the performance of each method to the performance of TD. The ... Shieber, Gertjan van Noord, Robert C. Moore, and Fernando C.N. Pereira. A semantic-head-driven generation al- gorithm for unification-based formalisms. Pro- ceedings of the 27th Annual Meeting...

Ngày tải lên: 31/03/2014, 06:20