Communication Dans Un Congrès Année : 2010

On the Computational Complexity of Dominance Links in Grammatical Formalisms

Résumé

Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (ACL 1994), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science. We survey complexity results and open issues on MLIGs and related formalisms, and provide new complexity bounds for some linguistically motivated restrictions.

Fichier principal
Vignette du fichier
bvass.pdf (570.29 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00482396 , version 1 (10-05-2010)
hal-00482396 , version 2 (11-05-2010)
hal-00482396 , version 3 (17-07-2010)
hal-00482396 , version 4 (19-08-2010)
hal-00482396 , version 5 (19-08-2010)
hal-00482396 , version 6 (04-02-2014)

Licence

Identifiants

  • HAL Id : hal-00482396 , version 5

Citer

Sylvain Schmitz. On the Computational Complexity of Dominance Links in Grammatical Formalisms. ACL 2010, 2010, Uppsala, Sweden. pp.514--524. ⟨hal-00482396v5⟩
444 Consultations
743 Téléchargements

Partager

  • More