Paper: Tabular Algorithms For TAG Parsing

ACL ID E99-1020
Title Tabular Algorithms For TAG Parsing
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1999

We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex pre- dictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.