Multiple Adjunction in Feature-based Tree-adjoining Grammar

Claire Gardent; Shashi Narayan

doi:10.1162/COLI_a_00217

Multiple Adjunction in Feature-based Tree-adjoining Grammar

Claire Gardent, Shashi Narayan

Research output: Contribution to journal › Article › peer-review

Abstract

In 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.

Original language	English
Pages (from-to)	41-70
Number of pages	30
Journal	Computational Linguistics
Volume	41
Issue number	1
DOIs	https://doi.org/10.1162/COLI_a_00217
Publication status	Published - 1 Mar 2015

Access to Document

10.1162/COLI_a_00217

coli_a_00217Final published version, 781 KB

http://dl.acm.org/citation.cfm?id=2812183

Cite this

@article{debb9f6c92754c299297f210a2a8d163,

title = "Multiple Adjunction in Feature-based Tree-adjoining Grammar",

abstract = "In 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.",

author = "Claire Gardent and Shashi Narayan",

year = "2015",

month = mar,

day = "1",

doi = "10.1162/COLI_a_00217",

language = "English",

volume = "41",

pages = "41--70",

journal = "Computational Linguistics",

issn = "0891-2017",

publisher = "MIT Press Journals",

number = "1",

}

TY - JOUR

T1 - Multiple Adjunction in Feature-based Tree-adjoining Grammar

AU - Gardent, Claire

AU - Narayan, Shashi

PY - 2015/3/1

Y1 - 2015/3/1

N2 - In 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.

AB - In 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.

U2 - 10.1162/COLI_a_00217

DO - 10.1162/COLI_a_00217

M3 - Article

SN - 0891-2017

VL - 41

SP - 41

EP - 70

JO - Computational Linguistics

JF - Computational Linguistics

IS - 1

ER -

Multiple Adjunction in Feature-based Tree-adjoining Grammar

Abstract

Access to Document

Fingerprint

Cite this