The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Parsing Head-driven Phrase Structure Grammar
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
The interface between phrasal and functional constraints
Computational Linguistics
JPSG parser on constraint logic programming
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Translating a unification grammar with disjunctions into logical constraints
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Constraint projection: an efficient treatment of disjunctive feature descriptions
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Syntactic constraints on relativization in Japanese
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Packing of feature structures for efficient unification of disjunctive feature structures
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Dependency propagation: a unified theory of sentence comprehension and generation
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
This paper presents what we call a conditional unification a new method of unification for processing natural languages. The key idea is to annotate the patterns with a certain sort of conditions, so that they carry abundant information. This method transmits information from one pattern to another more efficiently than procedure attachments, in which information contained in the procedure is embedded in the program rather than directly attached to patterns. Coupled with techniques in formal linguistics, moreover, conditioned unification serves most types of operations for natural language processing.