Sciweavers

Share
ACL
1990

Licensing and Tree Adjoining Grammar in Government Binding Parsing

11 years 2 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization 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 building; (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 locaiized within this bounded structure. The resultant parser operates in linear time and allows for incremental semantic interpretation and determination of grammaticaiity.
Robert Frank
Added 06 Nov 2010
Updated 06 Nov 2010
Type Conference
Year 1990
Where ACL
Authors Robert Frank
Comments (0)
books