Higher-Order Coloured Unification and Natural Language Semantics

Simple item page
dc.creatorGardent, Claire
dc.creatorKohlhase, Michael
dc.date1996-05-02
dc.date.accessioned2026-07-07T09:10:14Z
dc.date.available2026-07-07T09:10:14Z
dc.descriptionIn 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.
dc.description9 pages, LateX file, uses aclap.sty, To appear in Proceedings of ACL96
dc.identifierhttps://arxiv.org/abs/cmp-lg/9605004
dc.identifierhttp://arxiv.org/abs/cmp-lg/9605004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151295
dc.subjectComputation and Language
dc.titleHigher-Order Coloured Unification and Natural Language Semantics
dc.typetext

Files

Collections

arXiv