“移动”一词的距离（WMD）是测量两个文档相似性的基本技术。作为WMD的关键，它可以通过采用最佳传输配方来利用空间单词的基础几何形状。关于WMD的最初研究报告说，WMD在各种数据集中的大幅度边缘优于古典基线，例如词袋（Bow）和TF-IDF。在本文中，我们指出原始研究中的评估可能会产生误导。我们重新评估了WMD和经典基准的性能，并发现如果我们采用适当的预处理（即L1归一化），经典的基线与WMD具有竞争力。此外，我们引入了WMD和L1拟态化的弓之间的类比，发现不仅WMD的性能，而且距离值都类似于高维空间的弓形值。

We present the Word Mover's Distance (WMD), a novel distance function between text documents. Our work is based on recent results in word embeddings that learn semantically meaningful representations for words from local cooccurrences in sentences. The WMD distance measures the dissimilarity between two text documents as the minimum amount of distance that the embedded words of one document need to "travel" to reach the embedded words of another document. We show that this distance metric can be cast as an instance of the Earth Mover's Distance, a well studied transportation problem for which several highly efficient solvers have been developed. Our metric has no hyperparameters and is straight-forward to implement. Further, we demonstrate on eight real world document classification data sets, in comparison with seven stateof-the-art baselines, that the WMD metric leads to unprecedented low k-nearest neighbor document classification error rates. 'Obama' word2vec embedding 'President' 'speaks' 'Illinois' 'media' 'greets' 'press' 'Chicago' document 2 document 1 Obama speaks to the media in Illinois The President greets the press in Chicago

我们研究了自然语言处理中出现的近似对相似矩阵的算法。通常，计算$ N $数据点的相似性矩阵需要$ \ omega（n ^ 2）$相似计算。这种二次缩放是一个重要的瓶颈，尤其是当通过昂贵的功能计算相似性时，例如，通过变压器模型计算。近似方法通过使用恰好计算的相似性的小子集来减少这种二次复杂性，以近似于完整成对相似性矩阵的其余部分。大量工作侧重于正半纤维（PSD）相似矩阵的有效近似，其在内核方法中。然而，关于无限期（非PSD）相似性矩阵的较少被理解得更少，这通常在NLP中产生。通过观察到，许多这些矩阵仍然有点接近PSD，我们将流行的NYSTR \“{o} M方法介绍到无限制地的概述。我们的算法可以应用于任何相似性矩阵并在Sublinear时间运行在矩阵的大小中，使用仅$ O（ns）$相似性计算产生秩的等级$近似。我们表明我们的方法以及CR Cur分解的简单变体，在近似各种相似度方面表现得非常好在NLP任务中产生的矩阵。我们在文档分类，句子相似度和跨文档COREREFED的下游任务中展示了近似相似性矩阵的高精度。

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 order, making it difficult to distinguish sentences with large overlaps of similar words, even if they are semantically very different. Here, we attempt to improve WMD by incorporating the sentence structure represented by BERT's self-attention matrix (SAM). The proposed method is based on the Fused Gromov-Wasserstein distance, which simultaneously considers the similarity of the word embedding and the SAM for calculating the optimal transport between two sentences. Experiments on paraphrase identification and semantic textual similarity show that the proposed method improves WMD and its variants. Our code is available at https://github.com/ymgw55/WSMD.

Natural Language Understanding has seen an increasing number of publications in the last few years, especially after robust word embeddings models became prominent, when they proved themselves able to capture and represent semantic relationships from massive amounts of data. Nevertheless, traditional models often fall short in intrinsic issues of linguistics, such as polysemy and homonymy. Any expert system that makes use of natural language in its core, can be affected by a weak semantic representation of text, resulting in inaccurate outcomes based on poor decisions. To mitigate such issues, we propose a novel approach called Most Suitable Sense Annotation (MSSA), that disambiguates and annotates each word by its specific sense, considering the semantic effects of its context. Our approach brings three main contributions to the semantic representation scenario: (i) an unsupervised technique that disambiguates and annotates words by their senses, (ii) a multi-sense embeddings model that can be extended to any traditional word embeddings algorithm, and (iii) a recurrent methodology that allows our models to be re-used and their representations refined. We test our approach on six different benchmarks for the word similarity task, showing that our approach can produce state-of-the-art results and outperforms several more complex state-of-the-art systems.

