Sciweavers

1388 search results - page 105 / 278
» Querying Linguistic Trees
Sort
View
IWPC
2003
IEEE
15 years 6 months ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...
77
Voted
COLING
1999
15 years 10 days 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
77
Voted
ACL
2010
14 years 10 months ago
Constituency to Dependency Translation with Forests
Tree-to-string systems (and their forestbased extensions) have gained steady popularity thanks to their simplicity and efficiency, but there is a major limitation: they are unable...
Haitao Mi, Qun Liu
NAACL
2010
14 years 10 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
105
Voted
NAACL
2010
14 years 10 months ago
Unsupervised Syntactic Alignment with Inversion Transduction Grammars
Syntactic machine translation systems currently use word alignments to infer syntactic correspondences between the source and target languages. Instead, we propose an unsupervised...
Adam Pauls, Dan Klein, David Chiang, Kevin Knight