Higher-Order Coloured Unification and Natural Language Semantics
classification
cmp-lg
cs.CL
keywords
unificationcolouredgeneralhigher-orderprovidestheoryanalysisautomated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.