Feature-Based TAG in place of multi-component adjunction: Computational Implications
B.A. Hockey, B. Srinivas (University of Pennsylvania)

TL;DR
This paper demonstrates that feature-based Tree Adjoining Grammar (TAG) can analyze complex constructions in English effectively, allowing existing parsers to handle them without multi-component adjunction, thus simplifying computational implementation.
Contribution
It introduces a feature-based TAG approach that replaces multi-component adjunction, enabling efficient parsing with existing unification-based TAG parsers.
Findings
Feature-based TAG can analyze constructions previously requiring multi-component adjunction.
Existing TAG parsers can parse these constructions without modifications.
The approach maintains linguistic coverage for English.
Abstract
Using feature-based Tree Adjoining Grammar (TAG), this paper presents linguistically motivated analyses of constructions claimed to require multi-component adjunction. These feature-based TAG analyses permit parsing of these constructions using an existing unification-based Earley-style TAG parser, thus obviating the need for a multi-component TAG parser without sacrificing linguistic coverage for English.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsManufacturing Process and Optimization
