Higher-Order Coloured Unification and Natural Language Semantics
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple, Shieber and Pereira, 1991)'s analysis called for.
Cite
@article{arxiv.cmp-lg/9605004,
title = {Higher-Order Coloured Unification and Natural Language Semantics},
author = {Claire Gardent and Michael Kohlhase},
journal= {arXiv preprint arXiv:cmp-lg/9605004},
year = {2008}
}
Comments
9 pages, LateX file, uses aclap.sty, To appear in Proceedings of ACL96