English
Related papers

Related papers: Isometric Words based on Swap and Mismatch Distanc…

200 papers

The use of language is subject to variation over time as well as across social groups and knowledge domains, leading to differences even in the monolingual scenario. Such variation in word usage is often called lexical semantic change…

Computation and Language · Computer Science 2021-02-02 Maurício Gruppi , Sibel Adalı , Pin-Yu Chen

The Word Mover's Distance (WMD) proposed by Kusner et al. is a distance between documents that takes advantage of semantic relations among words that are captured by their embeddings. This distance proved to be quite effective, obtaining…

Computation and Language · Computer Science 2020-05-12 Matheus Werner , Eduardo Laber

A similarity join aims to find all similar pairs between two collections of records. Established approaches usually deal with synthetic differences like typos and abbreviations, but neglect the semantic relations between words. Such…

Information Retrieval · Computer Science 2018-10-30 Pengfei Xu , Jiaheng Lu

Word embeddings represent language vocabularies as clouds of $d$-dimensional points. We investigate how information is conveyed by the general shape of these clouds, instead of representing the semantic meaning of each token. Specifically,…

Computation and Language · Computer Science 2025-01-15 Ondřej Draganov , Steven Skiena

In a way similar to the string-to-string correction problem we address time series similarity in the light of a time-series-to-time-series-correction problem for which the similarity between two time series is measured as the minimum cost…

Information Retrieval · Computer Science 2008-12-28 Pierre-François Marteau

An edge-operation on a graph $G$ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\mathcal{G}$, the editing distance from $G$ to $\mathcal{G}$ is the smallest number…

Combinatorics · Mathematics 2016-05-24 Maria Axenovich , André Kézdy , Ryan R. Martin

A subgraph $H$ of a graph $G$ is isometric if the distances between vertices in $H$ coincide with the distances between the corresponding vertices in $G$. We show that for any integer $n\ge 1$, there is a graph on $3^{n+O(\log^2 n)}$…

Combinatorics · Mathematics 2021-06-24 Louis Esperet , Cyril Gavoille , Carla Groenland

We prove that the normalized edit distance proposed in [Marzal and Vidal 1993] is a metric when the cost of all the edit operations are the same. This closes a long standing gap in the literature where several authors noted that this…

Formal Languages and Automata Theory · Computer Science 2022-04-26 Dana Fisman , Joshua Grogin , Oded Margalit , Gera Weiss

Measuring the semantic similarity between two sentences is still an important task. The word mover's distance (WMD) computes the similarity via the optimal alignment between the sets of word embeddings. However, WMD does not utilize word…

Computation and Language · Computer Science 2023-11-03 Hiroaki Yamagiwa , Sho Yokoi , Hidetoshi Shimodaira

Cross-lingual word embeddings aim to capture common linguistic regularities of different languages, which benefit various downstream tasks ranging from machine translation to transfer learning. Recently, it has been shown that these…

Computation and Language · Computer Science 2018-11-02 Pengcheng Yang , Fuli Luo , Shuangzhi Wu , Jingjing Xu , Dongdong Zhang , Xu Sun

Cross-lingual semantic textual similarity systems estimate the degree of the meaning similarity between two sentences, each in a different language. State-of-the-art algorithms usually employ machine translation and combine vast amount of…

Computation and Language · Computer Science 2018-07-12 Tomáš Brychcín

Existing algorithms for aligning cross-lingual word vector spaces assume that vector spaces are approximately isomorphic. As a result, they perform poorly or fail completely on non-isomorphic spaces. Such non-isomorphism has been…

Computation and Language · Computer Science 2020-10-21 Ivan Vulić , Sebastian Ruder , Anders Søgaard

The Word Mover's Distance (WMD) is a metric that measures the semantic dissimilarity between two text documents by computing the cost of moving all words of a source/query document to the most similar words of a target document optimally.…

Machine Learning · Computer Science 2021-03-24 Jesmin Jahan Tithi , Fabrizio Petrini

We engineer an algorithm to solve the approximate dictionary matching problem. Given a list of words $\mathcal{W}$, maximum distance $d$ fixed at preprocessing time and a query word $q$, we would like to retrieve all words from…

Information Retrieval · Computer Science 2010-08-19 Daniel Karch , Dennis Luxen , Peter Sanders

In this work we explore the dissimilarity between symmetric word pairs, by comparing the inter-word distance distribution of a word to that of its reversed complement. We propose a new measure of dissimilarity between such distributions.…

Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challenging-to-compute but very precise swap distance and the distance…

Computer Science and Game Theory · Computer Science 2022-05-03 Niclas Boehmer , Piotr Faliszewski , Rolf Niedermeier , Stanisław Szufa , Tomasz Wąs

Assessing the extent of human edits on texts generated by Large Language Models (LLMs) is crucial to understanding the human-AI interactions and improving the quality of automated text generation systems. Existing edit distance metrics,…

Computation and Language · Computer Science 2024-12-24 Nicolas Devatine , Louis Abraham

Semantics of a sentence is defined with much less ambiguity than semantics of a single word, and we assume that it should be better preserved by translation to another language. If multilingual sentence embeddings intend to represent…

Computation and Language · Computer Science 2024-06-28 Oleg Vasilyev , Fumika Isono , John Bohannon

Audio captioning quality metrics which are typically borrowed from the machine translation and image captioning areas measure the degree of overlap between predicted tokens and gold reference tokens. In this work, we consider a metric…

Multimedia · Computer Science 2023-03-06 Rehana Mahfuz , Yinyi Guo , Erik Visser

We introduce the cross-match test - an exact, distribution free, high-dimensional hypothesis test as an intrinsic evaluation metric for word embeddings. We show that cross-match is an effective means of measuring distributional similarity…

Computation and Language · Computer Science 2017-09-05 Nishant Gurnani