Probabilistic parsing strategies

Journal of the ACM

Volumn 53, Issue 3, 2006, Pages 406-436

  Nederhof, Mark Jan ^a   Satta, Giorgio ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Context free grammars; Parsing algorithms; Probabilistic parsing; Push down automata; Transduction

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; OPTIMIZATION; PROBABILISTIC LOGICS; PROBABILITY;

PARSING ALGORITHMS; PROBABILISTIC PARSING; PUSH-DOWN AUTOMATA; TRANSDUCTION;

CONTEXT FREE GRAMMARS;

EID: 33746878541     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1147954.1147959     Document Type: Article

References (56)

1. ABNEY, S., MCALLESTER, D., AND PEREIRA, F. 1999. Relating probabilistic grammars and automata. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics. 542-549.
2. BILLOT, S., AND LANG, B. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics (Vancouver, BC Canada). 143-151.
3. BLUM, N., AND KOCH, R. 1999. Greibach normal form transformation revisited. Inf. Comput. 150, 112-118.
4. BOOTH, T., AND THOMPSON, R. 1973. Applying probabilistic measures to abstract languages. IEEE Trans. Comput. C-22, 5 (May), 442-450.
5. BRISCOE, T., AND CARROLL, J. 1993. Generalized probabilistic LR parsing of natural language (corpora) with unification-based grammars. Computat. Ling. 19, 1, 25-59.
6. CHARNIAK, E. 1993. Statistical Language Learning. MIT Press, Cambridge, MA.
7. CHARNIAK, E. 2001. Immediate-head parsing for language models. In Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter of the Association for Computational Linguistics (Toulouse, France). 116-123.
8. CHARNIAK, E., AND CARROLL, G. 1994. Context-sensitive statistics for improved grammatical language models. In Proceedings of the 12th National Conference on Artificial Intelligence. Vol. 1. Seattle, WA). 728-733.
9. CHELBA, C., AND JELINEK, F. 1998. Exploiting syntactic structure for language modeling. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics. Vol. 1. (Montreal, Que. Canada). 225-231.
10. CHI, Z. 1999. Statistical properties of probabilistic context-free grammars. Computat. Ling. 25, 1, 131-160.
11. Cm, Z., AND GEMAN, S. 1998. Estimation of probabilistic context-free grammars. Computat. Ling. 24, 2, 299-305.
12. CHITRAO, M., AND GRISHMAN, R. 1990. Statistical parsing of messages. In Proceedings of the Conference on Speech and Natural Language. (Hidden Valley, PA). 263-266.
13. COLLINS, M. 1997. Three generative, lexicalised models for statistical parsing. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics (Madrid, Spain), 16-23.
14. BARLEY, J. 1970. An efficient context-free parsing algorithm. Commun. ACM 13, 2 (Feb.), 94-102.
15. GOLDSTINE, J., PRICE, K., AND WOTSCHKE, D. 1982. A pushdown automaton or a context-free grammar - Which is more economical? Theor. Comput. Sci. 18, 33-4-0.
16. GOODMAN, J. 1999. Semiring parsing. Computat. Ling. 25, 4, 573-605.
17. HARRISON, M. 1978. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA.
18. HUANG, T., AND FU, K. 1971. On stochastic context-free languages. Inf. Sci. 3, 201-224.
19. INUI, K., SORNLERTLAMVANICH, V., TANAKA, H., AND TOKUNAGA, T. 2000. Probabilistic GLR parsing. In Advances in Probabilistic and other Parsing Technologies, H. Bunt and A. Nijholt, Eds. Kluwer Academic Publishers, Dordrecht, Chap. 5, 85-104.
20. JELINEK, F., AND LAFFERTY, J. 1991. Computation of the probability of initial substring generation by stochastic context-free grammars. Computat. Linguistics 17, 3, 315-323.
21. JURAFSKY, D., AND MARTIN, J. 2000. Speech and Language Processing. Prentice-Hall, Englewood Cliffs, NJ.
22. KNUTH, D. 1965. On the translation of languages from left to right. Inf. Cont. 8, 607-639.
23. LANG, B. 1974. Deterministic techniques for efficient non-deterministic parsers. In Proceedings of the Automata, Languages and Programming, 2nd Colloquium. Lecture Notes in Computer Science, vol. 14. Springer-Verlag, Saarbrücken, 255-269.
24. LEERMAKERS, R. 1989. How to cover a grammar. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics. (Vancouver, BC, Canada). 135-142.
25. LEUNG, H., AND WOTSCHKE, D. 2000. On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242, 59-69.
26. MANNING, C., AND CARPENTER, B. 2000. Probabilistic parsing using left corner language models. In Advances in Probabilistic and other Parsing Technologies, H. Bunt and A. Nijholt, Eds. Kluwer Academic Publishers, Dordrecht, Chap. 6, 105-124.
27. MANNING, C., AND SCHÜTZE, H. 1999. Foundations of Statistical Natural Language Processing. Massachusetts Institute of Technology, Cambridge, MA.
28. NEDERHOF, M.-J. 1993. Generalized left-corner parsing. In Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics (Utrecht, The Netherlands). 305-314.
29. NEDERHOF, M.-J. 1994. An optimal tabular parsing algorithm. In Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics (Las Cruces, NM). 117-124.
30. NEDERHOF, M.-J., AND SARBO, J. 1996. Increasing the applicability of LR parsing. In Recent Advances in Parsing Technology, H. Bunt and M. Tomita, Eds. Kluwer Academic Publishers, Dordrecht, Chap. 3, 35-57.
31. NEDERHOF, M.-J., AND SATTA, G. 2003. Probabilistic parsing as intersection. In Proceedings of the 8th International Workshop on Parsing Technologies. LORIA, Nancy, France, 137-148.
32. NEDERHOF, M.-J., AND SATTA, G. 2004a. An alternative method of training probabilistic LR parsers. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (Barcelona, Spain). 551-558.
33. NEDERHOF, M.-J., AND SATTA, G. 2004b. Probabilistic parsing strategies. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (Barcelona, Spain). 543-550.
34. NG, S.-K., AND TOMITA, M. 1991. Probabilistic LR parsing for general context-free grammars. In Proceedings of the 2nd International Workshop on Parsing Technologies (Cancun, Mexico). 154-163.
35. NIJHOLT, A. 1980. Context-Free Grammars: Covers, Normal Forms, and Parsing. Lecture Notes in Computer Science, vol. 93. Springer-Verlag, Berlin, Germany.
36. PERSOON, E., AND FU, K. 1975. Sequential classification of strings generated by SCFG's. Int. J. Comput. Inf. Sci. 4, 3, 205-217.
37. PURDOM, JR., P., AND BROWN, C. 1981. Parsing extended LR(k) grammars. Acta Inf. 15, 115-127.
38. ROARK, B., AND JOHNSON, M. 1999. Efficient probabilistic top-down and left-corner parsing. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics. 421-428.
39. ROSENKRANTZ, D., AND LEWIS II, P. 1970. Deterministic left corner parsing. In Proceedings of the IEEE Conference Record of the 11th Annual Symposium on Switching and Automata Theory (Santa Monica, CA). 139-152.
40. SÁNCHEZ, J.-A., AND BENEDÍ, J.-M. 1997. Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformations. IEEE Trans. Patt. Anal. Mach. Intel. 19, 9 (Sept.), 1052-1055.
41. SANTOS, E. 1972. Probabilistic grammars and automata. Inf. Cont. 21, 27-47.
42. SANTOS, E. 1976. Probabilistic pushdown automata. J. Cybern. 6, 173-187.
43. SHIEBER, S., SCHABES, Y., AND PEREIRA, F. 1995. Principles and implementation of deductive parsing. J. Logic Program. 24, 3-36.
44. SIKKEL, K. 1997. Parsing Schemata. Springer-Verlag, Berlin, Germany.
45. SIKKEL, K., AND NIJHOLT, A. 1997. Parsing of context-free languages. In Handbook of Formal Languages. Vol 2: Linear Modeling: Background and Applications, O. Rozenberg and A. Salomaa, Eds. Springer-Verlag, Berlin, Chap. 2, 61-100.
46. SIPPU, S., AND SOISALON-SOININEN, E. 1990. Parsing Theory, Vol. II: LR(k) and LL(k) Parsing. EATCS Monographs on Theoretical Computer Science, vol. 20. Springer-Verlag, Berlin, Germany.
47. SOISALON-SOININEN, E., AND UKKONEN, E. 1979. A method for transforming grammars into LL(k) form. Acta Inf. 12, 339-369.
48. SORNLERTLAMVANICH, V., INUI, K., TANAKA, H., TOKUNAGA, T., AND TAKEZAWA, T. 1999. Empirical support for new probabilistic generalized LR parsing. J. Nat. Lang. Proc. 6, 3, 3-22.
49. STOLCKE, A. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computat. Ling. 21, 2, 167-201.
50. TENDEAU, F. 1995. Stochastic parse-tree recognition by a pushdown automaton. In Proceedings of the 4th International Workshop on Parsing Technologies (Prague and Karlovy Vary, Czech Republic). 234-249.
51. TENDEAU, F. 1997. Analyse syntaxique et sémantique avec évaluation d'attributs dans un demi-anneau. Ph.D. dissertation. University of Orléans.
52. VAN UYTSEL, D., AND VAN COMPERNOLLE, D. 2005. Language modeling with probabilistic left corner parsing. Comput. Speech Lang. 19, 171-204.
53. VILLEMONTE DE LA CLERGERIE, E. 1993. Automates à piles et programmation dynamique - DyALog: Une application à la programmation en logique. Ph.D. dissertation. Université Paris VII.
54. VOISIN, F. 1988. A bottom-up adaptation of Barley's parsing algorithm. In Programing Languages Implementation and Logic Programming, International Workshop (Orléans, France). Lecture Notes in Computer Science, vol. 348. Springer-Verlag, New York, 146-160.
55. WRIGHT, J., WRIGLEY, A., AND SHARMAN, R. 1991. Adaptive probabilistic generalized LR parsing. In Proceedings of the 2nd International Workshop on Parsing Technologies. Cancun, Mexico, 100-109.
56. WRIGHT, J., AND WRIGLEY, E. 1991. GLR parsing with probability. In Generalized LR Parsing, M. Tomita, Ed. Kluwer Academic Publishers, Dordrecht, Chap. 8, 113-128.