Sciweavers

COLING
2002
13 years 11 months ago
Guaranteeing Parsing Termination of Unification Grammars
Unification grammars are known to be Turingequivalent; given a grammar and a word
Efrat Jaeger, Nissim Francez, Shuly Wintner
EACL
1989
ACL Anthology
14 years 19 days ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
IJCAI
1997
14 years 24 days ago
Charts, Interaction-free Grammars, and the Compact Representation of Ambiguity
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
Marc Dymetman
ACL
2006
14 years 26 days ago
Clavius: Bi-Directional Parsing for Generic Multimodal Interaction
We introduce a new multi-threaded parsing algorithm on unification grammars designed specifically for multimodal interaction and noisy environments. By lifting some traditional co...
Frank Rudzicz
ACL
2006
14 years 26 days ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
ACL
2006
14 years 26 days ago
Partially Specified Signatures: A Vehicle for Grammar Modularity
This work provides the essential foundations for modular construction of (typed) unification grammars for natural languages. Much of the information in such grammars is encoded in...
Yael Cohen-Sygal, Shuly Wintner