Tree Insertion Grammar (TIG) is a compromise between Context-Free Grammars (CFG) and Tree Adjoining Grammars (TAG), that combines the efficiency of the former with the strong lexicalizing power of hte latter. In this paper, we present a plain representation of TIG elementary trees that can be used directly as the input grammar for the original Earley parser without the additional considerations established in the Schabes and Waters Earley-based parser for TIG.
展开▼
