Paper: Licensing And Tree Adjoining Grammar In Government Binding Parsing

ACL ID P90-1015
Title Licensing And Tree Adjoining Grammar In Government Binding Parsing
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1990
Authors
  • Robert Frank (University of Pennsylvania, Philadelphia PA)

This paper presents an implemented, psychologically plau- sible parsing model for Government Binding theory gram- mars. I make use of two main ideas: (1) a generaliza- tion of the licensing relations of [Abney, 1986] allows for the direct encoding of certain principles of grammar (e.g. Theta Criterion, Case Filter) which drive structure build- ing; (2) the working space of the parser is constrained to the domain determined by a Tree Adjoining Grammar elementary tree. All dependencies and constraints are lo- caiized within this bounded structure. The resultant parser operates in linear time and allows for incremental semantic interpretation and determination of grammaticaiity.