## Colexification Networks Encode Affective Meaning

2021
Di Natale, Anna
Pellert, Max
Journal article
Published
##### Published in
Affective Science ; 2 (2021), 2. - pp. 99-111. - Springer Nature. - ISSN 2662-2041. - eISSN 2662-205X
##### Abstract
Colexification is a linguistic phenomenon that occurs when multiple concepts are expressed in a language with the same word. Colexification patterns are frequently used to estimate the meaning similarity between words, but the hypothesis that these are related is still missing direct empirical validation at scale. Here, we show for the first time that words linked by colexification patterns capture similar affective meanings. Using pre-existing translation data, we extend colexification databases to cover much longer word lists. We achieve this with an unsupervised method of affective lexicon extension that uses colexification network data to interpolate the affective ratings of words that are not included in the original lexicon. We find positive correlations between network-based estimates and empirical affective ratings, which suggest that colexification networks contain information related to affective meanings. Finally, we compare our network method with state-of-the-art machine learning, trained on a large corpus, and show that our simple linguistics-informed unsupervised algorithm yields comparable performance with high explainability. These results show that it is possible to automatically expand affective norms lexica to cover exhaustive word lists when additional data are available, such as in colexification networks.
320 Politics
##### Keywords
Colexification, Semantics, Networks, Affective norms
##### Cite This
ISO 690DI NATALE, Anna, Max PELLERT, David GARCIA, 2021. Colexification Networks Encode Affective Meaning. In: Affective Science. Springer Nature. 2(2), pp. 99-111. ISSN 2662-2041. eISSN 2662-205X. Available under: doi: 10.1007/s42761-021-00033-1
BibTex
@article{DiNatale2021Colex-59773,
year={2021},
doi={10.1007/s42761-021-00033-1},
title={Colexification Networks Encode Affective Meaning},
number={2},
volume={2},
issn={2662-2041},
journal={Affective Science},
pages={99--111},
author={Di Natale, Anna and Pellert, Max and Garcia, David}
}

RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<dc:language>eng</dc:language>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/59773"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:creator>Di Natale, Anna</dc:creator>
<dcterms:issued>2021</dcterms:issued>
<dcterms:title>Colexification Networks Encode Affective Meaning</dcterms:title>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/42"/>
<dc:contributor>Garcia, David</dc:contributor>
<dcterms:abstract xml:lang="eng">Colexification is a linguistic phenomenon that occurs when multiple concepts are expressed in a language with the same word. Colexification patterns are frequently used to estimate the meaning similarity between words, but the hypothesis that these are related is still missing direct empirical validation at scale. Here, we show for the first time that words linked by colexification patterns capture similar affective meanings. Using pre-existing translation data, we extend colexification databases to cover much longer word lists. We achieve this with an unsupervised method of affective lexicon extension that uses colexification network data to interpolate the affective ratings of words that are not included in the original lexicon. We find positive correlations between network-based estimates and empirical affective ratings, which suggest that colexification networks contain information related to affective meanings. Finally, we compare our network method with state-of-the-art machine learning, trained on a large corpus, and show that our simple linguistics-informed unsupervised algorithm yields comparable performance with high explainability. These results show that it is possible to automatically expand affective norms lexica to cover exhaustive word lists when additional data are available, such as in colexification networks.</dcterms:abstract>
<dc:contributor>Pellert, Max</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-01-18T09:53:21Z</dcterms:available>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/59773/1/DiNatale_2-1ph0vu1q0rdwo1.pdf"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:contributor>Di Natale, Anna</dc:contributor>
<dc:creator>Garcia, David</dc:creator>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/42"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/59773/1/DiNatale_2-1ph0vu1q0rdwo1.pdf"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-01-18T09:53:21Z</dc:date>
<dc:creator>Pellert, Max</dc:creator>
</rdf:Description>
</rdf:RDF>

No
Unknown