681 search results - page 97 / 137 » Combining Theorem Proving with Natural Language Processing |
102
click to vote
COCO
1994
Springer
15 years 1 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
IJCNLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Temporal question classification assigns time granularities to temporal questions ac-cording to their anticipated answers. It is very important for answer extraction and ...
CICLING
2003
Springer
15 years 2 months ago
2003
Springer
We present an automatic method to disambiguate the senses of the near-synonyms in the entries of a dictionary of synonyms. We combine different indicators that take advantage of th...
CICLING
2010
Springer
15 years 1 months ago
2010
Springer
Although the application of data fusion in information retrieval has yielded good results in the majority of the cases, it has been noticed that its achievement is dependent on the...
IR
2006
14 years 9 months ago
2006
The ability to find tables and extract information from them is a necessary component of many information retrieval tasks. Documents often contain tables in order to communicate d...