Practical experiments with regular approximation of context-free languages

Computational Linguistics

Volumn 26, Issue 1, 2000, Pages 17-44

  Nederhof, Mark Jan ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS;

SPEECH RECOGNIZER; SPOKEN LANGUAGES; SUPERSETS;

CONTEXT FREE LANGUAGES;

EID: 0012259830     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: 10.1162/089120100561610     Document Type: Article

References (28)

1. Baker, Theodore P. 1981. Extending lookahead for LR parsers. Journal of Computer and System Sciences, 22:243-259.
2. Bermudez, Manuel E. and Karl M. Schimpf. 1990. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences, 41:230-250.
3. Berstel, Jean. 1979. Transductions and Context-Free Languages. B. G. Teubner, Stuttgart.
4. Black, Alan W. 1989. Finite state machines from feature grammars. In International Workshop on Parsing Technologies, pages 277-285, Pittsburgh, PA.
5. Chomsky, Noam. 1959a. A note on phrase structure grammars. Information and Control, 2:393-395.
6. Chomsky, Noam. 1959b. On certain formal properties of grammars. Information and Control, 2:137-167.
7. Čulik, Karel II and Rina Cohen. 1973. LR-regular grammars - An extension of LR(k) grammars. Journal of Computer and System Sciences, 7:66-96.
8. Earley, Jay. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, February.
9. Grimley-Evans, Edmund. 1997. Approximating context-free grammars with a finite-state calculus. In Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics an 8th Conference of the European Chapter of the Association for Computational Linguistics, pages 452-459, Madrid, Spain.
10. Harrison, Michael A. 1978. Introduction to Formal Language Theory. Addison-Wesley.
11. Heckert, Erik. 1994. Behandlung von Syntaxfehlern für LR-Sprachen ohne Korrekturversuche. Ph.D. thesis, Ruhr-Universität Bochum.
12. Johnson, Mark. 1998. Finite-state approximation of constraint-based grammars using left-corner grammar transforms. In COLING-ACL '98: 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, volume 1, pages 619-623, Montreal, Quebec, Canada.
13. Krauwer, Steven and Louis des Tombe. 1981. Transducers and grammars as theories of language. Theoretical Linguistics, 8:173-202.
14. Langendoen, D. Terence and Yedidyah Langsam. 1987. On the design of finite transducers for parsing phrase-structure languages. In Alexis Manaster-Ramer, editor, Mathematics of Language. John Benjamins, Amsterdam, pages 191-235.
15. Mohri, Mehryar and Fernando C. N. Pereira. 1998. Dynamic compilation of weighted context-free grammars. In COLING-ACL '98: 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, volume 2, pages 891-897, Montreal, Quebec, Canada.
16. Mohri, Mehryar, Fernando C. N. Pereira, and Michael Riley. 1998. A rational design for a weighted finite-state transducer library. In Derick Wood and Sheng Yu, editors, Automata Implementation. Lecture Notes in Computer Science, Number 1436. Springer Verlag, pages 144-158.
17. Nederhof, Mark-Jan. 1994. Linguistic Parsing and Program Transformations. Ph.D. thesis, University of Nijmegen.
18. Nederhof, Mark-Jan. 1997. Regular approximations of CFLs: A grammatical view. In Proceedings of the International Workshop on Parsing Technologies, pages 159-170, Massachusetts Institute of Technology.
19. Nederhof, Mark-Jan. 1998. Context-free parsing through regular approximation. In Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pages 13-24, Ankara, Turkey.
20. Nederhof, Mark-Jan and Giorgio Satta. 1996. Efficient tabular LR parsing. In Proceedings of the 34th Annual Meeting, pages 239-246, Santa Cruz, CA. Association for Computational Linguistics.
21. Pereira, Fernando C. N. and Rebecca N. Wright. 1997. Finite-state approximation of phrase-structure grammars. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing. MIT Press, pages 149-173.
22. Pulman, S. G. 1986. Grammars, parsers, and memory limitations. Language and Cognitive Processes, 1(3):197-225.
23. Purdom, Paul Walton, Jr. and Cynthia A. Brown. 1981. Parsing extended LR(k) grammars. Acta Informatica, 15:115-127.
24. Resnik, Philip. 1992. Left-corner parsing and psychological plausibility. In COLING '92: Papers presented to the Fifteenth [sic] International Conference on Computational Linguistics, pages 191-197, Nantes, France.
25. Rosenkrantz, D. J. and P. M. Lewis, II. 1970. Deterministic left corner parsing. In IEEE Conference Record of the 11th Annual Symposium on Switching and Automata Theory, pages 139-152.
26. Seyfarth, Benjamin R. and Manuel E. Bermudez. 1995. Suffix languages in LR parsing. International Journal of Computer Mathematics, 55:135-153.
27. Stolcke, Andreas and Jonathan Segal. 1994. Precise N-gram probabilities from stochastic context-free grammars. In Proceedings of the 32nd Annual Meeting, pages 74-79, Las Cruces, NM. Association for Computational Linguistics.
28. Woods, W. A. 1970. Transition network grammars for natural language analysis. Communications of the ACM, 13(10)591-606.