Sciweavers

26 search results - page 2 / 6
» An Overview of Probabilistic Tree Transducers for Natural La...
Sort
View
ICGI
2004
Springer
13 years 10 months ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
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 ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
EACL
2006
ACL Anthology
13 years 6 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
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...
Stuart M. Shieber
EMNLP
2009
13 years 3 months ago
A Comparison of Model Free versus Model Intensive Approaches to Sentence Compression
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...
Tadashi Nomoto
TAL
2004
Springer
13 years 10 months ago
Expressive Power and Consistency Properties of State-of-the-Art Natural Language Parsers
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...
Gabriel G. Infante López, Maarten de Rijke