1343 search results - page 13 / 269 » Learning to Complete Sentences |
150
click to vote
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
116
click to vote
WILF
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present a machine learning approach for classifying sentences as one-liner jokes or normal sentences. We use no deep analysis of the meaning to try to see if it is hum...
170
click to vote
PODS
2011
ACM
14 years 6 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
129
click to vote
LREC
2008
15 years 5 months ago
2008
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
ANLP
2000
15 years 5 months ago
2000
This paper demonstrates that machine learning is a suitable approach for rapid parser development. From 1000 newly treebanked Korean sentences we generate a deterministic shift-re...