Restrictions on Tree Adjoining Languages

  title={Restrictions on Tree Adjoining Languages},
  author={Giorgio Satta and 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 TAGs and TAG derivations are needed in order to lower this O(n 6) time complexity, without introducing large runtime constants, and without losing any of the generative power needed… CONTINUE READING