Higher-Order Colored Unification: A Linguistic Application

Abstract

. During the last decade, Higher-Order Unification (HOU) has become a popular tool for constructing the semantic representation of natural language expressions. But there is a well-known problem with this approach: it over-generates that is, it produces solutions which although they are mathematically valid, are linguistically incorrect because they do not represent possible meanings of the expression being analysed. In this paper, we argue that Higher-Order Colored Unification (HOCU) can help prevent over-generation and we describe the linguistic, logical and computational aspects of an HOCU--based approach to semantic construction. MOTS-CLS : Unification d'ordre suprieur, Structures de traits, Smantique de la langue naturelle KEY WORDS : Higher-Order Unification, Feature Trees, Natural Language Semantics 1. Introduction Higher-Order Unification (HOU) has become increasingly popular in computational linguistics as a tool for constructing the semantic representation of constructs Te...

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 44 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.