an efficient contextfree parsing algorithm

... 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 ... not require any preliminary instantiation of categories or a search for them, and a reduce action which pe,forms instanliation tit)ring parsing. Some details of the LR parsing algorithm are ... 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

... 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. ... 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 ... with tabular LR parsing. As we will explain, CP and ELR parsing are more deterministic than most other parsing algorithms for many grammars, but their tabular realizations can never compute...

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

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

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

... Johnson, Andrew Kay and Antonio Sanfilippo at SLE, and our anonymous reviewers for useful feedback and discussions on the re- search reported here and on earlier drafts of this paper. of instantiated ... 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 ... great man translated as un homme grand). The problem is justifying the main/subordinate distinction in every language that we might wish to translate into German. This distinction can be...

Ngày tải lên: 20/02/2014, 22: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

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

Ngày tải lên: 14/08/2014, 13:21

... 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 ... 41:1845-1850. 26. van Gestel AM, Prevoo ML, van 't Hof MA, van Rijswijk MH, van de Putte LB, van Riel PL: Development and validation of the European League Against Rheumatism response criteria ... addressing important intellectual content. All authors read and approved the final manuscript for publication. Acknowledgements We would like to thank Mike Connor and Sheryl Berryman at the Birmingham...

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

Ngày tải lên: 01/01/2014, 18:42

... 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 definites ... Toutanova, S. Shieber, C. Manning, D. Flickinger, and T. Brants. 2002. The LinGO Red- woods treebank: Motivation and preliminary applications. In Proceedings of COLING’02. K. van Deemter and ... Linguistics An Improved Redundancy Elimination Algorithm for Underspecified Representations Alexander Koller and Stefan Thater Dept. of Computational Linguistics Universität des Saarlandes, Saarbrücken,...

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

... Cambridge, England. K. Clark and S. Gregory. 1986. Parlog: Parallel programming in logic. Journal of the A CM Transaction on Programming Languages and Syste ms, 8 ( 1):1-49. Ralph Grishman and Mehesh ... heap can be read by any CSAs, each CSA can read the re- sult performed by any other CSAs. However, the portion of a shared heap that the CSA can write to is limited. Any other CSA cannot ... Applied Natural Language Processing, pages 71-76. Association for Computational Linguistics. T. Kasami. 1965. An efficient recognition and syntax algorithm for context-free languages. Technical...

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

... Matching parsing algorithms to evaluation crite- ria is a powerful technique that can be used to im- prove performance. In particular, the Labelled Re- call Algorithm can improve performance versus ... true of the Labelled Tree Algorithm and stochastic versions of Earley's Algorithm (Stolcke, 1993), and variations such as those used in Picky parsing (Magerman and Weir, 1992). Even in ... ATIS data and the cleaned-up version is avail- able from ftp://ftp.das.harvard.edu/pub/goodman/atis- ed/ ti_tb.par-ed and ti_tb.pos-ed. The number of changes made was small, less than 0.2% Criteria...

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

... solvable.  88 root Han spejder efter og ser elefanterne He looks for and sees elephants Figure 5: An example dependency tree from the Danish Dependency Treebank (from Kromann (2003)). word to ... Discontinuous Grammar and annotated a large set of Danish sentences using this formal- ism to create the Danish Dependency Treebank (Kromann, 2003). The formalism allows for a 84 Danish Precision Recall ... state-of-the-art accuracy for English and the best accuracy we know of for Czech and Danish. 2 Maximum Spanning Tree Parsing Dependency-tree parsing as the search for the maximum spanning tree (MST) in a graph...

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

... on Banks and Other Financial Organizations; the Law on Bank Rehabilitation, Bankruptcy and Liquidation; and the Law on the Agency for Deposit Insurance and Bank Rehabilitation, Bankruptcy and ... Valjevska banka, JIK banka, Pozarevacka banka, Sabacka banka, Beogradska banka, Beobanka, Jugobanka, and Investbanka. Later, two more banks were added to this list - Dafiment banka and Banka privatne ... securities and other financial instruments and of these entities, and shall con- duct the clearing and balancing of accounts of securities and balancing of accounts of financial assets and liabilities...

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

... Y. Hu, A. Nanda, and Q. Yang. Measurement, anal- ysis and performance improvement of the Apache web server. In Proceedings of the 18th IEEE In- ternational Performance, Computing and Commu- nications ... testbed configuration. Special thanks to Zeus Technology for use of their server software and Damian Reeves for feedback and technical assistance with it. Thanks to Jef Poskanzer for the thttpd web server, ... versions. The choice of an operating system has a signifi- cant impact on Web server performance. Perfor- The number of concurrent connections can have a significant impact on server performance [4]. Our...

Ngày tải lên: 16/03/2014, 19:20

... play an impor- tant role in synthesizing linguistic analyses such as parsing and semantic analysis, and linguistic and non-linguistic inferences. Acknowledgments I would like to thank Kiyoshi ... returned. Thus CP can he applied to CYK parsing, but needless to say, CP can be applied to parsing al- gorithms other than CYK, such as active chart parsing. 5 Implementation Both CU and CP have ... and indicates its disadvan- tages. Section 4 explains the basic ideas and the algorithm of CP. Section 5 presents some results of implementation and shows that adopting CP makes parsing efficient. ...

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

... Proceedings of EACL '99 number of candidateswill be much smaller than the number of trees in DB. 2 Efficient query evaluation The treegram-index retrieval method ... query treegram, VENONA expands the structure number to a set of index treegram structures and re- moves those labels that consist of a vari- able: Variables and the constraints that they ... until the candidate set has the desired size if necessary, falling back on some of the treegrams put aside. (6) Finally, the tree matcher selects the an- swer trees from these candidates....

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

... instance, containing only deter- miners, adjectives, nouns, and transitive and intransi- tive verbs, will give rise to more than 60 instantiated rules if precompiled without restriction, whereas ... almost, as efficient as TD/I, eventhough it works with a generic grammar, and thus produces (significantly) more chart-items. Once we replace the generic grammar by an instantiated grammar, and add ... set, and thus can be used to compile arbitrary UGs. Such a compilation step will give rise to a substantially more instantiated rule set in all cases 3Note that for classical CG, an algorithm...

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

... values r(g) and 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 ... loop invariant is that X is a 2-feasible set, and that the union of all po- sition sets in X has fan-out ≤ 2: reductions can never change the union of all sets in X , and The- orem 1 guarantees us ... has fan-out ≤ 2) and that it cannot equal E D 1 D 2 because this would mean that X = {D 1 , D 2 }, and by hypothesis X has more than two position sets. If we call this endpoint x, this means that...

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