Computer Science – Computation and Language
Scientific paper
1995-01-09
Proceedings of TAG+3, 1994
Computer Science
Computation and Language
Scientific paper
We present the results of an investigation into how the set of elementary trees of a Lexicalized Tree Adjoining Grammar can be represented in the lexical knowledge representation language DATR (Evans & Gazdar 1989a,b). The LTAG under consideration is based on the one described in Abeille et al. (1990). Our approach is similar to that of Vijay-Shanker & Schabes (1992) in that we formulate an inheritance hierarchy that efficiently encodes the elementary trees. However, rather than creating a new representation formalism for this task, we employ techniques of established utility in other lexically-oriented frameworks. In particular, we show how DATR's default mechanism can be used to eliminate the need for a non-immediate dominance relation in the descriptions of the surface LTAG entries. This allows us to embed the tree structures in the feature theory in a manner reminiscent of HPSG subcategorisation frames, and hence express lexical rules as relations over feature structures.
Evans Roger
Gazdar Gerald
Weir David
No associations
LandOfFree
Using default inheritance to describe LTAG does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Using default inheritance to describe LTAG, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using default inheritance to describe LTAG will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-152696