Multiple Adjunction in Feature-Based Tree-Adjoining Grammar - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Computational Linguistics Année : 2015

Multiple Adjunction in Feature-Based Tree-Adjoining Grammar

Résumé

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.
Fichier principal
Vignette du fichier
gardent-narayan-CL-june2014.pdf (285 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01249975 , version 1 (04-01-2016)

Identifiants

Citer

Claire Gardent, Shashi Narayan. Multiple Adjunction in Feature-Based Tree-Adjoining Grammar. Computational Linguistics, 2015, 41 (1), pp.29. ⟨10.1162/COLI_a_00217⟩. ⟨hal-01249975⟩
351 Consultations
139 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More