论文信息 - Commutation-augmented pregroup grammars and push-down automata with cancellation

Commutation-augmented pregroup grammars and push-down automata with cancellation

The paper proves a pumping lemma for a certain subclass of mildly context-sensitive languages, the one defined by commutation-augmented pregroup grammars; in addition, an automaton equivalent to such grammars is introduced, augmenting push-down automata by cancellation in the bottom of its stack.

Nissim Francez | Michael Kaminski | N. Francez | M. Kaminski

[1] Maxime Amblard,et al. A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars , 2006 .

[2] Aravind K. Joshi,et al. Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[3] M. W. Shields. An Introduction to Automata Theory , 1988 .

[4] David R. Dowty,et al. Natural Language Parsing , 2005 .

[5] Aravind K. Joshi,et al. A study of tree adjoining grammars , 1987 .

[6] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[8] David J. Weir,et al. Characterizing mildly context-sensitive grammar formalisms , 1988 .

[9] Giorgio Satta,et al. Theory of Parsing , 2010 .

[10] Wojciech Buszkowski,et al. Lambek Grammars Based on Pregroups , 2001, LACL.

[11] Wojciech Buszkowski,et al. Pregroup Grammars and Context-free Grammars , 2007 .

[12] Nissim Francez,et al. Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages , 2007, Stud Logica.