We propose BERTSCORE, an automatic evaluation metric for text generation. Analogously to common metrics, BERTSCORE computes a similarity score for each token in the candidate sentence with each token in the reference sentence. However, instead of exact matches, we compute token similarity using contextual embeddings. We evaluate using the outputs of 363 machine translation and image captioning systems. BERTSCORE correlates better with human judgments and provides stronger model selection performance than existing metrics. Finally, we use an adversarial paraphrase detection task to show that BERTSCORE is more robust to challenging examples when compared to existing metrics.

The relationship between words in a sentence often tells us more about the underlying semantic content of a document than its actual words, individually. In this work, we propose two novel algorithms, called Flexible Lexical Chain II and Fixed Lexical Chain II. These algorithms combine the semantic relations derived from lexical chains, prior knowledge from lexical databases, and the robustness of the distributional hypothesis in word embeddings as building blocks forming a single system. In short, our approach has three main contributions: (i) a set of techniques that fully integrate word embeddings and lexical chains; (ii) a more robust semantic representation that considers the latent relation between words in a document; and (iii) lightweight word embeddings models that can be extended to any natural language task. We intend to assess the knowledge of pre-trained models to evaluate their robustness in the document classification task. The proposed techniques are tested against seven word embeddings algorithms using five different machine learning classifiers over six scenarios in the document classification task. Our results show the integration between lexical chains and word embeddings representations sustain state-of-the-art results, even against more complex systems.

Generative AI has matured to a point where large-scale models can generate text that seems indistinguishable from human-written text and remarkably photorealistic images. Automatically measuring how close the distribution of generated data is to the target real data distribution is a key step in diagnosing existing models and developing better models. We present MAUVE, a family of comparison measures between pairs of distributions such as those encountered in the generative modeling of text or images. These scores are statistical summaries of divergence frontiers capturing two types of errors in generative modeling. We explore four approaches to statistically estimate these scores: vector quantization, non-parametric estimation, classifier-based estimation, and parametric Gaussian approximations. We provide statistical bounds for the vector quantization approach. Empirically, we find that the proposed scores paired with a range of $f$-divergences and statistical estimation methods can quantify the gaps between the distributions of human-written text and those of modern neural language models by correlating with human judgments and identifying known properties of the generated texts. We conclude the paper by demonstrating its applications to other AI domains and discussing practical recommendations.

Text classification is an important and classical problem in natural language processing. There have been a number of studies that applied convolutional neural networks (convolution on regular grid, e.g., sequence) to classification. However, only a limited number of studies have explored the more flexible graph convolutional neural networks (convolution on non-grid, e.g., arbitrary graph) for the task. In this work, we propose to use graph convolutional networks for text classification. We build a single text graph for a corpus based on word co-occurrence and document word relations, then learn a Text Graph Convolutional Network (Text GCN) for the corpus. Our Text GCN is initialized with one-hot representation for word and document, it then jointly learns the embeddings for both words and documents, as supervised by the known class labels for documents. Our experimental results on multiple benchmark datasets demonstrate that a vanilla Text GCN without any external word embeddings or knowledge outperforms state-of-the-art methods for text classification. On the other hand, Text GCN also learns predictive word and document embeddings. In addition, experimental results show that the improvement of Text GCN over state-of-the-art comparison methods become more prominent as we lower the percentage of training data, suggesting the robustness of Text GCN to less training data in text classification.

使用机器学习算法从未标记的文本中提取知识可能很复杂。文档分类和信息检索是两个应用程序，可以从无监督的学习（例如文本聚类和主题建模）中受益，包括探索性数据分析。但是，无监督的学习范式提出了可重复性问题。初始化可能会导致可变性，具体取决于机器学习算法。此外，关于群集几何形状，扭曲可能会产生误导。在原因中，异常值和异常的存在可能是决定因素。尽管初始化和异常问题与文本群集和主题建模相关，但作者并未找到对它们的深入分析。这项调查提供了这些亚地区的系统文献综述（2011-2022），并提出了共同的术语，因为类似的程序具有不同的术语。作者描述了研究机会，趋势和开放问题。附录总结了与审查的作品直接或间接相关的文本矢量化，分解和聚类算法的理论背景。

