681 search results - page 116 / 137 » Combining Theorem Proving with Natural Language Processing |
77
Voted
QSIC
2007
IEEE
15 years 3 months ago
2007
IEEE
The success of a software project is largely dependent upon the quality of the Software Requirements Specification (SRS) document, which serves as a medium to communicate user req...
63
Voted
LREC
2010
14 years 11 months ago
2010
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
LOGCOM
2007
14 years 9 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
67
Voted
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
Informal communication (e-mail, bulletin boards) poses a difficult learning environment because traditional grammatical and lexical information are noisy. Other information is nec...
81
Voted
NAACL
2003
14 years 11 months ago
2003
Motivated by the success of ensemble methods in machine learning and other areas of natural language processing, we developed a multistrategy and multi-source approach to question...