Weighted deductive parsing and Knuth's algorithm

Computational Linguistics

Volumn 29, Issue 1, 2003, Pages 135-143

  Nederhof, Mark Jan ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DEDUCTION SYSTEMS; DEDUCTIVE PARSING; DIJKSTRA'S ALGORITHMS; GENERAL METHOD; SHORTEST PATH PROBLEM;

GRAPH THEORY;

EID: 0042879603     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: 10.1162/089120103321337467     Document Type: Article

References (28)

1. Aho, Alfred V. and Jeffrey D. Ullman. 1972. Parsing, volume 1 of The Theory of Parsing, Translation and Compiling. Prentice-Hall, Englewood Cliffs, New Jersey.
2. Backhouse, Roland. 2001. Fusion on languages. In 10th European Symposium on Programming, volume 2028 of Lecture Notes in Computer Science, pages 107-121. Springer-Verlag, Berlin, April.
3. Bar-Hillel, Y., M. Perles, and E. Shamir. 1964. On formal properties of simple phrase structure grammars. In Y. Bar-Hillel, editor, Language and Information: Selected Essays on Their Theory and Application. Addison-Wesley, Reading, Massachusetts, pages 116-150.
4. Billot, Sylvie and Bernard Lang. 1989. The structure of shared forests in ambiguous parsing. In 27th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 143-151, Vancouver, British Columbia, Canada, June.
5. Boullier, Pierre. 2000. Range concatenation grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 53-64, Trento, Italy, February.
6. Bouloutas, A., G. W. Hart, and M. Schwartz. 1991. Two extensions of the Viterbi algorithm. IEEE Transactions on Information Theory, 37(2):430-436.
7. Chitrao, Mahesh V. and Ralph Grishman. 1990. Statistical parsing of messages. In Speech and Natural Language Proceedings, pages 263-266, Hidden Valley, Pennsylvania, June.
8. Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. 1990. Introduction to Algorithms. MIT Press, Cambridge.
9. Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271.
10. Eisner, Jason. 2000. Bilexical grammars and their cubic-time parsing algorithms. In H. Bunt and A. Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies. Kluwer Academic Publishers, Dordrecht, The Netherlands, pages 29-61.
11. Frisch, Alan M. and Peter Haddawy. 1994. Anytime deduction for probabilistic logic. Artificial Intelligence, 69:93-122.
12. Gallo, Giorgio, Giustino Longo, Stefano Pallottino, and Sang Nguyen. 1993. Directed hypergraphs and applications. Discrete Applied Mathematics, 42:177-201.
13. Goodman, Joshua. 1999. Semiring parsing. Computational Linguistics, 25(4):573-605.
14. Jelinek, F., J. D. Lafferty, and R. L. Mercer. 1992. Basic methods of probabilistic context free grammars. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding - Recent Advances, Trends and Applications. Springer-Verlag, Berlin, pages 345-360.
15. Klein, Dan and Christopher D. Manning. 2001. Parsing and hypergraphs. In Proceedings of the Seventh International Workshop on Parsing Technologies, pages 123-134, Beijing, October.
16. Knuth, Donald E. 1977. A generalization of Dijkstra's algorithm. Information Processing Letters, 6(1):1-5.
17. Lang, Bernard. 1974. Deterministic techniques for efficient non-deterministic parsers. In Automata, Languages and Programming, 2nd Colloquium, volume 14 of Lecture Notes in Computer Science, pages 255-269, Saarbrücken. Springer-Verlag, Berlin.
18. Lyon, Gordon. 1974. Syntax-directed least-errors analysis for context-free languages: A practical approach. Communications of the ACM, 17(1):3-14.
19. Martelli, Alberto and Ugo Montanari. 1978. Optimizing decision trees through heuristically guided search. Communications of the ACM, 21(12):1025-1039.
20. Schabes, Yves. 1992. Stochastic lexicalized tree-adjoining grammars. In Proceedings of the 15th International Conference on Computational Linguistics, volume 2, pages 426-432, Nantes, August.
21. Shieber, Stuart M., Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3-36.
22. Sikkel, Klaas. 1997. Parsing Schemata. Springer-Verlag, Berlin.
23. Stolcke, Andreas. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):167-201.
24. Tendeau, Frédéric. 1997. Analyse syntaxique et sémantique avec évaluation d'attributs dans un demi-anneau. Ph.D. thesis, University of Orléans.
25. Tjong Kim Sang, Erik F. 1998. Machine Learning of Phonotactics. Ph.D. thesis, University of Groningen.
26. van Noord, Gertjan, Gosse Bouma, Rob Keeling, and Mark-Jan Nederhof. 1999. Robust grammatical analysis for spoken dialogue systems. Natural Language Engineering, 5(1):45-93.
27. Vijay-Shanker, K. and David J. Weir. 1993. The use of shared forests in tree adjoining grammar parsing. In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, pages 384-393, Utrecht, The Netherlands, April.
28. Viterbi, Andrew J. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13(2):260-269.