Open AccessMultiple Adjunction in Feature-Based Tree-Adjoining Grammar
Author(s) -
Claire Gardent,
Shashi Narayan
Publication year - 2015
Publication title -
computational linguistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.314
H-Index - 98
eISSN - 1530-9312
pISSN - 0891-2017
DOI - 10.1162/coli_a_00217
Subject(s) - computer science , parsing , feature (linguistics) , natural language processing , s attributed grammar , tree adjoining grammar , l attributed grammar , artificial intelligence , grammar , tree (set theory) , semantic feature , rule based machine translation , adjunction , interpretation (philosophy) , semantic interpretation , attribute grammar , mildly context sensitive grammar formalism , programming language , context free grammar , mathematics , generative grammar , phrase structure rules , linguistics , mathematical analysis , philosophy , pure mathematics
International audienceIn parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation, and statistical language modeling. However, the parsing algorithm they propose is not directly applicable to Feature-Based TAGs (FB-TAG). We provide a recognition algorithm for FB-TAG that supports both dependent and independent derivations. The resulting algorithm combines the benefits of independent derivations with those of Feature-Based grammars. In particular , we show that it accounts for a range of interactions between dependent vs. independent derivation on the one hand, and syntactic constraints, linear ordering, and scopal vs. nonscopal semantic dependencies on the other hand
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom