A tabular interpretation of a class of 2-Stack Automata

Authors:
Eric Villemonte de la Clergerie;Miguel Alonso Pardo
Affiliations:
INRIA-Rocquencourt-B.P. 105, Le Chesnay, France;Universidad de La Coruña, La Coruña, Spain
Venue:
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Year:
1998

Citing 3
Cited 6

Formal and computational aspects of natural language syntax

Formal and computational aspects of natural language syntax
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
A study of tree adjoining grammars

A study of tree adjoining grammars

A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Tabular algorithms for TAG parsing

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Refining tabular parsers for TAGs

NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Tools and resources for Tree Adjoining Grammars

STAR '01 Proceedings of the ACL 2001 Workshop on Sharing Tools and Resources - Volume 15
Relating tabular parsing algorithms for LIG and TAG

New developments in parsing technology
LR parsing for global index languages (GILs)

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for all strategies, a time complexity in O(n6) and space complexity in O(n5) where n is the length of the input string.