Practical aspects in compiling tabular TAG parsers

This paper describes the extension of the system DyALog to compile tabular parsers from Fea- ture Tree Adjoining Grammars. The compilation process uses intermediary 2-stack automata to encode various parsing strategies and a dynamic programming interpretation to break au- tomata derivations into tabulable fragments.