Lemma | type coercion |
---|---|
Categoria grammaticale | N |
Lingua | inglese |
Sigla | Pustejovsky & Boguraev (2004) |
Titolo | LEXICAL KNOWLEDGE REPRESENTATION AND NATURAL LANGUAGE PROCESSING |
Sinonimi | |
Rinvii | |
Traduzioni | |
Citazioni | [...] "Type coercion". A semantic operation that converts an argument to the type which is expected by a function, where it would otherwise result in a type error. A set of generative devices connects the four levels, providing for the compositional interpretation of words in context. The most important of these devices is a semantic transformation called "type coercion" - analogous to coercion in programming languages - which captures the semantic relatedness between syntactically distinct expressions. |