A flexible graph-unification formalism and its application to natural-language processing
IBM Journal of Research and Development
Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Hi-index | 0.00 |
Feature Unification can be integrated with Lambek Theorem Proving in a simple and straightforward way. Two principles determine all distribution of features in LTP. It is not necessary to stipulate other principles or include category-valued features where other theories do. The structure of categories is discussed with respect to the notion of category structure of Gazdar et al. (1988).