A structure-sharing parser for lexicalized grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1, Issue , 1998, Pages 372-378

  Evans, Roger ^a   Weir, David ^b  

^a UNIVERSITY OF BRIGHTON   (United Kingdom)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; FORMAL LANGUAGES;

DIFFERENT STRUCTURE; ELEMENTARY STRUCTURE; FINITE-STATE AUTOMATA; PARSING ALGORITHM; STANDARD ALGORITHMS; STRUCTURE SHARING;

AUTOMATA THEORY;

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

References (12)

1. H. Alshawi. 1996. Head automata and bilingual tilings: Translation with minimal representations. In ACL96, pages 167-176.
2. J. Carroll, N. Nicolov, O. Shaumyan, M. Smets, and D. Weir. 1998. Grammar compaction and computation sharing in automaton-based parsing. In Proceedings of the First Workshop on Tabulation in Parsing and Deduction, pages 16-25.
3. J. Chen and K. Vijay-Shanker. 1997. Towards a reduced-commitment D-theory style TAG parser. In IWPT97, pages 18-29.
4. J. Eisner. 1997. Bilexical grammars and a cubictime probabilistic parser. In IWPT97, pages 54-65.
5. R. Evans and D. Weir. 1997. Automaton-based parsing for lexicalized grammars. In IWPT97, pages 66-76.
6. D. A. Huffman. 1954. The synthesis of sequential switching circuits. J. Franklin Institute.
7. A. K. Joshi and Y. Schabes. 1991. Tree-adjoining grammars and lexicalized grammars. In Maurice Nivat and Andreas Podelski, editors, Definability and Recognizability of Sets of Trees. Elsevier.
8. E. F. Moore, 1956. Automata Studies, chapter Gedanken experiments on sequential machines, pages 129-153. Princeton University Press, N. J.
9. Y. Schabes and A. K. Joshi. 1988. An Earley-type parsing algorithm for tree adjoining grammars. In ACL88.
10. K. Vijay-Shanker and A. K. Joshi. 1985. Some computational properties of tree adjoining grammars. In ACL85, pages 82-93.
11. K. Vijay-Shanker and D. Weir. 1993. Parsing some constrained grammar formalisms. Computational Linguistics, 19 (4) :591-636.
12. W. A. Woods. 1970. Transition network grammars for natural language analysis. Commun. ACM, 13:591-606.