A Tabular Interpretation of a Class of 2-Stack Automata

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(n 6) and space complexity in O(n5) where n is the length of the input string.

• Type: Conference
• Year: 1998
• Where: ACL
• Authors: Eric Villemonte de la Clergerie, Miguel A. Alonso
• Keywords: ACL 1998, ACL 2007, Tabular Interpretation, Tabular Interpretation Ensures, Various Parsing Strategies