Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
This work introduces a model free approach to sentence compression, which grew out of ideas from Nomoto (2008), and examines how it compares to a state-of-art model intensive appr...
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...