Sciweavers

681 search results - page 75 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
EACL
1993
ACL Anthology
14 years 11 months ago
Disjunctions and Inheritance in the Context Feature Structure System
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]...
Martin Böttcher
EACL
1993
ACL Anthology
14 years 11 months ago
A Probabilistic Context-free Grammar for Disambiguation in Morphological Parsing
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...
Josée S. Heemskerk
EACL
1993
ACL Anthology
14 years 11 months ago
Coping With Derivation in a Morphological Component
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...
Harald Trost
EACL
1989
ACL Anthology
14 years 11 months ago
French Order Without Order
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...
Gabriel G. Bès, Claire Gardent
CICLING
2009
Springer
14 years 11 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
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...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...