Vicente Carrillo

  • Citations Per Year
Learn More
Tabular parsers can be defined as deduction systems where formulas, called items, are sets of complete or incomplete constituents (Sikkel, 1997; Shieber, Schabes and Pereira, 1995). Formally, given an input string w = a1 . . . an with n ≥ 0 and a grammar G, a parser IP is a tuple (I,H,D) where I is a set of items, H is a set of hypothesis ([ai, i − 1, i](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 defined for Tree Insertion Grammar. In this(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)
In this paper we investigate Named Entity Recognition (NER) systems using two well-known classifiers in the machine learning literature: Markov Models and Decision Trees. We have designed several systems to check the impact of introducing different characteristics which have a weak dependence of the language used. We also report the results obtained by our(More)
Resumen El formalismo 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(n3). En la literatura podemos encontrar algunos analizadores para TIG derivados a partir de los existentes para CFG, como los populares CYK y Earley. En este trabajo extendemos(More)