35 search results - page 1 / 7 » Computational Complexity of Probabilistic Disambiguation by ... |
COLING
1996
13 years 5 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
GRAMMARS
2002
13 years 4 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
IS
2008
13 years 4 months ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
EMNLP
2010
13 years 2 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 ...
ACL
2010
13 years 2 months ago
2010
Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present a system that combines evidence from a monoling...