测量不同文本的语义相似性在数字人文研究中具有许多重要应用，例如信息检索，文档聚类和文本摘要。不同方法的性能取决于文本，域和语言的长度。本研究侧重于试验一些目前的芬兰方法，这是一种形态学丰富的语言。与此同时，我们提出了一种简单的方法TFW2V，它在处理长文本文档和有限的数据时显示出高效率。此外，我们设计了一种客观评估方法，可以用作基准标记文本相似性方法的框架。

本文通过添加解释性，可以显着提高对分类文件的监督嵌入的流行方法，即对比词媒体嵌入。通过将聚类促进机制结合到对比损失来实现这种可解释性。在几个公共数据集上，我们表明我们的方法在现有的基座上显着提高，同时通过识别一组关键字来解释群集，这些关键字是特定类的最具代表性的。我们的方法是有必要开发\ Texit的自然语言处理（NLP）方法{评估科学写作和思维的学生工作的新问题} - 这是一个（教育）学习科学领域的核心问题（LS）。在这种情况下，我们表明我们的方法会导致对来自生物阶层的实验室报告有意义的学生工作的有意义评估，并可以帮助LS研究人员进入学生理解和评估科学思想过程的证据。

瓦斯坦距离测量分布之间的差异，显示出各种类型的自然语言处理（NLP）和计算机视觉（CV）应用的功效。估计Wasserstein距离的挑战之一是，它在计算上很昂贵，并且对于许多分配比较任务而言，它的扩展不是很好。在本文中，我们的目标是通过树 - 瓦斯汀距离（TWD）近似1-wasserstein距离，其中TWD是带有基于树的嵌入的1-wasserstein距离，并且可以在线性时间内相对于节点的数量进行计算在树上。更具体地说，我们提出了一种简单而有效的L1调查方法来学习树中边缘的权重。为此，我们首先证明1-wasserstein近似问题可以使用树上的最短路径距离作为距离近似问题进行表述。然后，我们证明最短的路径距离可以用线性模型表示，并且可以作为基于LASSO的回归问题配方。由于凸公式，我们可以有效地获得全球最佳解决方案。此外，我们提出了这些方法的树形变体。通过实验，我们证明了加权TWD可以准确地近似原始的1-wasserstein距离。

专利数据是创新研究知识的重要来源。尽管专利对之间的技术相似性是用于专利分析的关键指标。最近，研究人员一直在使用基于不同NLP嵌入模型的专利矢量空间模型来计算专利对之间的技术相似性，以帮助更好地了解创新，专利景观，技术映射和专利质量评估。据我们所知，没有一项全面的调查来建立嵌入模型的性能以计算专利相似性指标的大图。因此，在这项研究中，我们根据专利分类性能概述了这些算法的准确性。在详细的讨论中，我们报告了部分，类和子类级别的前3个算法的性能。基于专利的第一个主张的结果表明，专利，贝特（Bert-For）和tf-idf加权单词嵌入具有最佳准确性，可以在亚类级别计算句子嵌入。根据第一个结果，不同类别中模型的性能各不相同，这表明专利分析中的研究人员可以利用本研究的结果根据他们使用的专利数据的特定部分选择最佳的适当模型。

State-of-the-art computer vision systems are trained to predict a fixed set of predetermined object categories. This restricted form of supervision limits their generality and usability since additional labeled data is needed to specify any other visual concept. Learning directly from raw text about images is a promising alternative which leverages a much broader source of supervision. We demonstrate that the simple pre-training task of predicting which caption goes with which image is an efficient and scalable way to learn SOTA image representations from scratch on a dataset of 400 million (image, text) pairs collected from the internet. After pre-training, natural language is used to reference learned visual concepts (or describe new ones) enabling zero-shot transfer of the model to downstream tasks. We study the performance of this approach by benchmarking on over 30 different existing computer vision datasets, spanning tasks such as OCR, action recognition in videos, geo-localization, and many types of fine-grained object classification. The model transfers non-trivially to most tasks and is often competitive with a fully supervised baseline without the need for any dataset specific training. For instance, we match the accuracy of the original ResNet-50 on ImageNet zero-shot without needing to use any of the 1.28 million training examples it was trained on. We release our code and pre-trained model weights at https://github.com/OpenAI/CLIP.

