1 paper · 1 filter
Giorgio Satta, William Schuler
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n^6) worst case running time. In this paper we investigate which restrictions on TA…