COLING
2002
13 years 4 months ago
2002
Unification grammars are known to be Turingequivalent; given a grammar and a word
EACL
1989
ACL Anthology
13 years 6 months ago
1989
ACL Anthology
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...
IJCAI
1997
13 years 6 months ago
1997
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...
ACL
2006
13 years 6 months ago
2006
We introduce a new multi-threaded parsing algorithm on unification grammars designed specifically for multimodal interaction and noisy environments. By lifting some traditional co...
ACL
2006
13 years 6 months ago
2006
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...
ACL
2006
13 years 6 months ago
2006
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...