论文信息 - A linear time extension of deterministic pushdown automata

A linear time extension of deterministic pushdown automata

A linear time extension of deterministic pushdown automata is introduced that recognizes all deterministic context-free languages, but also languages such as {a n b n c n | n ≥ 0} and the MIX language. It is argued that this new class of automata, called -acyclic read-first deterministic stack+bag pushdown automata, has applications in natural language processing.

Anders Søgaard | Anders Søgaard

[1] David J. Weir,et al. The equivalence of four extensions of context-free grammars , 1994, Mathematical systems theory.

[2] Timm Lichte,et al. 1 An MCTAG with Tuples for Coherent Constructions in German , 2007 .

[3] David J. Weir. A Geometric Hierarchy Beyond Context-Free Languages , 1992, Theor. Comput. Sci..

[4] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[5] Eric Villemonte de la Clergerie. Parsing Mildly Context-Sensitive Languages with Thread Automata , 2002, COLING.

[6] Mark-Jan Nederhof,et al. Regular Closure of Deterministic Languages , 1999, SIAM J. Comput..

[7] Michael A. Palis,et al. Pumping lemmas for the control language hierarchy , 1995, Mathematical systems theory.

[8] David J. Weir,et al. Parsing Some Constrained Grammar Formalisms , 1993, Comput. Linguistics.

[9] Fei Xia,et al. A Corpus-based evaluation of syntactic locality in TAGs , 2000, TAG+.

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

[11] Aravind K. Joshi,et al. Long-Distance Scrambling and Tree Adjoining Grammars , 1991, EACL.

[12] Pierre Boullier. A Proposal for a Natural Lan-guage Processing Syntactic Backbone , 1997 .

[13] Joakim Nivre,et al. An Efficient Algorithm for Projective Dependency Parsing , 2003, IWPT.

[14] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.

[15] Gerald Gazdar,et al. Applicability of Indexed Grammars to Natural Languages , 1988 .