Sciweavers

331 search results - page 21 / 67
» Using Redundant Constraints for Refinement
Sort
View
EMNLP
2010
13 years 5 months ago
Using Universal Linguistic Knowledge to Guide Grammar Induction
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
Tahira Naseem, Harr Chen, Regina Barzilay, Mark Jo...
AI
2006
Springer
13 years 7 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
JCS
2010
80views more  JCS 2010»
13 years 2 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
DKE
2008
104views more  DKE 2008»
13 years 7 months ago
Improving the performance of question answering with semantically equivalent answer patterns
In this paper, we discuss a novel technique based on semantic constraints to improve the performance and portability of a reformulation-based question answering system. First, we ...
Leila Kosseim, Jamileh Yousefi
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan