Sciweavers

2783 search results - page 89 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
TCS
2010
14 years 11 months ago
Error-repair parsing schemata
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
Carlos Gómez-Rodríguez, Miguel A. Al...
ACL
2012
13 years 3 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
CORR
2008
Springer
50views Education» more  CORR 2008»
15 years 1 months ago
When are two algorithms the same?
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of progra...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
EJC
2003
15 years 2 months ago
A Dialogue Manager for Accessing Databases
We present a logic programming based dialogue system that enables the access in natural language to the heterogeneous external relational databases of the Évora University. The p...
Salvador Abreu, Paulo Quaresma, Luis Quintano, Ire...
EACL
1993
ACL Anthology
15 years 2 months ago
The donkey strikes back: Extending the dynamic interpretation "constructively"
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
Tim Fernando