Metaphoric Generalization through Sort Coercion
نویسندگان
چکیده
This paper presents a method for interpreting metaphoric language in the context of a portable natural language interface. The method licenses metaphoric uses via coercions between incompatible ontological sorts. The machinery allows both previously-known and unexpected metaphoric uses to be correctly interpreted and evaluated with respect to the backend expert system.
منابع مشابه
Enhancing Metaphoric Competence through the Cognitive Approach
Studies in cognitive linguistics have highlighted the importance of metaphors for language teaching. Metaphoric competence, as an important aspect of intelligence, can contribute to the learning of languages. Most textbooks in ESL/EFL avoid the issue of figurative language and concentrate only on the denotative aspects of language. This article reports a study conducted at the Islamic Azad Univ...
متن کاملInfosphere: One Artefact, Two Metaphors, Three Sort Criteria
Because investigations about sites or artefacts require collecting and sorting out distributed and heterogeneous pieces of information, the handling of these pieces of information has, with the development of information technologies, opened a number of research issues. We focus here on the interfacing of collections through visual means. We introduce Infosphere, an experimental disposal aimed ...
متن کاملType shifting in construction grammar: An integrated approach to aspectual coercion*
Implicit type shifting, or coercion, appears to indicate a modular grammatical architecture, in which the process of semantic composition may add meanings absent from the syntax in order to ensure that certain operators, e.g., the progressive, receive suitable arguments (Jackendo¤ 1997; De Swart 1998). I will argue that coercion phenomena actually provide strong support for a sign-based model o...
متن کاملOn the Generalization of Interval Valued $left( in ,in vee q_{widetilde{k}}right) $-Fuzzy bi-Ideals in Ordered Semigroups
In this paper, we introduce a new sort of interval valued $left(in ,in vee q_{widetilde{k}}^{widetilde{delta }}right) $-fuzzy bi-ideal in ordered semigroups which is the generalization of interval valued $left( in ,in vee q_{%widetilde{k}}right) $-fuzzy bi-ideal and interval valued $left( in ,in vee qright) $-fuzzy bi-ideal of ordered semigroups. We give examples in which we show that these str...
متن کاملPolymorphic Dynamic Typing
We study dynamic typing in continuation of Henglein’s dynamically typed λ-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed λ-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from r...
متن کامل