Sciweavers

16 search results - page 3 / 4
» Insertion Operator for Bayesian Tree Substitution Grammars
Sort
View
ACL
1990
13 years 11 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
COLING
2008
13 years 11 months ago
Sentence Compression Beyond Word Deletion
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...
Trevor Cohn, Mirella Lapata
COGSCI
2004
148views more  COGSCI 2004»
13 years 9 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
COLING
1999
13 years 9 months ago
Semiring Parsing
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
Joshua Goodman
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 4 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha