Parsing non-recursive context-free grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2002-July, Issue , 2002, Pages 112-119

  Nederhof, Mark Jan ^a,c   Satta, Giorgio ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF PADOVA   (Italy)

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

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH RECOGNITION;

CONTEXT-FREE GRAMMARS; FINITE LANGUAGES; LANGUAGE PROCESSING; MACHINE TRANSLATIONS; NATURAL LANGUAGE GENERATION; NATURAL LANGUAGES; PSPACE-COMPLETE;

CONTEXT FREE GRAMMARS;

EID: 24344487858     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Y. Bar-Hillel, 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, chapter 9, pages 116-150. Addison-Wesley.
2. A. Corazza and A. Lavelli. 1994. An N-best representation for bidirectional parsing strategies. In Working Notes of the AAAI'94 Workshop on Integration of Natural Language and Speech Processing, pages 7-14, Seattle, WA.
3. J. Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, February.
4. M.A. Harrison. 1978. Introduction to Formal Language Theory. Addison-Wesley.
5. K. Knight and I. Langkilde. 2000. Preserving ambiguities in generation via automata intersection. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, pages 697-702, Austin, Texas, USA, July-August.
6. I. Langkilde. 2000. Forest-based statistical sentence generation. In 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics, pages Section 2, 170-177, Seattle, Washington, USA, April-May.
7. M.-J. Nederhof and G. Satta. 2002. The emptiness problem for intersection of a CFG and a nonrecursive CFG is PSPACE-complete. In preparation.
8. S.M. Shieber, Y. Schabes, and F.C.N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3-36.