English
Related papers

Related papers: An Efficient Shared-memory Parallel Sinkhorn-Knopp…

200 papers

Understanding the meaning of words is crucial for many tasks that involve human-machine interaction. This has been tackled by research in Word Sense Disambiguation (WSD) in the Natural Language Processing (NLP) field. Recently, WSD and many…

Computation and Language · Computer Science 2020-02-26 María G. Buey , Carlos Bobed , Jorge Gracia , Eduardo Mena

Distributed word representation (a.k.a. word embedding) is a key focus in natural language processing (NLP). As a highly successful word embedding model, Word2Vec offers an efficient method for learning distributed word representations on…

Computation and Language · Computer Science 2024-07-30 Chaohao Yang , Chris Ding

The computation of the distance of two time series is time-consuming for any elastic distance function that accounts for misalignments. Among those functions, DTW is the most prominent. However, a recent extensive evaluation has shown that…

Data Structures and Algorithms · Computer Science 2023-04-21 Jana Holznigenkemper , Christian Komusiewicz , Bernhard Seeger

Cross-lingual or cross-domain correspondences play key roles in tasks ranging from machine translation to transfer learning. Recently, purely unsupervised methods operating on monolingual embeddings have become effective alignment tools.…

Computation and Language · Computer Science 2018-09-05 David Alvarez-Melis , Tommi S. Jaakkola

Optimal Transport (OT) distances are now routinely used as loss functions in ML tasks. Yet, computing OT distances between arbitrary (i.e. not necessarily discrete) probability distributions remains an open problem. This paper introduces a…

Optimization and Control · Mathematics 2020-07-03 Arthur Mensch , Gabriel Peyré

We present a novel online algorithm that learns the essence of each dimension in word embeddings by minimizing the within-group distance of contextualized embedding groups. Three state-of-the-art neural-based language models are used,…

Computation and Language · Computer Science 2020-05-26 Xinyi Jiang , Zhengzhe Yang , Jinho D. Choi

Word sense disambiguation (WSD) improves many Natural Language Processing (NLP) applications such as Information Retrieval, Machine Translation or Lexical Simplification. WSD is the ability of determining a word sense among different ones…

Computation and Language · Computer Science 2017-03-01 Mokhtar Billami , Núria Gala

Optimal Transport (OT) metrics allow for defining discrepancies between two probability measures. Wasserstein distance is for longer the celebrated OT-distance frequently-used in the literature, which seeks probability distributions to be…

Machine Learning · Computer Science 2021-10-14 Mokhtar Z. Alaya , Gilles Gasso , Maxime Berar , Alain Rakotomamonjy

The learning of domain-invariant representations in the context of domain adaptation with neural networks is considered. We propose a new regularization method that minimizes the discrepancy between domain-specific latent feature…

Using a vocabulary that is shared across languages is common practice in Multilingual Neural Machine Translation (MNMT). In addition to its simple design, shared tokens play an important role in positive knowledge transfer, assuming that…

Computation and Language · Computer Science 2024-01-23 Di Wu , Christof Monz

Representing, comparing, and measuring the distance between probability distributions is a key task in computational statistics and machine learning. The choice of representation and the associated distance determine properties of the…

Machine Learning · Statistics 2026-02-26 Masha Naslidnyk

The Earth Mover Distance (EMD) between two sets of points $A, B \subseteq \mathbb{R}^d$ with $|A| = |B|$ is the minimum total Euclidean distance of any perfect matching between $A$ and $B$. One of its generalizations is asymmetric EMD,…

Computational Complexity · Computer Science 2019-09-25 Dhruv Rohatgi

Document alignment is necessary for the hierarchical mining (Ba\~n\'on et al., 2020; Morishita et al., 2022), which aligns documents across source and target languages within the same web domain. Several high precision sentence…

Computation and Language · Computer Science 2025-10-20 Xiaotian Wang , Takehito Utsuro , Masaaki Nagata

The Dynamic Time Warping (DTW) distance is a popular measure of similarity for a variety of sequence data. For comparing polygonal curves $\pi, \sigma$ in $\mathbb{R}^d$, it provides a robust, outlier-insensitive alternative to the…

Computational Geometry · Computer Science 2022-03-17 Karl Bringmann , Sándor Kisfaludi-Bak , Marvin Künnemann , Dániel Marx , André Nusser

Given two point sets S and T, we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given…

Data Structures and Algorithms · Computer Science 2018-03-29 Fatemeh Rajabi-Alni , Alireza Bagheri

The dynamic time warping (DTW) is a widely-used method that allows us to efficiently compare two time series that can vary in speed. Given two strings $A$ and $B$ of respective lengths $m$ and $n$, there is a fundamental dynamic programming…

Data Structures and Algorithms · Computer Science 2020-07-30 Akihiro Nishi , Yuto Nakashima , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda

Quantifying the dissimilarity of two texts is an important aspect of a number of natural language processing tasks, including semantic information retrieval, topic classification, and document clustering. In this paper, we compared the…

Computation and Language · Computer Science 2023-05-05 Benjamin Shade , Eduardo G. Altmann

A simile is a figure of speech that compares two different things (called the tenor and the vehicle) via shared properties. The tenor and the vehicle are usually connected with comparator words such as "like" or "as". The simile phenomena…

Computation and Language · Computer Science 2024-10-21 Longxuan Ma , Weinan Zhang , Shuhan Zhou , Churui Sun , Changxin Ke , Ting Liu

Measuring the in-context computational effort of language models is a key challenge, as metrics like next-token loss fail to capture reasoning complexity. Prior methods based on latent state compressibility can be invasive and unstable. We…

Machine Learning · Computer Science 2025-12-30 Vincent Herrmann , Eric Alcaide , Michael Wand , Jürgen Schmidhuber

Dot plots are a standard method for local comparison of biological sequences. In a dot plot, a substring to substring distance is computed for all pairs of fixed-size windows in the input strings. Commonly, the Hamming distance is used…

Data Structures and Algorithms · Computer Science 2009-09-11 Peter Krusche , Alexander Tiskin