681 search results - page 75 / 137 » Combining Theorem Proving with Natural Language Processing |
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
One of the major problems one is faced with when decomposing words into their constituent parts is ambiguity: the generation of multiple analyses for one input word, many of which...
EACL
1993
ACL Anthology
15 years 1 months ago
1993
ACL Anthology
In this paper a morphological component with a limited capability to automatically interpret (and generate) derived words is presented. The system combines an extended two-level m...
EACL
1989
ACL Anthology
15 years 1 months ago
1989
ACL Anthology
To account for the semi-freeword order ofFrench, Unification Categorial Grammar is extended in two ways. First, verbal valencies are contained in a set rather than in a list. Seco...
CICLING
2009
Springer
15 years 29 days ago
2009
Springer
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...