数据增强是通过转换为机器学习的人工创建数据的人工创建，是一个跨机器学习学科的研究领域。尽管它对于增加模型的概括功能很有用，但它还可以解决许多其他挑战和问题，从克服有限的培训数据到正规化目标到限制用于保护隐私的数据的数量。基于对数据扩展的目标和应用的精确描述以及现有作品的分类法，该调查涉及用于文本分类的数据增强方法，并旨在为研究人员和从业者提供简洁而全面的概述。我们将100多种方法划分为12种不同的分组，并提供最先进的参考文献来阐述哪种方法可以通过将它们相互关联，从而阐述了哪种方法。最后，提供可能构成未来工作的基础的研究观点。

Word Mover的距离（WMD）计算单词和模型之间的距离与两个文本序列中的单词之间的移动成本相似。但是，它在句子相似性评估中没有提供良好的性能，因为它不包含单词重要性，并且在句子中未能将固有的上下文和结构信息纳入句子。提出了一种使用语法解析树（称为语法感知单词Mover的距离（SYNWMD））的改进的WMD方法，以解决这项工作中的这两个缺点。首先，基于从句子树的句法解析树中提取的一词共发生统计量建立了加权图。每个单词的重要性是从图形连接性推断出的。其次，在计算单词之间的距离时，考虑了单词的局部句法解析结构。为了证明拟议的SynWMD的有效性，我们对6个文本语义相似性（STS）数据集和4个句子分类数据集进行了实验。实验结果表明，SynWMD在STS任务上实现了最先进的性能。它还在句子分类任务上胜过其他基于WMD的方法。

学术研究是解决以前从未解决过的问题的探索活动。通过这种性质，每个学术研究工作都需要进行文献审查，以区分其Novelties尚未通过事先作品解决。在自然语言处理中，该文献综述通常在“相关工作”部分下进行。鉴于研究文件的其余部分和引用的论文列表，自动相关工作生成的任务旨在自动生成“相关工作”部分。虽然这项任务是在10年前提出的，但直到最近，它被认为是作为科学多文件摘要问题的变种。然而，即使在今天，尚未标准化了自动相关工作和引用文本生成的问题。在这项调查中，我们进行了一个元研究，从问题制定，数据集收集，方法方法，绩效评估和未来前景的角度来比较相关工作的现有文献，以便为读者洞察到国家的进步 - 最内容的研究，以及如何进行未来的研究。我们还调查了我们建议未来工作要考虑整合的相关研究领域。

传统的计算机视觉模型受过培训，以预测固定的预定义类别。最近，自然语言已被证明是一个更广泛而更丰富的监督来源，为视觉概念提供更精细的描述，而不是监督“黄金”标签。以前的作品，例如剪辑，使用InfoNce丢失来训练模型以预测图像和文本标题之间的配对。然而，剪辑是饥饿的数据，需要超过400米的图像文本对进行培训。效率低下可以归因于图像文本对嘈杂的事实。为了解决这个问题，我们提出了水獭（有效的零射击识别的最佳运输蒸馏），它使用在线熵最佳运输，找到一个软图像文本与标签进行对比学习。基于预磨料的图像和文本编码器，用电站培训的型号实现了强大的性能，只有3M图像文本对。与InfoNce损失相比，标记平滑和知识蒸馏，OTTER始终如一地优于零拍摄图像（19,958类）和来自腾讯ML图像的多标记Imagenet 10k（10032类）的零拍摄评估中的这些基线。在4个不同的数据集/架构设置x 6度量上，OTTER优于（32）或绑定（2）34中的所有基准。

情感分析是最古典的，主要研究的自然语言处理任务之一。这个问题有一个值得注意的提前，主张更复杂和可扩展的机器学习模型。尽管存在这一进展，但巴西葡萄牙语仍然只处理了有限的语言资源，例如专用于情绪分类的数据集，特别是在考虑培训，测试和验证集中的预定义分区时，这将允许更公平地比较不同算法备择方案。这些问题的动机，这项工作分析了一系列文档嵌入策略的预测性能，假设极性作为系统结果。此分析包括在巴西葡萄牙语中的五种情感分析数据集，在单个数据集中统一，以及培训，测试和验证集中的引用分区，两者都通过数字存储库公开可用。进行不同上下文的数据集特定模型的交叉评估，以评估其泛化能力和采用唯一模型来解决所有方案的可行性。