Sciweavers

3185 search results - page 263 / 637
» Domain and language evaluation results
Sort
View
CP
2003
Springer
15 years 12 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
ILP
1998
Springer
15 years 11 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
APIN
2006
109views more  APIN 2006»
15 years 6 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel
ACL
2011
14 years 10 months ago
Combining Morpheme-based Machine Translation with Post-processing Morpheme Prediction
This paper extends the training and tuning regime for phrase-based statistical machine translation to obtain fluent translations into morphologically complex languages (we build ...
Ann Clifton, Anoop Sarkar
KBSE
2007
IEEE
16 years 1 months ago
Keyword programming in java
Keyword programming is a novel technique for reducing the need to remember details of programming language syntax and APIs, by translating a small number of keywords provided by t...
Greg Little, Robert C. Miller