1343 search results - page 28 / 269 » Learning to Complete Sentences |
145
click to vote
ACL
2003
15 years 5 months ago
2003
An investment of effort over the last two years has begun to produce a wealth of data concerning computational psycholinguistic models of syntax acquisition. The data is generated...
138
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
132
click to vote
ACL
1996
15 years 5 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
134
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
106
click to vote
ICML
2000
IEEE
16 years 5 months ago
2000
IEEE
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...