Vicente Carrillo

Learn More
Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees that can be combined by means of the simpler kind of adjunction deened for Tree Insertion Grammar. In this(More)
Resumen El formalismo Tree Insertion Grammar (TIG) es un compro-miso entre Context Free Grammar (CFG) y Tree Adjoining Grammar (TAG) que puede ser analizada con un coste temporal de O(n 3). En la literatura podemos encontrar algunos anal-izadores para TIG derivados a partir de los existentes para CFG, como los populares CYK y Earley. En este trabajo(More)
Resumen Tree Insertion Grammar (TIG) es un compromiso entre Context Free Grammar (CFG) y Tree Adjoining Grammar (TAG) que puede ser analizada con un coste temporal de O(n 3). En la literatura, tan sólo han sido descritos dos algoritmos de análisis para TIGs, basados en los ya conocidos CYK y Earley para CFGs. En este informe se describen en detalle los(More)
We present a bottom-up bidirectional parser for Tree Adjoining Grammars that is an extension of the parser defined by De Vreught and Honig for Context Free Grammars. Although this parser does not improve the complexity of the parsers defined in the literature, it presents several characteristics that can be of interest for practical parsing of natural(More)