681 search results - page 35 / 137 » Combining Theorem Proving with Natural Language Processing |
CICLING
2009
Springer
15 years 10 months ago
2009
Springer
We use existing tools to automatically build two parallel treebanks from existing parallel corpora. We then show that combining the data extracted from both the treebanks and the ...
ICCBR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper, we propose an approach to attach semantic annotations to textual cases for their representation. To achieve this goal, a framework that combines machine le...
115
click to vote
EACL
1993
ACL Anthology
14 years 11 months ago
1993
ACL Anthology
In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse t...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
FM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...