Sciweavers

105 search results - page 6 / 21
» Sentence completion
Sort
View
ACL
1996
15 years 1 months ago
Efficient Normal-Form Parsing for Combinatory Categorial Grammar
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...
Jason Eisner
106
Voted
ACL
2003
15 years 1 months ago
A Word-Order Database for Testing Computational Models of Language Acquisition
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...
William Gregory Sakas
97
Voted
CSL
2010
Springer
15 years 25 days ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
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...
Barnaby Martin, Jos Martin
ACL
2009
14 years 9 months ago
A Web-Based Interactive Computer Aided Translation Tool
We developed caitra, a novel tool that aids human translators by (a) making suggestions for sentence completion in an interactive machine translation setting, (b) providing altern...
Philipp Koehn
90
Voted
ACL
1998
15 years 1 months ago
How Verb Subcategorization Frequencies Are Affected By Corpus Choice
The probabilistic relation between verbs and their arguments plays an important role in modern statistical parsers and supertaggers, and in psychological theories of language proc...
Douglas Roland, Daniel Jurafsky