Semiring Parsing

Computational Linguistics

Volumn 25, Issue 4, 1999, Pages 572-605

  Goodman, Joshua ^a  

^a NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS;

DEDUCTIVE PARSING; GENERAL SYSTEMS; PARSING ALGORITHM; SEMI-RING; SEMIRINGS; TREE ADJOINING GRAMMARS; VITERBI;

FORMAL LANGUAGES;

EID: 0039029320     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. Baker, James K. 1979. Trainable grammars for speech recognition. In Proceedings of the Spring Conference of the Acoustical Society of America, pages 547-550, Boston, MA, June.
2. Baum, Leonard E. 1972. An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3:1-8.
3. Baum, Leonard E. and J. A. Eagon. 1967. An inequality with application to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bulletin of the American Mathematicians Society, 73:360-363.
4. Billot, Sylvie and Bernard Lang. 1989. The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Annual Meeting, pages 143-151, Vancouver. Association for Computational Linguistics.
5. Chomsky, Noam and Marcel-Paul Schützenberger. 1963. The algebraic theory of context-free languages. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems. North-Holland, pages 118-161.
6. Cormen, Thomas H., Charles E. Leiserson, and Ronald L. Rivest. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
7. Earley, Jay. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13:94-102.
8. Goodman, Joshua. 1996a. Efficient algorithms for parsing the DOP model. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 143-152, May. Available as cmp-lg/9604008.
9. Goodman, Joshua. 1996b. Parsing algorithms and metrics. In Proceedings of the 34th Annual Meeting, pages 177-183, Santa Cruz, CA, June. Association for Computational Linguistics. Available as cmp-lg/9605036.
10. Goodman, Joshua. 1997. Global thresholding and multiple-pass parsing. In Proceedings of the Second Conference on Empirical Methods in Natural Language Processing, pages 11-25.
11. Goodman, Joshua. 1998. Parsing Inside-Out. Ph.D. thesis, Harvard University. Available as cmp-lg/9805007 and from http://www.eecs.harvard.edu/ ~goodman/thesis.ps.
12. Goodman, Joshua. 1999. Semiring parsing. Computational Linguistics, 25(4)573-605.
13. Graham, Susan L., Michael A. Harrison, and Walter L. Ruzzo. 1980. An improved context-free recognizer. ACM Transactions on Programming Languages and Systems, 2(3):415-462, July.
14. Jelinek, Frederick and John D. Lafferty. 1991. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, pages 315-323.
15. Koller, Daphne, David McAllester, and Avi Pfeffer. 1997. Effective bayesian inference for stochastic programs. In Proceedings of the 14th National Conference on Artificial Intelligence, pages 740-747, Providence, RI, August.
16. Kuich, Werner. 1997. Semirings and formal power series: Their relevance to formal languages and automata. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages. Springer-Verlag, Berlin, pages 609-677.
17. Kuich, Werner and Arto Salomaa. 1986. Semirings, Automata, Languages. Number 5 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany.
18. Lari, K. and S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4:35-56.
19. Leermakers, René. 1989. How to cover a grammar. In Proceedings of the 27th Annual Meeting, pages 135-142, Vancouver. Association for Computational Linguistics.
20. Nijholt, Anton. 1980. Context-free Grammars: Covers, Normal Forms, and Parsing. Number 93 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany.
21. Pereira, Fernando and Stuart Shieber. 1987. Prolog and Natural Language Analysis. Number 10 of CSU Lecture Notes. Center for the Study of Language and Information, Stanford, CA.
22. Pereira, Fernando and David Warren. 1983. Parsing as deduction. In Proceedings of the 21st Annual Meeting, pages 137-44, Cambridge, MA. Association for Computational Linguistics.
23. Salomaa, Arto and Matti Soittola. 1978. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag, Berlin, Germany.
24. Shieber, Stuart, Yves Schabes, and Fernando Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2):3-36.
25. Sikkel, Klaas. 1993. Parsing Schemata. Ph.D. thesis, University of Twente, Enschede, The Netherlands.
26. Stolcke, Andreas. 1993. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Technical Report TR-93-065, International Computer Science Institute, Berkeley, CA. Available as cmp-lg/9411029.
27. Teitelbaum, Ray. 1973. Context-free error analysis by evaluation of algebraic power series. In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pages 196-199, Austin, TX.
28. Tendeau, Frédéric. 1997a. Computing abstract decorations of parse forests using dynamic programming and algebraic power series. Theoretical Computer Science. To appear.
29. Tendeau, Frédéric. 1997b. An Earley algorithm for generic attribute augmented grammars and applications. In Proceedings of the International Workshop on Parsing Technologies 1997, pages 199-209.
30. Viterbi, Andrew J. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13:260-267.