Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Semantic similarity
open-in-new
<h2 id="terminology">Terminology</h2> <p>The concept of semantic similarity is more specific than semantic relatedness, as the latter includes concepts as <a href="/facts/Antonymy/1TruqPtl">antonymy</a> and <a href="/facts/Meronymy/Vgl30GYl">meronymy</a>, while similarity does not.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> However, much of the literature uses these terms interchangeably, along with terms like semantic distance. In essence, semantic similarity, semantic distance, and semantic relatedness all mean, "How much does term A have to do with term B?" The answer to this question is usually a number between −1 and 1, or between 0 and 1, where 1 signifies extremely high similarity. </p> <h2 id="visualization">Visualization</h2> <p>An intuitive way of visualizing the semantic similarity of terms is by grouping together terms which are closely related and spacing wider apart the ones which are distantly related. This is also common in practice for <a href="/facts/Mind_maps/4ytd9gIw">mind maps</a> and <a href="/facts/Concept_maps/f9Dt1LED">concept maps</a>. </p><p>A more direct way of visualizing the semantic similarity of two linguistic items can be seen with the <a href="/facts/Semantic_folding/wFkhUj91">Semantic Folding</a> approach. In this approach a linguistic item such as a term or a text can be represented by generating a <a href="/facts/Pixel/UzwBvXBV">pixel</a> for each of its active semantic features in e.g. a 128 x 128 grid. This allows for a direct visual comparison of the semantics of two items by comparing image representations of their respective feature sets. </p> <h2 id="applications">Applications</h2> <h3>In biomedical informatics</h3> <p>Semantic similarity measures have been applied and developed in biomedical ontologies.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> They are mainly used to compare <a href="/facts/Genes/e1swwPY6">genes</a> and <a href="/facts/Proteins/Jxmagu3E">proteins</a> based on the similarity of their functions<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> rather than on their <a href="/facts/Sequence_similarity/mCIVStrA">sequence similarity</a>, but they are also being extended to other bioentities, such as diseases.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> </p><p>These comparisons can be done using tools freely available on the web: </p> <ul><li>ProteInOn can be used to find interacting proteins, find assigned GO terms and calculate the functional semantic similarity of <a href="/facts/UniProt/lfDDHjAl">UniProt</a> proteins and to get the information content and calculate the functional semantic similarity of GO terms.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a></li> <li>CMPSim provides a functional similarity measure between chemical compounds and metabolic pathways using <a href="/facts/ChEBI/zQLG1mbE">ChEBI</a> based semantic similarity measures.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></li> <li>CESSM provides a tool for the automated evaluation of GO-based semantic similarity measures.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a></li></ul> <h3>In geoinformatics</h3> <p>Similarity is also applied in <a href="/facts/Geoinformatics/ebt81mmf">geoinformatics</a> to find similar <a href="/facts/Geographic_feature/MRbCqBmW">geographic features</a> or feature types:<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> </p> <ul><li>SIM-DL similarity server<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> can be used to compute similarities between concepts stored in geographic feature type ontologies.</li> <li>Similarity Calculator can be used to compute how well related two geographic concepts are in the Geo-Net-PT ontology.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a><a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a></li> <li>The OSM<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> <a href="/facts/Semantic_network/mt7FlP53">semantic network</a> can be used to compute the semantic similarity of tags in <a href="/facts/OpenStreetMap/Hd3yejum">OpenStreetMap</a>.<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a></li></ul> <h3>In computational linguistics</h3> <p>Several metrics use <a href="/facts/WordNet/TbrGVGAF">WordNet</a>, a manually constructed lexical database of English words. Despite the advantages of having human supervision in constructing the database, since the words are not automatically learned the database cannot measure relatedness between multi-word term, non-incremental vocabulary.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a><a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> </p> <h3>In natural language processing</h3> <p><a href="/facts/Natural_language_processing/1hjMKsSN">Natural language processing</a> (NLP) is a field of computer science and linguistics. Sentiment analysis, Natural language understanding and Machine translation (Automatically translate text from one human language to another) are a few of the major areas where it is being used. For example, knowing one information resource in the internet, it is often of immediate interest to find similar resources. The <a href="/facts/Semantic_Web/NFHo9dB7">Semantic Web</a> provides semantic extensions to find similar data by content and not just by arbitrary descriptors.<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a><a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a><a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a><a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a><a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a><a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a><a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a><a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a><a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a> <a href="/facts/Deep_learning/JLuwD3ea">Deep learning</a> methods have become an accurate way to gauge semantic similarity between two text passages, in which each passage is first embedded into a continuous vector representation.<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a><a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a><a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a> </p> <h3>In ontology matching</h3> <p>Semantic similarity plays a crucial role in <a href="/facts/Ontology_alignment/Szbtc6zR">ontology alignment</a>, which aims to establish correspondences between <a href="/facts/Ontology_components/EIRll6sn">entities</a> from different ontologies. It involves quantifying the degree of similarity between concepts or terms using the information present in the ontology for each entity, such as labels, descriptions, and hierarchical relations to other entities. Traditional metrics used in ontology matching are based on a lexical similarity between features of the entities, such as using the Levenshtein distance to measure the edit distance between entity labels.<a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a> However, it is difficult to capture the semantic similarity between entities using these metrics. For example, when comparing two ontologies describing conferences, the entities "Contribution" and "Paper" may have high semantic similarity since they share the same meaning. Nonetheless, due to their lexical differences, lexicographical similarity alone cannot establish this alignment. To capture these semantic similarities, <a href="/facts/Latent_space/IDYfRCU7">embeddings</a> are being adopted in ontology matching.<a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a> By encoding semantic relationships and contextual information, embeddings enable the calculation of similarity scores between entities based on the proximity of their vector representations in the embedding space. This approach allows for efficient and accurate matching of ontologies since embeddings can model semantic differences in entity naming, such as homonymy, by assigning different embeddings to the same word based on different contexts.<a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a> </p> <h2 id="measures">Measures</h2> <h3>Topological similarity</h3> <p>There are essentially two types of approaches that calculate topological similarity between ontological concepts: </p> <ul><li>Edge-based: which use the edges and their types as the data source;</li> <li>Node-based: in which the main data sources are the nodes and their properties.</li></ul> <p>Other measures calculate the similarity between ontological instances: </p> <ul><li>Pairwise: measure functional similarity between two instances by combining the semantic similarities of the concepts they represent</li> <li>Groupwise: calculate the similarity directly not combining the semantic similarities of the concepts they represent</li></ul> <p>Some examples: </p> <h4>Edge-based</h4> <ul><li>Pekar et al.<a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a></li> <li>Cheng and Cline<a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a></li> <li>Wu et al.<a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a></li> <li>Del Pozo et al.<a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a></li> <li>IntelliGO: Benabderrahmane et al.<a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a></li></ul> <h4>Node-based</h4> <ul><li>Resnik<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a> <ul><li>based on the notion of <a href="/facts/Information_content/EkUdL669">information content</a>. The information content of a concept (term or word) is the logarithm of the probability of finding the concept in a given corpus.</li> <li>only considers the information content of <a href="/facts/Lowest_common_ancestor/lUuLKAGk">lowest common subsumer</a> (lcs). A lowest common subsumer is a concept in a lexical taxonomy ( e.g. WordNet), which has the shortest distance from the two concepts compared. For example, animal and mammal both are the subsumers of cat and dog, but mammal is lower subsumer than animal for them.</li></ul></li> <li>Lin<a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a> <ul><li>based on Resnik's similarity.</li> <li>considers the information content of lowest common subsumer (lcs) and the two compared concepts.</li></ul></li> <li>Maguitman, <a href="/facts/Filippo_Menczer/p3oQme5T">Menczer</a>, Roinestad and <a href="/facts/Alessandro_Vespignani/RlePIAYm">Vespignani</a><a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a> <ul><li>Generalizes Lin's similarity to arbitrary ontologies (graphs).</li></ul></li> <li>Jiang and Conrath<a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a> <ul><li>based on Resnik's similarity.</li> <li>considers the information content of lowest common subsumer (lcs) and the two compared concepts to calculate the distance between the two concepts. The distance is later used in computing the similarity measure.</li></ul></li> <li><a href="http://lcl.uniroma1.it/adw/">Align, Disambiguate, and Walk</a>: Random walks on Semantic Networks<a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a></li></ul> <h4>Node-and-relation-content-based</h4> <ul><li>applicable to ontology</li> <li>consider properties (content) of nodes</li> <li>consider types (content) of relations</li> <li>based on eTVSM<a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a></li> <li>based on Resnik's similarity<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a></li></ul> <h4>Pairwise</h4> <ul><li>maximum of the pairwise similarities</li> <li>composite average in which only the best-matching pairs are considered (best-match average)</li></ul> <h4>Groupwise</h4> <ul><li><a href="/facts/Jaccard_index/dUurmTet">Jaccard index</a></li></ul> <h3>Statistical similarity</h3> <p>Statistical similarity approaches can be learned from data, or predefined. <a href="/facts/Similarity_learning/peRWFSl4">Similarity learning</a> can often outperform predefined similarity measures. Broadly speaking, these approaches build a statistical model of documents, and use it to estimate similarity. </p> <ul><li>LSA (<a href="/facts/Latent_semantic_analysis/IugrMyMl">latent semantic analysis</a>):<a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a><a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a> (+) vector-based, adds vectors to measure multi-word terms; (−) non-incremental vocabulary, long pre-processing times</li> <li>PMI (<a href="/facts/Pointwise_mutual_information/puakcNKF">pointwise mutual information</a>): (+) large vocab, because it uses any search engine (like Google); (−) cannot measure relatedness between whole sentences or documents</li> <li>SOC-PMI (<a href="/facts/Second-order_co-occurrence_pointwise_mutual_information/SGEAk72z">second-order co-occurrence pointwise mutual information</a>): (+) sort lists of important neighbor words from a large corpus; (−) cannot measure relatedness between whole sentences or documents</li> <li>GLSA (generalized latent semantic analysis): (+) vector-based, adds vectors to measure multi-word terms; (−) non-incremental vocabulary, long pre-processing times</li> <li>ICAN (incremental construction of an associative network): (+) incremental, network-based measure, good for spreading activation, accounts for second-order relatedness; (−) cannot measure relatedness between multi-word terms, long pre-processing times</li> <li>NGD (<a href="/facts/Normalized_Google_distance/wnwyBQBL">normalized Google distance</a>): (+) large vocab, because it uses any search engine (like Google); (−) can measure relatedness between whole sentences or documents but the larger the sentence or document, the more ingenuity is required (Cilibrasi & Vitanyi, 2007).<a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a></li> <li>TSS (Twitter semantic similarity):<a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a> large vocab, because it use online tweets from Twitter to compute the similarity. It has high temporary resolution that allows to capture high frequency events. Open source</li> <li>NCD (<a href="/facts/Normalized_compression_distance/qGrQTvRe">normalized compression distance</a>)</li> <li>ESA (<a href="/facts/Explicit_semantic_analysis/UGQztsMB">explicit semantic analysis</a>) based on <a href="/facts/Wikipedia/KDRNKWnc">Wikipedia</a> and the <a href="/facts/Open_Directory_Project/3DjX9Cbw">ODP</a></li> <li>SSA (salient semantic analysis)<a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a> which indexes terms using salient concepts found in their immediate context.</li> <li>n° of Wikipedia (noW),<a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a> inspired by the game Six Degrees of Wikipedia,<a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a> is a distance metric based on the hierarchical structure of Wikipedia. A directed-acyclic graph is first constructed and later, <a href="/facts/Dijkstra%27s_algorithm/ehun88jl">Dijkstra's shortest path algorithm</a> is employed to determine the noW value between two terms as the geodesic distance between the corresponding topics (i.e. nodes) in the graph.</li> <li>VGEM (vector generation of an explicitly-defined multidimensional semantic space):<a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a> (+) incremental vocab, can compare multi-word terms (−) performance depends on choosing specific dimensions</li> <li><a href="/facts/SimRank/b0hL3aEg">SimRank</a></li> <li>NASARI:<a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a> Sparse vector representations constructed by applying the hypergeometric distribution over the Wikipedia corpus in combination with BabelNet taxonomy. Cross-lingual similarity is currently also possible thanks to the multilingual and unified extension.<a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a></li></ul> <h3>Semantics-based similarity</h3> <ul><li>Marker passing: Combining lexical decomposition for automated ontology creation and marker passing, the approach of Fähndrich et al. introduces a new type of semantic similarity measure.<a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a> Here markers are passed from the two target concepts carrying an amount of activation. This activation might increase or decrease depending on the relations weight with which the concepts are connected. This combines edge and node based approaches and includes connectionist reasoning with symbolic information.</li> <li>Good common subsumer (GCS)-based semantic similarity measure<a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a></li></ul> <h3>Semantics similarity networks</h3> <ul><li>A <a href="/facts/Semantic_similarity_network/A6c9uA4I">semantic similarity network</a> (SSN) is a special form of <a href="/facts/Semantic_network/mt7FlP53">semantic network</a>. designed to represent concepts and their semantic similarity. Its main contribution is reducing the complexity of calculating semantic distances. Bendeck (2004, 2008) introduced the concept of <i>semantic similarity networks</i> (SSN) as the specialization of a semantic network to measure semantic similarity from ontological representations.<a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a> Implementations include genetic information handling.</li></ul> <h3>Gold standards</h3> <p>Researchers have collected datasets with similarity judgements on pairs of words, which are used to evaluate the cognitive plausibility of computational measures. The golden standard up to today is an old 65 word list where humans have judged the word similarity.<a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a><a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a> </p> <ul><li>RG65<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a></li> <li>MC30<a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a></li> <li>WordSim353<a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a></li></ul> <h2 id="see-also">See also</h2> <ul> <li>Linguistics portal</li></ul> <ul><li><a href="/facts/Analogy/LYcGaTdm">Analogy</a></li> <li><a href="/facts/Componential_analysis/dXaLg3h4">Componential analysis</a></li> <li><a href="/facts/Coherence_(linguistics)/UC2e3L6u">Coherence (linguistics)</a></li> <li><a href="/facts/Levenshtein_distance/F0otyNSl">Levenshtein distance</a></li> <li><a href="/facts/Semantic_differential/j3mXQ1ah">Semantic differential</a></li> <li><a href="/facts/Semantic_similarity_network/A6c9uA4I">Semantic similarity network</a></li> <li><a href="/facts/Terminology_extraction/TRjKaWct">Terminology extraction</a></li> <li><a href="/facts/Word2vec/DAuubBYX">Word2vec</a></li> <li><a href="/facts/Tf-idf/JDzc5Jnr">tf-idf</a> – Estimate of the importance of a word in a documentPages displaying short descriptions of redirect targets</li></ul> <h2 id="sources">Sources</h2> <ul><li>Chicco, D; Masseroli, M (2015). <a href="https://doi.org/10.1109/TCBB.2014.2382127">"Software suite for gene and protein annotation prediction and similarity search"</a>. <i>IEEE/ACM Transactions on Computational Biology and Bioinformatics</i>. 12 (4): 837–843. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTCBB.2014.2382127">10.1109/TCBB.2014.2382127</a>. <a href="/facts/Hdl_(identifier)/rdebSxmC">hdl</a>:<a href="https://hdl.handle.net/11311%2F959408">11311/959408</a>. <a href="/facts/PMID_(identifier)/JlHAvMHt">PMID</a> <a href="https://pubmed.ncbi.nlm.nih.gov/26357324">26357324</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:14714823">14714823</a>.</li> <li>Cilibrasi, R.L. & Vitanyi, P.M.B. (2007). "The Google Similarity Distance". <i>IEEE Trans. Knowledge and Data Engineering</i>. 19 (3): 370–383. <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/cs/0412098">cs/0412098</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FTKDE.2007.48">10.1109/TKDE.2007.48</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:59777">59777</a>.</li> <li>Dumais, S (2003). <a href="https://doi.org/10.1207%2Fs15516709cog2703_7">"Data-driven approaches to information access"</a>. <i>Cognitive Science</i>. 27 (3): 491–524. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1207%2Fs15516709cog2703_7">10.1207/s15516709cog2703_7</a>.</li> <li>Gabrilovich, E. and Markovitch, S. (2007). <a href="https://www.cs.technion.ac.il/~gabr/papers/ijcai-2007-sim.pdf">Computing Semantic Relatedness using Wikipedia-based Explicit Semantic Analysis</a>, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), Hyderabad, India, January 2007.</li> <li>Lee, M. D., Pincombe, B., & Welsh, M. (2005). <a href="https://cloudfront.escholarship.org/dist/prd/content/qt48g155nq/qt48g155nq.pdf">An empirical evaluation of models of text document similarity</a>. In B. G. Bara & L. Barsalou & M. Bucciarelli (Eds.), 27th Annual Meeting of the Cognitive Science Society, CogSci2005 (pp. 1254–1259). Austin, Tx: The Cognitive Science Society, Inc.</li> <li>Lemaire, B., & Denhiére, G. (2004). <a href="http://cogprints.org/3779/01/cogsci04_2.pdf">Incremental construction of an associative network from a corpus</a>. In K. D. Forbus & D. Gentner & T. Regier (Eds.), 26th Annual Meeting of the Cognitive Science Society, CogSci2004. Hillsdale, NJ: Lawrence Erlbaum Publisher.</li> <li>Lindsey, R.; Veksler, V.D.; Grintsvayg, A.; Gray, W.D. (2007). <a href="http://sitemaker.umich.edu/iccm2007.org/files/lindsey__veksler__grintsvayg____gray.pdf">"The Effects of Corpus Selection on Measuring Semantic Relatedness"</a> (PDF). <i>Proceedings of the 8th International Conference on Cognitive Modeling, Ann Arbor, MI</i>.</li> <li>Navigli, R., Lapata, M. (2010). <a href="http://www.dsi.uniroma1.it/~navigli/pubs/PAMI_2010_Navigli_Lapata.pdf">"An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation"</a>. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 32(4), IEEE Press, 2010, pp. 678–692.</li> <li>Veksler, V.D. & Gray, W.D. (2006). <a href="http://csjarchive.cogsci.rpi.edu/Proceedings/2006/docs/p2624.pdf">"Test Case Selection for Evaluating Measures of Semantic Distance"</a> (PDF). <i>Proceedings of the 28th Annual Meeting of the Cognitive Science Society, CogSci2006</i>.</li> <li>Wong, W., Liu, W. & Bennamoun, M. (2008) Featureless Data Clustering. In: M. Song and Y. Wu; Handbook of Research on Text and Web Mining Technologies; IGI Global. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-59904-990-8 (the use of NGD and noW for term and URI clustering)</li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="http://www.similarity-blog.de/?page_id=3">List of related literature</a></li></ul> <h3>Survey articles</h3> <ul><li><i>Conference article</i>: C. d'Amato, S. Staab, N. Fanizzi. 2008. <a href="https://dl.acm.org/citation.cfm?id=1434078">On the Influence of Description Logics Ontologies on Conceptual Similarity</a>. In Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns Pages 48 – 63. Acitrezza, Italy, Springer-Verlag</li> <li><i>Journal article</i> on the more general topic of relatedness, also including similarity: Z. Zhang, A. Gentile, F. Ciravegna. 2013. <a href="https://www.cambridge.org/core/journals/natural-language-engineering/article/recent-advances-in-methods-of-lexical-semantic-relatedness-a-survey/35BA94697B86B4B797FCF3ACCDE24FBD">Recent advances in methods of lexical semantic relatedness – a survey</a>. Natural Language Engineering 19 (4), 411–479, Cambridge University Press</li> <li><i>Book</i>: S. Harispe, S. Ranwez, S. Janaqi, J. Montmain. 2015. <a href="http://www.morganclaypool.com/doi/10.2200/S00639ED1V01Y201504HLT027">Semantic Similarity from Natural Language and Ontology Analysis</a>, Morgan & Claypool Publishers.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Harispe S.; Ranwez S.; Janaqi S.; Montmain J. (2015). "Semantic Similarity from Natural Language and Ontology Analysis". Synthesis Lectures on Human Language Technologies. 8 (1): 1–254. arXiv:1704.05295. doi:10.2200/S00639ED1V01Y201504HLT027. S2CID 17428739. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Feng Y.; Bagheri E.; Ensan F.; Jovanovic J. (2017). "The state of the art in semantic relatedness: a framework for comparison". Knowledge Engineering Review. 32: 1–30. doi:10.1017/S0269888917000029. S2CID 52172371. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>A. Ballatore; M. Bertolotto; D.C. Wilson (2014). "An evaluative baseline for geo-semantic relatedness and similarity". GeoInformatica. 18 (4): 747–767. arXiv:1402.3371. Bibcode:2014GInfo..18..747B. doi:10.1007/s10707-013-0197-8. S2CID 17474023. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Budanitsky, Alexander; Hirst, Graeme (2001). "Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures" (PDF). Workshop on WordNet and Other Lexical Resources, Second Meeting of the North American Chapter of the Association for Computational Linguistics. Pittsburgh. <a href="https://ftp.cs.toronto.edu/pub/gh/Budanitsky+Hirst-2001.pdf" target="_blank">https://ftp.cs.toronto.edu/pub/gh/Budanitsky+Hirst-2001.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Guzzi, Pietro Hiram; Mina, Marco; Cannataro, Mario; Guerra, Concettina (2012). "Semantic similarity analysis of protein data: assessment with biological features and issues". Briefings in Bioinformatics. 13 (5): 569–585. doi:10.1093/bib/bbr066. PMID 22138322. <a href="https://doi.org/10.1093%2Fbib%2Fbbr066" target="_blank">https://doi.org/10.1093%2Fbib%2Fbbr066</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Benabderrahmane, Sidahmed; Smail Tabbone, Malika; Poch, Olivier; Napoli, Amedeo; Devignes, Marie-Domonique. (2010). "IntelliGO: a new vector-based semantic similarity measure including annotation origin". BMC Bioinformatics. 11: 588. doi:10.1186/1471-2105-11-588. PMC 3098105. PMID 21122125. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3098105" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3098105</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Chicco, D; Masseroli, M (2015). "Software suite for gene and protein annotation prediction and similarity search". IEEE/ACM Transactions on Computational Biology and Bioinformatics. 12 (4): 837–843. doi:10.1109/TCBB.2014.2382127. hdl:11311/959408. PMID 26357324. S2CID 14714823. <a href="https://doi.org/10.1109/TCBB.2014.2382127" target="_blank">https://doi.org/10.1109/TCBB.2014.2382127</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Köhler, S; Schulz, MH; Krawitz, P; Bauer, S; Dolken, S; Ott, CE; Mundlos, C; Horn, D; et al. (2009). "Clinical diagnostics in human genetics with semantic similarity searches in ontologies". American Journal of Human Genetics. 85 (4): 457–64. doi:10.1016/j.ajhg.2009.09.003. PMC 2756558. PMID 19800049. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2756558" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2756558</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"ProteInOn". <a href="http://xldb.fc.ul.pt/biotools/proteinon/" target="_blank">http://xldb.fc.ul.pt/biotools/proteinon/</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"CMPSim". <a href="http://xldb.di.fc.ul.pt/biotools/cmpsim/" target="_blank">http://xldb.di.fc.ul.pt/biotools/cmpsim/</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"CESSM". <a href="http://xldb.fc.ul.pt/biotools/cessm/" target="_blank">http://xldb.fc.ul.pt/biotools/cessm/</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Janowicz, K.; Raubal, M.; Kuhn, W. (2011). "The semantics of similarity in geographic information retrieval". Journal of Spatial Information Science. 2 (2): 29–57. doi:10.5311/josis.2011.2.3. hdl:20.500.11850/41298. <a href="https://doi.org/10.5311%2Fjosis.2011.2.3" target="_blank">https://doi.org/10.5311%2Fjosis.2011.2.3</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Algorithm, implementation and application of the SIM-DL similarity server. Second International Conference on Geospatial Semantics (GEOS 2007). Lecture Notes in Computer Science. 2007. pp. 128–145. CiteSeerX 10.1.1.172.5544. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>"Geo-Net-PT Similarity Calculator". <a href="http://xldb.fc.ul.pt/wiki/Geographic_Similarity_calculator_GeoSSM" target="_blank">http://xldb.fc.ul.pt/wiki/Geographic_Similarity_calculator_GeoSSM</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>"Geo-Net-PT". <a href="http://xldb.fc.ul.pt/wiki/Geo-Net-PT_02_in_English" target="_blank">http://xldb.fc.ul.pt/wiki/Geo-Net-PT_02_in_English</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>"OSM Semantic Network". OSM Wiki. <a href="https://wiki.openstreetmap.org/wiki/OSM_Semantic_Network" target="_blank">https://wiki.openstreetmap.org/wiki/OSM_Semantic_Network</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>A. Ballatore; D.C. Wilson; M. Bertolotto. "Geographic Knowledge Extraction and Semantic Similarity in OpenStreetMap" (PDF). Knowledge and Information Systems: 61–81. <a href="http://irserver.ucd.ie/bitstream/handle/10197/3973/2012_-_Geographic_Knowledge_Extraction_and_Semantic_Similarity_in_OpenStreetMap_-_Ballatore_et_al.pdf?sequence=1" target="_blank">http://irserver.ucd.ie/bitstream/handle/10197/3973/2012_-_Geographic_Knowledge_Extraction_and_Semantic_Similarity_in_OpenStreetMap_-_Ballatore_et_al.pdf?sequence=1</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>Budanitsky, Alexander; Hirst, Graeme (2001). "Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures" (PDF). Workshop on WordNet and Other Lexical Resources, Second Meeting of the North American Chapter of the Association for Computational Linguistics. Pittsburgh. <a href="https://ftp.cs.toronto.edu/pub/gh/Budanitsky+Hirst-2001.pdf" target="_blank">https://ftp.cs.toronto.edu/pub/gh/Budanitsky+Hirst-2001.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Kaur, I. & Hornof, A.J. (2005). "A comparison of LSA, wordNet and PMI-IR for predicting user click behavior". Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. pp. 51–60. doi:10.1145/1054972.1054980. ISBN 978-1-58113-998-3. S2CID 14347026. <a href="978-1-58113-998-3" target="_blank">978-1-58113-998-3</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Similarity-based Learning Methods for the Semantic Web (C. d'Amato, PhD Thesis) <a href="http://www.di.uniba.it/~cdamato/PhDThesis_dAmato.pdf" target="_blank">http://www.di.uniba.it/~cdamato/PhDThesis_dAmato.pdf</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Gracia, J. & Mena, E. (2008). "Web-Based Measure of Semantic Relatedness" (PDF). Proceedings of the 9th International Conference on Web Information Systems Engineering (WISE '08): 136–150. <a href="http://disi.unitn.it/~p2p/RelatedWork/Matching/Gracia_wise08.pdf" target="_blank">http://disi.unitn.it/~p2p/RelatedWork/Matching/Gracia_wise08.pdf</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Raveendranathan, P. (2005). Identifying Sets of Related Words from the World Wide Web. Master of Science Thesis, University of Minnesota Duluth. <a href="http://www.d.umn.edu/~tpederse/Pubs/prath-thesis.pdf" target="_blank">http://www.d.umn.edu/~tpederse/Pubs/prath-thesis.pdf</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Wubben, S. (2008). Using free link structure to calculate semantic relatedness. In ILK Research Group Technical Report Series, nr. 08-01, 2008. <a href="http://ilk.uvt.nl/~swubben/publications/wubben2008-techrep.pdf" target="_blank">http://ilk.uvt.nl/~swubben/publications/wubben2008-techrep.pdf</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Juvina, I., van Oostendorp, H., Karbor, P., & Pauw, B. (2005). Towards modeling contextual information in web navigation. In B. G. Bara & L. Barsalou & M. Bucciarelli (Eds.), 27th Annual Meeting of the Cognitive Science Society, CogSci2005 (pp. 1078–1083). Austin, Tx: The Cognitive Science Society, Inc. <a href="https://cloudfront.escholarship.org/dist/prd/content/qt0p7528tp/qt0p7528tp.pdf" target="_blank">https://cloudfront.escholarship.org/dist/prd/content/qt0p7528tp/qt0p7528tp.pdf</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Navigli, R., Lapata, M. (2007). Graph Connectivity Measures for Unsupervised Word Sense Disambiguation, Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad, India, January 6–12th, 2007, pp. 1683–1688. <a href="http://www.aaai.org/Papers/IJCAI/2007/IJCAI07-272.pdf" target="_blank">http://www.aaai.org/Papers/IJCAI/2007/IJCAI07-272.pdf</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>Pirolli, P. (2005). "Rational analyses of information foraging on the Web". Cognitive Science. 29 (3): 343–373. doi:10.1207/s15516709cog0000_20. PMID 21702778. <a href="https://doi.org/10.1207%2Fs15516709cog0000_20" target="_blank">https://doi.org/10.1207%2Fs15516709cog0000_20</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>Pirolli, P. & Fu, W.-T. (2003). "SNIF-ACT: A model of information foraging on the World Wide Web". Lecture Notes in Computer Science. Vol. 2702. pp. 45–54. CiteSeerX 10.1.1.6.1506. doi:10.1007/3-540-44963-9_8. ISBN 978-3-540-40381-4. <a href="978-3-540-40381-4" target="_blank">978-3-540-40381-4</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Turney, P. (2001). Mining the Web for Synonyms: PMI versus LSA on TOEFL. In L. De Raedt & P. Flach (Eds.), Proceedings of the Twelfth European Conference on Machine Learning (ECML-2001) (pp. 491–502). Freiburg, Germany. <a href="https://arxiv.org/abs/cs/0212033" target="_blank">https://arxiv.org/abs/cs/0212033</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Reimers, Nils; Gurevych, Iryna (November 2019). "Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks". Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Hong Kong, China: Association for Computational Linguistics. pp. 3982–3992. arXiv:1908.10084. doi:10.18653/v1/D19-1410. <a href="https://www.aclweb.org/anthology/D19-1410" target="_blank">https://www.aclweb.org/anthology/D19-1410</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Mueller, Jonas; Thyagarajan, Aditya (2016-03-05). "Siamese Recurrent Architectures for Learning Sentence Similarity". Thirtieth AAAI Conference on Artificial Intelligence. 30. doi:10.1609/aaai.v30i1.10350. S2CID 16657628. <a href="https://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12195" target="_blank">https://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12195</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Kiros, Ryan; Zhu, Yukun; Salakhutdinov, Russ R; Zemel, Richard; Urtasun, Raquel; Torralba, Antonio; Fidler, Sanja (2015), Cortes, C.; Lawrence, N. D.; Lee, D. D.; Sugiyama, M. (eds.), "Skip-Thought Vectors" (PDF), Advances in Neural Information Processing Systems 28, Curran Associates, Inc., pp. 3294–3302, retrieved 2020-03-13 <a href="http://papers.nips.cc/paper/5950-skip-thought-vectors.pdf" target="_blank">http://papers.nips.cc/paper/5950-skip-thought-vectors.pdf</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>Cheatham, Michelle; Hitzler, Pascal (2013). "String Similarity Metrics for Ontology Alignment". In Alani, Harith; Kagal, Lalana; Fokoue, Achille; Groth, Paul; Biemann, Chris; Parreira, Josiane Xavier; Aroyo, Lora; Noy, Natasha; Welty, Chris (eds.). Advanced Information Systems Engineering. The Semantic Web – ISWC 2013. Lecture Notes in Computer Science. Vol. 7908. Berlin, Heidelberg: Springer. pp. 294–309. doi:10.1007/978-3-642-41338-4_19. ISBN 978-3-642-41338-4. S2CID 18372966. <a href="978-3-642-41338-4" target="_blank">978-3-642-41338-4</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>Sousa, G., Lima, R., & Trojahn, C. (2022). An eye on representation learning in ontology matching. OM@ISWC. <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>Sousa, G., Lima, R., & Trojahn, C. (2022). An eye on representation learning in ontology matching. OM@ISWC. <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>Pekar, Viktor; Staab, Steffen (2002). Taxonomy learning. Proceedings of the 19th international conference on Computational linguistics –. Vol. 1. pp. 1–7. doi:10.3115/1072228.1072318. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>Cheng, J; Cline, M; Martin, J; Finkelstein, D; Awad, T; Kulp, D; Siani-Rose, MA (2004). "A knowledge-based clustering algorithm driven by Gene Ontology". Journal of Biopharmaceutical Statistics. 14 (3): 687–700. doi:10.1081/BIP-200025659. PMID 15468759. S2CID 25224811. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>Wu, H; Su, Z; Mao, F; Olman, V; Xu, Y (2005). "Prediction of functional modules based on comparative genome analysis and Gene Ontology application". Nucleic Acids Research. 33 (9): 2822–37. doi:10.1093/nar/gki573. PMC 1130488. PMID 15901854. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1130488" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1130488</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>Del Pozo, Angela; Pazos, Florencio; Valencia, Alfonso (2008). "Defining functional distances over Gene Ontology". BMC Bioinformatics. 9: 50. doi:10.1186/1471-2105-9-50. PMC 2375122. PMID 18221506. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2375122" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2375122</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>Benabderrahmane, Sidahmed; Smail Tabbone, Malika; Poch, Olivier; Napoli, Amedeo; Devignes, Marie-Domonique. (2010). "IntelliGO: a new vector-based semantic similarity measure including annotation origin". BMC Bioinformatics. 11: 588. doi:10.1186/1471-2105-11-588. PMC 3098105. PMID 21122125. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3098105" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3098105</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>Philip Resnik (1995). Chris S. Mellish (ed.). "Using information content to evaluate semantic similarity in a taxonomy". Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95). 1: 448–453. arXiv:cmp-lg/9511007. Bibcode:1995cmp.lg...11007R. CiteSeerX 10.1.1.41.6956. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>Dekang Lin. 1998. An Information-Theoretic Definition of Similarity. In Proceedings of the Fifteenth International Conference on Machine Learning (ICML '98), Jude W. Shavlik (Ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 296–304 <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.55.1832&rep=rep1&type=pdf" target="_blank">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.55.1832&rep=rep1&type=pdf</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>Ana Gabriela Maguitman, Filippo Menczer, Heather Roinestad, Alessandro Vespignani: Algorithmic detection of semantic similarity. WWW 2005: 107–116 <a href="http://wwwconference.org/proceedings/www2005/docs/p107.pdf" target="_blank">http://wwwconference.org/proceedings/www2005/docs/p107.pdf</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>J. J. Jiang and D. W. Conrath. Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy. In International Conference on Research on Computational Linguistics (ROCLING X), pages 9008+, September 1997 <a href="https://arxiv.org/abs/cmp-lg/9709008" target="_blank">https://arxiv.org/abs/cmp-lg/9709008</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>M. T. Pilehvar, D. Jurgens and R. Navigli. Align, Disambiguate and Walk: A Unified Approach for Measuring Semantic Similarity.. Proc. of the 51st Annual Meeting of the Association for Computational Linguistics (ACL 2013), Sofia, Bulgaria, August 4–9, 2013, pp. 1341–1351. <a href="http://wwwusers.di.uniroma1.it/~navigli/pubs/ACL_2013_Pilehvar_Jurgens_Navigli.pdf" target="_blank">http://wwwusers.di.uniroma1.it/~navigli/pubs/ACL_2013_Pilehvar_Jurgens_Navigli.pdf</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>Dong, Hai (2009). "A Hybrid Concept Similarity Measure Model for Ontology Environment". On the Move to Meaningful Internet Systems: OTM 2009 Workshops. Lecture Notes in Computer Science. Vol. 5872. pp. 848–857. Bibcode:2009LNCS.5872..848D. doi:10.1007/978-3-642-05290-3_103. ISBN 978-3-642-05289-7. <a href="978-3-642-05289-7" target="_blank">978-3-642-05289-7</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>Dong, Hai (2011). "A context-aware semantic similarity model for ontology environments". Concurrency and Computation: Practice and Experience. 23 (2): 505–524. doi:10.1002/cpe.1652. S2CID 412845. <a href="https://www.researchgate.net/publication/220105255" target="_blank">https://www.researchgate.net/publication/220105255</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>Landauer, T. K.; Dumais, S. T. (1997). "A solution to Plato's problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge" (PDF). Psychological Review. 104 (2): 211–240. CiteSeerX 10.1.1.184.4759. doi:10.1037/0033-295x.104.2.211. S2CID 1144461. <a href="http://www.stat.cmu.edu/%7Ecshalizi/350/2008/readings/Landauer-Dumais.pdf" target="_blank">http://www.stat.cmu.edu/%7Ecshalizi/350/2008/readings/Landauer-Dumais.pdf</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>Landauer, T. K.; Foltz, P. W. & Laham, D. (1998). "Introduction to Latent Semantic Analysis" (PDF). Discourse Processes. 25 (2–3): 259–284. CiteSeerX 10.1.1.125.109. doi:10.1080/01638539809545028. S2CID 16625196. <a href="http://lsa.colorado.edu/papers/dp1.LSAintro.pdf" target="_blank">http://lsa.colorado.edu/papers/dp1.LSAintro.pdf</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>"Google Similarity Distance". <a href="http://iknowate.blogspot.com/2011/10/google-similarity-distance.html" target="_blank">http://iknowate.blogspot.com/2011/10/google-similarity-distance.html</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>Carrillo, F.; Cecchi, G. A.; Sigman, M.; Slezak, D. F. (2015). "Fast Distributed Dynamics of Semantic Networks via Social Media" (PDF). Computational Intelligence and Neuroscience. 2015: 712835. doi:10.1155/2015/712835. PMC 4449913. PMID 26074953. <a href="http://downloads.hindawi.com/journals/cin/2015/712835.pdf" target="_blank">http://downloads.hindawi.com/journals/cin/2015/712835.pdf</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>"Samer Hassan" (PDF).[dead link] <a href="http://www.samerhassan.com/images/4/48/Hassan.pdf" target="_blank">http://www.samerhassan.com/images/4/48/Hassan.pdf</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>Wilson Wong; Wei Liu; Mohammed Bennamoun (November 2006). Featureless similarities for terms clustering using tree-traversing ants. PCAR '06: Proceedings of the 2006 international symposium on Practical cognitive agents and robots. pp. 177–191. doi:10.1145/1232425.1232448. <a href="http://doi.acm.org/10.1145/1232425.1232448" target="_blank">http://doi.acm.org/10.1145/1232425.1232448</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>"6 Degrees of Wikipedia". The Chronicle of Higher Education. The Wired Campus. May 28, 2008. Archived from the original on May 30, 2008. <a href="https://web.archive.org/web/20080530043310/http://chronicle.com/wiredcampus/article/3041/six-degrees-of-wikipedia" target="_blank">https://web.archive.org/web/20080530043310/http://chronicle.com/wiredcampus/article/3041/six-degrees-of-wikipedia</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>V. D. Veksler; Ryan Z. Govostes (2008). "Defining the Dimensions of the Human Semantic Space" (PDF). <a href="https://raw.githubusercontent.com/lyoshenka/papers/master/pp718-veksler.pdf" target="_blank">https://raw.githubusercontent.com/lyoshenka/papers/master/pp718-veksler.pdf</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>J. Camacho-Collados; M. T. Pilehvar; R. Navigli (2015). NASARI: a Novel Approach to a Semantically-Aware Representation of Items (PDF). Proceedings of the North American Chapter of the Association of Computational Linguistics (NAACL 2015). Denver, US. pp. 567–577. <a href="http://aclweb.org/anthology/N/N15/N15-1059.pdf" target="_blank">http://aclweb.org/anthology/N/N15/N15-1059.pdf</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>J. Camacho-Collados; M. T. Pilehvar; R. Navigli (July 27–29, 2015). A Unified Multilingual Semantic Representation of Concepts (PDF). Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics (ACL 2015). Beijing, China. pp. 741–751. <a href="http://aclweb.org/anthology/P/P15/P15-1072.pdf" target="_blank">http://aclweb.org/anthology/P/P15/P15-1072.pdf</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>Fähndrich J.; Weber S.; Ahrndt S. (2016). "Design and Use of a Semantic Similarity Measure for Interoperability Among Agents". In Klusch M.; Unland R.; Shehory O.; Pokahr A.; Ahrndt S. (eds.). Multiagent System Technologies. MATES 2016. Lecture Notes in Computer Science. Vol. 9872. Springer. Available at author version <a href="http://www.fähndrich.de" target="_blank">http://www.fähndrich.de</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>C. d'Amato; S. Staab; N. Fanizzi (2008). "On the influence of description logics ontologies on conceptual similarity". Knowledge Engineering: Practice and Patterns. pp. 48–63. doi:10.1007/978-3-540-87696-0_7. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>Bendeck, F. (2008). WSM-P Workflow Semantic Matching Platform, PhD dissertation, University of Trier, Germany. Verlag Dr. Hut. ASIN 3899638549. <a href="/wiki/Amazon_Standard_Identification_Number" target="_blank">/wiki/Amazon_Standard_Identification_Number</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>Rubenstein, Herbert, and John B. Goodenough. Contextual correlates of synonymy. Communications of the ACM, 8(10):627–633, 1965. <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.893.7406&rep=rep1&type=pdf" target="_blank">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.893.7406&rep=rep1&type=pdf</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>For a list of datasets, and an overview of the state of the art see https://www.aclweb.org/. <a href="https://www.aclweb.org/aclwiki/index.php?title=Similarity_(State_of_the_art)" target="_blank">https://www.aclweb.org/aclwiki/index.php?title=Similarity_(State_of_the_art)</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>Rubenstein, Herbert; Goodenough, John B. (1965-10-01). "Contextual correlates of synonymy". Communications of the ACM. 8 (10): 627–633. doi:10.1145/365628.365657. S2CID 18309234. <a href="https://doi.org/10.1145%2F365628.365657" target="_blank">https://doi.org/10.1145%2F365628.365657</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>Miller, George A.; Charles, Walter G. (1991-01-01). "Contextual correlates of semantic similarity". Language and Cognitive Processes. 6 (1): 1–28. doi:10.1080/01690969108406936. ISSN 0169-0965. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>"Placing search in context". ACM Transactions on Information Systems. 20: 116–131. 2002-01-01. CiteSeerX 10.1.1.29.1912. doi:10.1145/503104.503110. S2CID 12956853. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> </ol>