English

The Latent Relation Mapping Engine: Algorithm and Experiments

Computation and Language 2020-08-20 v1 Artificial Intelligence Machine Learning

Abstract

Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure Mapping Theory (SMT) and its implementation in the Structure Mapping Engine (SME). A limitation of SME is the requirement for complex hand-coded representations. We introduce the Latent Relation Mapping Engine (LRME), which combines ideas from SME and Latent Relational Analysis (LRA) in order to remove the requirement for hand-coded representations. LRME builds analogical mappings between lists of words, using a large corpus of raw text to automatically discover the semantic relations among the words. We evaluate LRME on a set of twenty analogical mapping problems, ten based on scientific analogies and ten based on common metaphors. LRME achieves human-level performance on the twenty problems. We compare LRME with a variety of alternative approaches and find that they are not able to reach the same level of performance.

Keywords

Cite

@article{arxiv.0812.4446,
  title  = {The Latent Relation Mapping Engine: Algorithm and Experiments},
  author = {Peter D. Turney},
  journal= {arXiv preprint arXiv:0812.4446},
  year   = {2020}
}

Comments

related work available at http://purl.org/peter.turney/

R2 v1 2026-06-21T11:55:25.326Z