an efficient parsing algorithm

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

... 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, 06:20

... Tabulation en Ana- lyse Syntaxique et Ddduction (Tabulation in Parsing and Deduction), pages 1-9, Paris, France, April. Y. Schabes and K. Vijay-Shanker. 1990. Deter- ministic left to right parsing ... 3, and the automaton that operates on these tables is given in Section 4. Section 5 first explains why the algorithm from Schabes and Vijay-Shanker (1990) is incorrect, and then provides an ... to correct the algorithm. We therefore developed an alternative to the algorithm from Schabes and Vijay-Shanker (1990). This alternative is novel in presenta- tional aspects, and is fundamentally...

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

... mapping (Hopcroft and Ull- man, 1979). This property also holds for our class of bilexical CFGs. References A. V. Aho and J. D. Ullman. 1972. The Theory of Parsing, Translation and Compiling, ... E. Hopcroft and J. D. Ullman. 1979. Introduc- tion to Automata Theory, Languages and Com- putation. Addison-Wesley, Reading, MA. 463 6 Multiple word senses Rather than parsing an input string ... reversed, Is is exchanged with Fa, and any transi- tion probabilities are replaced by those of the reversed Markov chain. 461 Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton...

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

... Grammars, and Natural Lan- guages. PhD Thesis, Stanford University. Pollard, C. J. and Sag, I. (1988) An Information-Based Approach to Syntax and Semantics : Volume 1 Fundamentals. Stanford, ... Study of Language and Information. S teedman, M. (1985) Dependency and Coordination in the Grammar of Dutch and English. Language, 61, 523 -568. Steedman, M. (1988) Combinators and Grammars. ... Grammar and Unification. In Reyle, U. and Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theo- ries, 202-229. Dordrecht : D. Reidel. Zeevat, H., Klein, E. and Calder, J. (1987) An Inlroduc-...

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

... would like to thank Bran Boguraev for his guidance during the writing of the interpreter, and for supplying the ATN grammars I have used. Thanks also to Karen Sparck Jones and John Tait for ... Natural Language Analysis". Communications of the ACM, 13, 10, 591-606. Woods, W. et al. (1976) ,,Parsers,' in "Speech Understanding Systems". Bolt, Beranek and Newman Inc. ... problems with scope clauses in an island parsing ATN interpreter: if an action (LIFTR <register> ) occurs in a sub-network, any action using that register in any higher sub-network that...

Ngày tải lên: 09/03/2014, 01: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

... conditional random fields (CRFs) and hidden Markov models (HMMs). Petrov and Klein (2008) reported on a syntactic parsing task that DPLVM models can learn more compact and accurate grammars than the ... Proceedings of ACL’06. Slav Petrov and Dan Klein. 2007. Improved infer- ence for unlexicalized parsing. In Human Language Technologies 2007: The Conference of the North American Chapter of the Association ... inference algorithms on DPLVMs, and the performance of CRFs. S.A. signifies sentence accuracy. As can be seen, at a much lower cost, the LDI-A (A signi- fies approximation) performed slightly better than the...

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

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

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