Sciweavers

2553 search results - page 275 / 511
» Modeling Trees with Hypertextures
Sort
View
CP
2006
Springer
15 years 10 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
15 years 10 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
ACL
2008
15 years 8 months ago
Cohesive Phrase-Based Decoding for Statistical Machine Translation
Phrase-based decoding produces state-of-theart translations with no regard for syntax. We add syntax to this process with a cohesion constraint based on a dependency tree for the ...
Colin Cherry
EMNLP
2008
15 years 8 months ago
Sparse Multi-Scale Grammars for Discriminative Latent Variable Parsing
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
Slav Petrov, Dan Klein
EMNLP
2004
15 years 8 months ago
Calibrating Features for Semantic Role Labeling
This paper takes a critical look at the features used in the semantic role tagging literature and show that the information in the input, generally a syntactic parse tree, has yet...
Nianwen Xue, Martha Palmer