Yves Schabes
ABSTRACT
We will describe an Earley-type parser for Tree Adjoining Grammars (TAGs). Although a CKY-type parser for TAGs has been developed earlier (Vijay-Shanker and Joshi, 1985), this is the first practical parser for TAGs because as is well known for CFGs, the average behavior of Earley-type parsers is superior to that of CKY-type parsers. The core of the algorithm is described. Then we discuss modifications of the parsing algorithm that can parse extensions of TAGs such as constraints on adjunction, substitution, and feature structures for TAGs. We show how with the use of substitution in TAGs the system is able to parse directly CFGs and TAGs. The system parses unification formalisms that have a CFG skeleton and also those with a TAG skeleton. Thus it also allows us to embed the essential aspects of PATR-II.
- Abeillé, Anne, 1988. A Computational Grammar for French in TAG. In Proceeding of the 12th International Conference on Computational Linguistics.Google Scholar
- Aho, A. V. and Ullman, J. D., 1973. Theory of Parsing, Translation and Compiling. Vol 1: Parsing. Prentice-Hall, Englewood Cliffs, NJ. Google ScholarDigital Library
- Earley, J., 1970. An Efficient Context-Free Parsing Algorithm. Commun. ACM 13(2):94--102. Google ScholarDigital Library
- Joshi, Aravind K., 1985. How Much Context-Sensitivity is Necessary for Characterizing Structural Descriptions --- Tree Adjoining Grammars. In Dowty, D.; Karttunen, L.; and Zwicky, A. (editors), Natural Language Processing --- Theoretical, Computational and Psychological Perspectives. Cambridge University Press, New York. Originally presented in 1983.Google Scholar
- Joshi, Aravind K., 1987. An Introduction to Tree Adjoining Grammars. In Manaster-Ramer, A. (editor), Mathematics of Language. John Benjamins, Amsterdam.Google Scholar
- Joshi, A. K.; Levy, L. S.; and Takahashi, M., 1975. Tree Adjunct Grammars. J. Comput. Syst. Sci. 10(1).Google ScholarDigital Library
- Kroch, A. and Joshi, A. K., 1985. Linguistic Relevance of Tree Adjoining Grammars. Technical Report MS-CIS-85-18, Department of Computer and Information Science, University of Pennsylvania.Google Scholar
- Schabes, Yves and Joshi, Aravind K., 1988. An Earley-type Parser for Tree Adjoining Grammars. Technical Report, Department of Computer and Information Science, University of Pennsylvania.Google Scholar
- Schabes, Yves; Abeillé, Anne; and Joshi, Aravind K., 1988. New Parsing Strategies for Tree Adjoining Grammars. In Proceedings of the 12th International Conference on Computational Linguistics. Google ScholarDigital Library
- Shieber, Stuart M., 1984. The Design of a Computer Language for Linguistic Information. In 22ndMeeting of the Association for Computational Linguistics, pages 362--366. Google ScholarDigital Library
- Shieber, Stuart M., 1986. An Introduction to Unification-Based Approaches to Grammar. Center for the Study of Language and Information, Stanford, CA.Google Scholar
- Vijay-Shanker, K., 1987. A Study of Tree Adjoining Grammars. PhD thesis, Department of Computer and Information Science, University of Pennsylvania. Google ScholarDigital Library
- Vijay-Shanker, K. and Joshi, A. K., 1985. Some Computational Properties of Tree Adjoining Grammars. In 23rdMeeting of the Association for Computational Linguistics, pages 82--93. Google ScholarDigital Library
- Vijay-Shanker, K. and Joshi, A.K., 1988. Feature Structure Based Tree Adjoining Grammars. In Proceedings of the 12th International Conference on Computational Linguistics. Google ScholarDigital Library
- An Earley-type parsing algorithm for Tree Adjoining Grammars
Recommendations
Mixed Parsing of Tree Insertion and Tree Adjoining Grammars
IBERAMIA 2002: Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial IntelligenceAdjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees ...
Fast LR parsing using rich (Tree Adjoining) Grammars
EMNLP '02: Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10We describe an LR parser of parts-of-speech (and punctuation labels) for Tree Adjoining Grammars (TAGs), that solves table conflicts in a greedy way, with limited amount of backtracking. We evaluate the parser using the Penn Treebank showing that the ...
Comments