Paper: Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars

ACL ID E91-1006
Title Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1991
Authors

In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated with a lexical item, called its anchor. The algorithm employs a mixed strategy: it works bot- tom-up from the lexical anchors and then expands (partial) analyses making top-down predictions. Even if such an algorithm does not improve tim worst-case time bounds of already known TAGs parsing meth- ods, it could be relevant from the perspective of linguistic information processing, because it em- ploys lexical information in a more direct way.