The competence of sub-optimal theories of structure mapping on hard analogies

Authors:
Tony Veale;Mark Keane
Affiliations:
School of Computer Applications, Dublin City University, Dublin, Ireland;Dept. of Computer Science, University of Dublin, Trinity College, Dublin, Ireland
Venue:
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Year:
1997

Citing 3
Cited 12

The structure-mapping engine: algorithm and examples

Artificial Intelligence
On the power of neural networks for solving hard problems

Journal of Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Systematicity and the lexicon in creative metaphor

LexFig '03 Proceedings of the ACL 2003 workshop on Lexicon and figurative language - Volume 14
Experiments with free concept generation in Divago

Knowledge-Based Systems
An analogy-oriented type hierarchy for linguistic creativity

Knowledge-Based Systems
Measuring the similarity between implicit semantic relations using web search engines

Proceedings of the Second ACM International Conference on Web Search and Data Mining
WWW sits the SAT: Measuring Relational Similarity on the Web

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Comprehending and generating apt metaphors: a web-driven, case-based approach to figurative language

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Analogy generation with HowNet

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Pragmatic forces in metaphor use: the mechanics of blend recruitment in visual metaphors

Computation for metaphors, analogy, and agents
Analogy as functional recategorization: abstraction with hownet semantics

IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
On the computational challenges of analogy-based generalization

Cognitive Systems Research
Improving relational similarity measurement using symmetries in proportional word analogies

Information Processing and Management: an International Journal
Easy Solutions for a Hard Problem? The Computational Complexity of Reciprocals with Quantificational Antecedents

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structure-mapping is a provably NP-Hard problem which is argued to lie at the core of the human metaphoric and analogical reasoning faculties. This NP-Hardness has meant that early attempts at optimal solutions to the problem have had to be augmented with sub-optimal heuristics to ensure tractable performance. This paper considers various grounds for qualifying the competence of such heuristic approaches, and offers an evaluation of the sub-optimal performance of three different models of analogy, SME, ACME and Sapper.