Metaphors and heuristic-driven theory projection (HDTP)
Autor(en): | Gust, H Kuhnberger, KU Schmid, U |
Stichwörter: | analogies; anti-unification; Computer Science; Computer Science, Theory & Methods; HDTP; metaphors | Erscheinungsdatum: | 2006 | Herausgeber: | ELSEVIER SCIENCE BV | Journal: | THEORETICAL COMPUTER SCIENCE | Volumen: | 354 | Ausgabe: | 1 | Startseite: | 98 | Seitenende: | 117 | Zusammenfassung: | A. classical approach of modeling metaphoric expressions uses a source concept network that is mapped to a target concept network. Both networks are often represented as algebras. In this paper, a representation using the mathematically sound framework of heuristic-driven theory projection (HDTP) is presented which is-although quite different from classical approaches-algebraic in nature, too. HDTP has the advantage that a structural description of source and target can be given and the connection between both domains are more clearly specified. The major aspects of the formal properties of HDTP, the specification of the underlying algorithm HDTP-A, and the development of a formal semantics for analogical reasoning will be discussed. We will apply HDTP to different types of metaphors. (c) 2005 Elsevier B.V. All rights reserved. |
Beschreibung: | 3rd International Workshop on Algebraic Methods in Language Processing, Univ Verona, Verona, ITALY, AUG 25-27, 2003 |
ISSN: | 03043975 | DOI: | 10.1016/j.tcs.2005.11.009 |
Zur Langanzeige
Seitenaufrufe
5
Letzte Woche
1
1
Letzter Monat
2
2
geprüft am 14.05.2024