459 search results - page 12 / 92 » Computational Complexity of Probabilistic Disambiguation |
EMNLP
2010
14 years 9 months ago
2010
The computation of meaning similarity as operationalized by vector-based models has found widespread use in many tasks ranging from the acquisition of synonyms and paraphrases to ...
101
click to vote
MLG
2007
Springer
15 years 5 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
ACL
2012
13 years 2 months ago
2012
Interpreting news requires identifying its constituent events. Events are complex linguistically and ontologically, so disambiguating their reference is challenging. We introduce ...
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
101
click to vote
WILF
2005
Springer
15 years 5 months ago
2005
Springer
We have developed and continue to enhance automated intelligent software that performs the tasks and decision making which now occurs by the personnel manning watch stations in the...