Pith. Sign in

RECORD

Representation Learning of Image Schema

Human-Computer Interaction · Submitted 17 Jul 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim With the image schemas representable as vectors, it also becomes possible to have a notion that some image schemas are closer or more similar to each other than to the others because the distance between the vectors is a proxy of the dissimilarity between the corresponding image schemas.

how it is stated · hedged possibility 0.60 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2207.08256 (version 1)
Pith IDI2HGCW2R, Pith's permanent record of this paper and its review
CitationCatherine Pelachaud, Chlo\'e Clavel, Fajrian Yunus. "Representation Learning of Image Schema." arXiv:2207.08256 (2022). https://pith.science/paper/I2HGCW2R
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,451 input tokens.

What the abstract itself states, as probabilities: claims first 0.97 · states limitation 0.11 · human participants 0.08 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.09 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Image schema is a recurrent pattern of reasoning where one entity is mapped into another. Image schema is similar to conceptual metaphor and is also related to metaphoric gesture. Our main goal is to generate metaphoric gestures for an Embodied Conversational Agent. We propose a technique to learn the vector representation of image schemas. As far as we are aware of, this is the first work which addresses that problem. Our technique uses Ravenet et al's algorithm which we use to compute the image schemas from the text input and also BERT and SenseBERT which we use as the base word embedding technique to calculate the final vector representation of the image schema. Our representation learning technique works by clustering: word embedding vectors which belong to the same image schema should be relatively closer to each other, and thus form a cluster. With the image schemas representable as vectors, it also becomes possible to have a notion that some image schemas are closer or more similar to each other than to the others because the distance between the vectors is a proxy of the dissimilarity between the corresponding image schemas. Therefore, after obtaining the vector representation of the image schemas, we calculate the distances between those vectors. Based on these, we create visualizations to illustrate the relative distances between the different image schemas.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Image schema is a recurrent pattern of reasoning where one entity is mapped into another. background 1.00 0.05 0.03 asserted 1.00
s1 Image schema is similar to conceptual metaphor and is also related to metaphoric gesture. background 1.00 0.07 0.02 asserted 1.00
s2 Our main goal is to generate metaphoric gestures for an Embodied Conversational Agent. contribution 0.75 0.39 0.05 asserted 0.97
s3 We propose a technique to learn the vector representation of image schemas. contribution 0.97 0.85 0.08 asserted 0.99
s4 As far as we are aware of, this is the first work which addresses that problem. gap 0.81 0.32 0.04 asserted 0.95
s5 Our technique uses Ravenet et al's algorithm which we use to compute the image schemas from the text input and also BERT and SenseBERT which we use as the base word embedding technique to calculate the final vector representation of the image schema. method 1.00 0.70 0.03 asserted 1.00
s6 Our representation learning technique works by clustering: word embedding vectors which belong to the same image schema should be relatively closer to each other, and thus form a cluster. method 1.00 0.56 0.08 asserted 0.97
s7 With the image schemas representable as vectors, it also becomes possible to have a notion that some image schemas are closer or more similar to each other than to the others because the distance between the vectors is a proxy of the dissimilarity between the corresponding image schemas. interpretation 0.82 0.40 0.13 hedged possibility 0.60
s8 Therefore, after obtaining the vector representation of the image schemas, we calculate the distances between those vectors. method 0.98 0.94 0.04 asserted 1.00
s9 Based on these, we create visualizations to illustrate the relative distances between the different image schemas. method 0.52 0.94 0.09 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.87.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Image schema is a recurrent pattern of reasoning where one entity is mapped into another. Image schema is similar to conceptual metaphor and is also related to metaphoric gesture. Our main goal is to generate metaphoric gestures for an Embodied Conversational Agent. We propose a technique to learn the vector representation of image schemas. As far as we are aware of, this is the first work which addresses that problem. Our technique uses Ravenet et al's algorithm which we use to compute the image schemas from the text input and also BERT and SenseBERT which we use as the base word embedding technique to calculate the final vector representation of the image schema. Our representation learning technique works by clustering: word embedding vectors which belong to the same image schema should be relatively closer to each other, and thus form a cluster. With the image schemas representable as vectors, it also becomes possible to have a notion that some image schemas are closer or more similar to each other than to the others because the distance between the vectors is a proxy of the dissimilarity between the corresponding image schemas. Therefore, after obtaining the vector representation of the image schemas, we calculate the distances between those vectors. Based on these, we create visualizations to illustrate the relative distances between the different image schemas.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 2 sentences without a confident label

Uses the method or tool of 1 paper
  • We also display the UMAP visualizations [ref] of three cases, namely EMPTY image schema in BERT and euclidean distance (Figure [ref]), RIGHT image schema in SenseBERT and cosine dissimilarity (Figure [ref]), and NEAR image schema in SenseBERT and euclidean distance (Figure [ref]).

    UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction · Experiment · 1.00

Cites as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.