中文
相关论文

相关论文: Vygotsky Distance: Measure for Benchmark Task Simi…

200 篇论文

Large-scale pre-trained language models have achieved tremendous success across a wide range of natural language understanding (NLU) tasks, even surpassing human performance. However, recent studies reveal that the robustness of these…

计算与语言 · 计算机科学 2022-01-11 Boxin Wang , Chejian Xu , Shuohang Wang , Zhe Gan , Yu Cheng , Jianfeng Gao , Ahmed Hassan Awadallah , Bo Li

Despite significant advancements, Large Language Models (LLMs) exhibit blind spots that impair their ability to retrieve and process relevant contextual data effectively. We demonstrate that LLM performance in graph tasks with complexities…

人工智能 · 计算机科学 2025-01-03 Hamed Firooz , Maziar Sanjabi , Wenlong Jiang , Xiaoling Zhai

A major computational burden, while performing document clustering, is the calculation of similarity measure between a pair of documents. Similarity measure is a function that assign a real number between 0 and 1 to a pair of documents,…

信息检索 · 计算机科学 2012-08-20 Muhammad Rafi , Sundus Hassan , Mohammad Shahid Shaikh

This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…

计算几何 · 计算机科学 2008-04-23 M. d'Amico , P. Frosini , C. Landi

Search behaviour is characterised using synonymy and polysemy as users often want to search information based on meaning. Semantic representation strategies represent a move towards richer associative connections that can adequately capture…

信息检索 · 计算机科学 2026-02-06 Niall McCarroll , Kevin Curran , Eugene McNamee , Angela Clist , Andrew Brammer

Rapid advancements in large language models (LLMs) have the potential to assist in scientific progress. A critical capability toward this endeavor is the ability to reproduce existing work. To evaluate the ability of AI agents to reproduce…

Similarities between entities occur frequently in many real-world scenarios. For over a century, researchers in different fields have proposed a range of approaches to measure the similarity between entities. More recently, inspired by…

人工智能 · 计算机科学 2023-03-21 Giovanni Amendola , Marco Manna , Aldo Ricioppo

Robotic path planning problems are often NP-hard, and practical solutions typically rely on approximation algorithms with provable performance guarantees for general cases. While designing such algorithms is challenging, formally proving…

机器人学 · 计算机科学 2026-03-23 Zhengbang Yang , Md. Tasin Tazwar , Minghan Wei , Zhuangdi Zhu

Similarity query is the family of queries based on some similarity metrics. Unlike the traditional database queries which are mostly based on value equality, similarity queries aim to find targets "similar enough to" the given data objects,…

数据库 · 计算机科学 2022-04-19 Yifan Wang

Citation based approaches have seen good progress for recommending research papers using citations in the paper. Citation proximity analysis which uses the in-text citation proximity to find relatedness between two research papers is better…

数字图书馆 · 计算机科学 2020-09-29 Rohit Rawat

Suggesting similar questions for a user query has many applications ranging from reducing search time of users on e-commerce websites, training of employees in companies to holistic learning for students. The use of Natural Language…

计算与语言 · 计算机科学 2022-04-27 Shriniwas Nayak , Anuj Kanetkar , Hrushabh Hirudkar , Archana Ghotkar , Sheetal Sonawane , Onkar Litake

We introduce a method for analyzing the complexity of natural language processing tasks, and for predicting the difficulty new NLP tasks. Our complexity measures are derived from the Kolmogorov complexity of a class of automata --- {\it…

cmp-lg · 计算机科学 2016-08-31 Wlodek Zadrozny

In the last five years, there has been a significant focus in Natural Language Processing (NLP) on developing larger Pretrained Language Models (PLMs) and introducing benchmarks such as SuperGLUE and SQuAD to measure their abilities in…

Laws and their interpretations, legal arguments and agreements\ are typically expressed in writing, leading to the production of vast corpora of legal text. Their analysis, which is at the center of legal practice, becomes increasingly…

Progress in NLP is increasingly measured through benchmarks; hence, contextualizing progress requires understanding when and why practitioners may disagree about the validity of benchmarks. We develop a taxonomy of disagreement, drawing on…

计算与语言 · 计算机科学 2023-05-22 Arjun Subramonian , Xingdi Yuan , Hal Daumé , Su Lin Blodgett

Educational materials such as survey articles in specialized fields like computer science traditionally require tremendous expert inputs and are therefore expensive to create and update. Recently, Large Language Models (LLMs) have achieved…

计算与语言 · 计算机科学 2024-05-24 Fan Gao , Hang Jiang , Rui Yang , Qingcheng Zeng , Jinghui Lu , Moritz Blum , Dairui Liu , Tianwei She , Yuang Jiang , Irene Li

The era of large language models (LLM) raises questions not only about how to train models, but also about how to evaluate them. Despite numerous existing benchmarks, insufficient attention is often given to creating assessments that test…

NLP research on aligning lexical representation spaces to one another has so far focused on aligning language spaces in their entirety. However, cognitive science has long focused on a local perspective, investigating whether translation…

计算与语言 · 计算机科学 2024-10-11 Taelin Karidi , Eitan Grossman , Omri Abend

Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is `database,' and the equivalent of `use' is `way to search the…

计算与语言 · 计算机科学 2007-06-13 Rudi Cilibrasi , Paul M. B. Vitanyi

Relations such as "is influenced by", "is known for" or "is a competitor of" are inherently graded: we can rank entity pairs based on how well they satisfy these relations, but it is hard to draw a line between those pairs that satisfy them…

计算与语言 · 计算机科学 2024-02-01 Asahi Ushio , Jose Camacho Collados , Steven Schockaert