K. Vijay-Shanker
ABSTRACT
We present a scheme for efficiently representing a lexicalized tree-adjoining grammar (LTAG). The proposed representational scheme allows for structure-sharing between lexical entries and the trees associated with the lexical items. A compact organization is achieved by organizing the lexicon in a hierarchical fashion and using inheritance as well as by using lexical and syntactic rules.While different organizations (Flickinger, 1987; Pollard and Sag, 1987; Shieber, 1986) of the lexicon have been proposed, in the scheme we propose, the inheritance hierarchy not only provides structure-sharing of lexical information but also of the associated elementary trees of extended domain of locality. Furthermore, the lexical and syntactic rules can be used to derive new elementary trees from the default structures specified in the hierarchical lexicon.In the envisaged scheme, the use of a hierarchical lexicon and of lexical and syntactic rules for lexicalized tree-adjoining grammars will capture important linguistic generalizations and also allows for a space efficient representation of the grammar. This will allow for easy maintenance and facilitate updates to the grammar.
- Anne Abeíllé, Kathleen M. Bishop, Sharon Cote, and Yves Schabes. 1990. A lexicalized tree adjoining grammar for English. Technical Report MS-CIS-90-24, Department of Computer and Information Science, University of Pennsylvania.Google Scholar
- Anne Abeíllé. 1988. Parsing french with tree adjoining grammar: some linguistic accounts. In Proceedings of the 12th International Conference on Computational Linguistics (COLING'88), Budapest, August. Google ScholarDigital Library
- T. Becker. 1990. Meta-rules on tree adjoining grammars. In Proceedings of the 1st International Workshop on Tree Adjoining Grammars, Dagstuhl Castle, FRG, August.Google Scholar
- J. Bresnan and R. Kaplan. 1983. Lexical-functional grammar: A formal system for grammatical representation. In The Mental Representation of Grammatical Relations. M.I.T. Press, Cambridge, MA.Google Scholar
- Daniel Paul Flickinger. 1987. Lexical Rules in the Hierarchical Lexicon. Ph.D. thesis, Stanford University.Google Scholar
- G. Gazdar, E. Klein, G. K. Pullum, and I. A. Sag. 1985. Generalized Phrase Structure Grammars. Blackwell Publishing, Oxford. Also published by Harvard University Press, Cambridge, MA.Google Scholar
- Benoit Habert. 1991. Using inheritance in object-oriented programming to combine syntactic rules and lexical idiosyncrasies. In Proceedings of the second International Workshop on Parsing Technologies, Cancun, Mexico, February.Google Scholar
- Aravind K. Joshi. 1987. Word-order variation in natural language generation. In AAAI 87, Sixth National Conference on Artificial Intelligence, pages 550--555, Seattle, Washington, July.Google Scholar
- Anthony Kroch and Aravind K. Joshi 1985. Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-18, Department of Computer and Information Science, University of Pennsylvania, April.Google Scholar
- Anthony Kroch. 1987. Unbounded dependencies and subjacency in a tree adjoining grammar. In A. Manaster-Ramer, editor, Mathematics of Language. John Benjamins, Amsterdam.Google Scholar
- Anthony Kroch. 1989. Asymmetries in long distance extraction in a tag grammar. In M. Baltin and A. Kroch, editors, Alternative Conceptions of Phrase Structure, pages 66--98. University of Chicago Press.Google Scholar
- Carl Pollard and Ivan A. Sag. 1987. Information-Based Syntax and Semantics. Vol. 1: Fundamentals. CSLI. Google ScholarDigital Library
- Jim Rogers and K. Vijay-Shanker. 1992. Reasoning with descriptions of trees. In 30thMeeting of the Association for Computational Linguistics (ACL'92). Google ScholarDigital Library
- Yves Schabes, Anne Abeillé, and Aravind K. Joshi. 1988. Parsing strategies with 'lexicalized' grammars: Application to tree adjoining grammars. In Proceedings of the 12th International Conference on Computational Linguistics (COLING'88), Budapest, Hungary, August. Google ScholarDigital Library
- Yves Schabes. 1990. Mathematical and Computational Aspects of Lexicalized Grammars. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, August. Available as technical report (MS-CIS-90-48, LINC LAB179) from the Department of Computer Science. Google ScholarDigital Library
- Stuart Shieber and Yves Schabes. 1990. Synchronous tree adjoining grammars. In Proceedings of the 13th International Conference on Computational Linguistics (COLING'90), Helsinki. Google ScholarDigital Library
- Stuart M. Shieber, 1986. An Introduction to Unification-Based Approaches to Grammar. Center for the Study of Language and Information, Stanford, CA.Google Scholar
- K. Vijay-Shanker. 1992. Using description of trees in a tree adjoining grammar. To appear in Computational Linguistics. Google ScholarDigital Library
- Structure sharing in lexicalized tree-adjoining grammars
Recommendations
Stochastic lexicalized tree-adjoining grammars
COLING '92: Proceedings of the 14th conference on Computational linguistics - Volume 2The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is formally defined. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and ...
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88: Proceedings of the 26th annual meeting on Association for Computational LinguisticsWe 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 ...
Lexicalized context-free grammars
ACL '93: Proceedings of the 31st annual meeting on Association for Computational LinguisticsLexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that ...
Comments