681 search results - page 82 / 137 » Combining Theorem Proving with Natural Language Processing |
149
click to vote
CORR
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may ne...
181
click to vote
ADC
2006
Springer
15 years 12 months ago
2006
Springer
Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has be...
218
click to vote
ICSE
2007
IEEE-ACM
16 years 4 days ago
2007
IEEE-ACM
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
220
click to vote
ISWC
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, we present our e orts towards developing an intelligent tourist system. The system is equipped with a unique combination of sensors and software. The hardware inclu...
168
click to vote
CICLING
2006
Springer
15 years 9 months ago
2006
Springer
Several phrase chunkers have been proposed over the past few years. Some state-of-the-art chunkers achieved better performance via integrating external resources, e.g., parsers and...