Probabilistic parsing

Studies in Computational Intelligence

Volumn 113, Issue , 2008, Pages 229-258

  Nederhof, Mark Jan ^a   Satta, Giorgio ^b  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 46949090490     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-78291-9_7     Document Type: Article

References (73)

1. S. Abney, D. McAllester, and F. Pereira. Relating probabilistic grammars and automata. In 37th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 542-549, Maryland, USA, 1999.
2. A.V. Aho and T.G. Peterson. A minimum distance error-correcting parser for context-free languages. SIAM Journal on Computing, 1:305-312, 1972.
3. A.V. Aho and J.D. Ullman. Parsing, volume 1 of The Theory of Parsing, Translation and Compiling. Prentice-Hall, Englewood Cliffs, N.J., 1972.
4. J.K. Baker. Trainable grammars for speech recognition. In J.J. Wolf and D.H. Klatt, editors, Speech Communication Papers Presented at the 97th Meeting of the Acoustical Society of America, pages 547-550, 1979.
5. Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. In Y. Bar-Hillel, editor, Language and Information: Selected Essays on their Theory and Application, chapter 9, pages 116-150. Addison-Wesley, Reading, Massachusetts, 1964.
6. L.E. Baum. An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3:1-8, 1972.
7. A. Berger, S. Della Pietra, and V. Della Pietra. A maximum entropy approach to natural language processing. Computational Linguistics 22:39-71, 1996.
8. V.D. Blondel and C. Canterini. Undecidable problems for probabilistic automata of fixed dimension. Theory of Computing Systems, 36:231-245, 2003.
9. R. Bod, J. Hay, and S. Jannedy, editors. Probabilistic Linguistics MIT Press, 2003.
10. T.L. Booth and R.A. Thompson. Applying probabilistic measures to abstract languages. IEEE Transactions on Computers, C-22:442-450, 1973.
11. F. Casacuberta and C. de la Higuera. Computational complexity of problems on probabilistic grammars and transducers. In A. Oliveira, editor, Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Artificial Intelligence, pages 15-24. Springer-Verlag, 2000.
12. E. Charniak. Statistical Language Learning. MIT Press, 1993.
13. R. Chaudhuri, S. Pham, and O.N. Garcia. Solution of an open problem on probabilistic grammars. IEEE Transactions on Computers, C-32:748-750, 1983.
14. S.F. Chen and J. Goodman. An empirical study of smoothing techniques for language modeling. In 34th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 310-318, Santa Cruz, California, USA, 1996.
15. Z. Chi. Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25:131-160, 1999.
16. Z. Chi and S. Geman. Estimation of probabilistic context-free grammars. Computational Linguistics, 24:299-305, 1998.
17. M.V. Chitrao and R. Grishman. Statistical parsing of messages. In Speech and Natural Language, Proceedings, pages 263-266, Hidden Valley, Pennsylvania, 1990.
18. M. Collins. Three generative, lexicalised models for statistical parsing. In 35th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 16-23, Madrid, Spain, 1997.
19. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
20. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statistical Society Series, B 39:1-38, 1977.
21. J. Eisner and G. Satta. Efficient parsing for bilexical context-free grammars and head automaton grammars. In 37th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference pages 457-464, Maryland, USA, 1999.
22. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In 22nd International Symposium on Theoretical Aspects of Computer Science, volume 3404 of Lecture Notes in Computer Science, pages 340-352, Stuttgart, Germany, 2005. Springer-Verlag.
23. R. Freivalds. Probabilistic machines can use less running time. In Proceedings of IFIP Congress 77, pages 839-842, Toronto, 1977.
24. K.S. Fu and T. Huang. Stochastic grammars and languages. International Journal of Computer and Information Sciences, 1:135-170, 1972.
25. J. Goodman. Semiring parsing. Computational Linguistics, 25:573-605, 1999.
26. S.L. Graham, M.A. Harrison, and W.L. Ruzzo. An improved context-free recognizer. ACM Transactions on Programming Languages and Systems, 2:415-462, 1980.
27. L. Huang and D. Chiang. Better k-best parsing. In Proceedings of the Ninth International Workshop on Parsing Technologies, pages 53-64, Vancouver, British Columbia, Canada, 2005.
28. T. Huang and K.S. Fu. On stochastic context-free languages. Information Sciences, 3:201-224, 1971.
29. S.E. Hutchins. Moments of strings and derivation lengths of stochastic contextfree grammars. Information Sciences, 4:179-191, 1972.
30. F. Jelinek and J.D. Lafferty. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17:315-323, 1991.
31. F. Jelinek, J.D. Lafferty, and R.L. Mercer. Basic methods of probabilistic context free grammars. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding - Recent Advances, Trends and Applications, pages 345-360. Springer-Verlag, 1992.
32. V.M. Jiménez and A. Marzal. Computation of the n best parse trees for weighted and stochastic context-free grammars. In Advances in Pattern Recognition, volume 1876 of Lecture Notes in Computer Science, pages 183-192, Alicante, Spain, 2000. Springer-Verlag.
33. M. Johnson. PCFG models of linguistic tree representations. Computational Linguistics, 24:613-632, 1998.
34. D. Klein and C.D. Manning. Parsing and hypergraphs. In Proceedings of the Seventh International Workshop on Parsing Technologies, Beijing, China, 2001.
35. D.E. Knuth. A generalization of Dijkstra's algorithm. Information Processing Letters, 6:1-5, 1977.
36. W. Kuich. Semirings and formal power series: Their relevance to formal languages and automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Vol. 1, chapter 9, pages 609-677. Springer, Berlin, 1997.
37. J. Kupiec. Hidden Markov estimation for unrestricted stochastic context-free grammars. In ICASSP'92, volume I, pages 177-180, 1992.
38. B. Lang. A generative view of ill-formed input processing. In ATR Symposium on Basic Research for Telephone Interpretation, Kyoto, Japan, 1989.
39. K. Lari and S.J. Young. The estimation of stochastic context-free grammars using the Inside-Outside algorithm. Computer Speech and Language, 4:35-56, 1990.
40. A. Lavie. An integrated heuristic scheme for partial parse evaluation. In 32nd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 316-318, Las Cruces, New Mexico, USA, 1994.
41. A. Lavie and M. Tomita. GLR* - an efficient noise-skipping parsing algorithm for context free grammars. In Third International Workshop on Parsing Technologies, pages 123-134, Tilburg (The Netherlands) and Durbuy (Belgium), 1993.
42. G. Lyon. Syntax-directed least-errors analysis for context-free languages: A practical approach. Communications of the ACM, 17:3-14, 1974.
43. C.D. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
44. A. Martelli and U. Montanari. Optimizing decision trees through heuristically guided search. Communications of the ACM, 21:1025-1039, 1978.
45. M. Mohri. Statistical natural language processing. In M. Lothaire, editor, Applied Combinatorics on Words, chapter 4, pages 210-240. Cambridge University Press, 2005.
46. M.-J. Nederhof. Weighted deductive parsing and Knuth's algorithm. Computational Linguistics, 29:135-143, 2003.
47. M.-J. Nederhof, A. Sarkar, and G. Satta. Prefix probabilities for linear indexed grammars. In Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, pages 116-119. Institute for Research in Cognitive Science, University of Pennsylvania, 1998.
48. M.-J. Nederhof, A. Sarkar, and G. Satta. Prefix probabilities from stochastic tree adjoining grammars. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, volume 2, pages 953-959, Montreal, Quebec, Canada, 1998.
49. M.-J. Nederhof and G. Satta. Probabilistic parsing as intersection. In 8th International Workshop on Parsing Technologies, pages 137-148, LORIA, Nancy, France, 2003.
50. M.-J. Nederhof and G. Satta. An alternative method of training probabilistic LR parsers. In 42nd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 551-558, Barcelona, Spain, 2004.
51. M.-J. Nederhof and G. Satta. Tabular parsing. In C. Martin-Vide, V. Mitrana, and G. Paun, editors, Formal Languages and Applications, pages 529-549. Springer, 2004.
52. M.-J. Nederhof and G. Satta. Estimation of consistent probabilistic context-free grammars. In Proceedings of the Human Language Technology Conference of the NAACL, Main Conference, pages 343-350, New York, USA, 2006.
53. M.-J. Nederhof and G. Satta. Probabilistic parsing strategies. Journal of the ACM, 53:406-436, 2006.
54. L.R. Nielsen, D. Pretolani, and K.A. Andersen. Finding the k shortest hyperpaths using reoptimization. Operations Research Letters 34:155-164, 2006.
55. A. Paz. Introduction to Probabilistic Automata. Academic Press, New York, 1971.
56. E. Persoon and K.S. Fu. Sequential classification of strings generated by SCFG's. International Journal of Computer and Information Sciences 4:205-217, 1975.
57. D. Prescher. Inside-outside estimation meets dynamic EM. In Proceedings of the Seventh International Workshop on Parsing Technologies, Beijing, China, 2001.
58. P. Resnik. Probabilistic tree-adjoining grammar as a framework for statistical natural language processing. In Proceedings of the fifteenth International Conference on Computational Linguistics, volume 2, pages 418-424, Nantes, 1992.
59. A. Salomaa. Probabilistic and weighted grammars. Information and Control, 15:529-544, 1969.
60. J.-A. Sánchez and J.-M. Benedí. Consistency of stochastic context-free grammars from probabilistic estimation based on growth transformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19:1052-1055, 1997.
61. E.S. Santos. Probabilistic grammars and automata. Information and Control, 21:27-47, 1972.
62. E.S. Santos. Probabilistic pushdown automata. Journal of Cybernetics 6:173-187, 1976.
63. Y. Schabes. Stochastic lexicalized tree-adjoining grammars. In Proceedings of the fifteenth International Conference on Computational Linguistics, volume 2, pages 426-432, Nantes, 1992.
64. K. Sima'an. Computational complexity of probabilistic disambiguation. Grammars, 5:125-151, 2002.
65. S. Sippu and E. Soisalon-Soininen. Parsing Theory, Vol. I: Languages and Parsing, volume 15 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
66. A. Stolcke. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21:167-201, 1995.
67. R. Teitelbaum. Context-free error analysis by evaluation of algebraic power series. In Conference Record of the Fifth Annual ACM Symposium on Theory of Computing, pages 196-199, 1973.
68. F. Tendeau. Stochastic parse-tree recognition by a pushdown automaton. In Fourth International Workshop on Parsing Technologies, pages 234-249, Prague and Karlovy Vary, Czech Republic, 1995.
69. R.A. Thompson. Determination of probabilistic grammars for functionally specified probability-measure languages. IEEE Transactions on Computers, C-23:603-614, 1974.
70. E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta, and R.C. Carrasco. Probabilistic finite-state machines - part I. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27:1013-1025, 2005.
71. A.J. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory IT-13:260-269, 1967.
72. R.A.Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the ACM, 21:168-173, 1974.
73. C.S. Wetherell. Probabilistic languages: A review and some open questions. Computing Surveys, 12:361-379, 1980.