English
Related papers

Related papers: Learning to Rank Utterances for Query-Focused Meet…

200 papers

Neural network-based methods for abstractive summarization produce outputs that are more fluent than other techniques, but which can be poor at content selection. This work proposes a simple technique for addressing this issue: use a…

Computation and Language · Computer Science 2018-10-10 Sebastian Gehrmann , Yuntian Deng , Alexander M. Rush

Large language models (LLMs) have recently shown strong potential for ranking by capturing semantic relevance and adapting across diverse domains, yet existing methods remain constrained by limited context length and high computational…

Information Retrieval · Computer Science 2026-05-28 Tao Feng , Zijie Lei , Zhigang Hua , Yan Xie , Shuang Yang , Ge Liu , Jiaxuan You

Large Language Models (LLMs) have demonstrated superior listwise ranking performance. However, their superior performance often relies on large-scale parameters (\eg, GPT-4) and a repetitive sliding window process, which introduces…

Computation and Language · Computer Science 2025-09-03 Wenhan Liu , Xinyu Ma , Yutao Zhu , Lixin Su , Shuaiqiang Wang , Dawei Yin , Zhicheng Dou

Join query evaluation with ordering is a fundamental data processing task in relational database management systems. SQL and custom graph query languages such as Cypher offer this functionality by allowing users to specify the order via the…

Databases · Computer Science 2022-01-25 Shaleen Deep , Xiao Hu , Paraschos Koutris

As an alternative to question answering methods based on feature engineering, deep learning approaches such as convolutional neural networks (CNNs) and Long Short-Term Memory Models (LSTMs) have recently been proposed for semantic matching…

Information Retrieval · Computer Science 2019-06-04 Liu Yang , Qingyao Ai , Jiafeng Guo , W. Bruce Croft

This paper contains what the Georgetown InfoSense group has done in regard to solving the challenges presented by TREC iKAT 2023. Our submitted runs outperform the median runs by a significant margin, exhibiting superior performance in nDCG…

Computation and Language · Computer Science 2023-11-17 Quinn Patwardhan , Grace Hui Yang

Despite the success of distributional semantics, composing phrases from word vectors remains an important challenge. Several methods have been tried for benchmark tasks such as sentiment classification, including word vector averaging,…

Computation and Language · Computer Science 2015-12-14 Pranjal Singh , Amitabha Mukerjee

Generating high-quality stories spanning thousands of tokens requires competency across a variety of skills, from tracking plot and character arcs to keeping a consistent and engaging style. Due to the difficulty of sourcing labeled…

Computation and Language · Computer Science 2025-09-09 Alexander Gurung , Mirella Lapata

Non-Factoid (NF) Question Answering (QA) is challenging to evaluate due to diverse potential answers and no objective criterion. The commonly used automatic evaluation metrics like ROUGE or BERTScore cannot accurately measure semantic…

Computation and Language · Computer Science 2024-10-01 Sihui Yang , Keping Bi , Wanqing Cui , Jiafeng Guo , Xueqi Cheng

Query-driven recommendation with unknown items poses a challenge for users to understand why certain items are appropriate for their needs. Query-driven Contrastive Summarization (QCS) is a methodology designed to address this issue by…

Computation and Language · Computer Science 2025-06-04 George-Kirollos Saad , Scott Sanner

Conversational AI assistants are becoming popular and question-answering is an important part of any conversational assistant. Using relevant utterances as features in question-answering has shown to improve both the precision and recall…

Computation and Language · Computer Science 2020-04-09 Soham Parikh , Quaizar Vohra , Mitul Tiwari

Efficient methods for storing and querying are critical for scaling high-order n-gram language models to large corpora. We propose a language model based on compressed suffix trees, a representation that is highly compact and can be easily…

Computation and Language · Computer Science 2016-08-17 Ehsan Shareghi , Matthias Petri , Gholamreza Haffari , Trevor Cohn

To ensure large language models (LLMs) are used safely, one must reduce their propensity to hallucinate or to generate unacceptable answers. A simple and often used strategy is to first let the LLM generate multiple hypotheses and then…

Computation and Language · Computer Science 2025-02-12 António Farinhas , Haau-Sing Li , André F. T. Martins

While large language models (LLMs) can already achieve strong performance on standard generic summarization benchmarks, their performance on more complex summarization task settings is less studied. Therefore, we benchmark LLMs on…

Computation and Language · Computer Science 2024-07-15 Yixin Liu , Alexander R. Fabbri , Jiawen Chen , Yilun Zhao , Simeng Han , Shafiq Joty , Pengfei Liu , Dragomir Radev , Chien-Sheng Wu , Arman Cohan

Smart word substitution aims to enhance sentence quality by improving word choices; however current benchmarks rely on human-labeled data. Since word choices are inherently subjective, ground-truth word substitutions generated by a small…

Computation and Language · Computer Science 2025-02-18 Hongye Liu , Ricardo Henao

Factorization machines (FM) are a popular model class to learn pairwise interactions by a low-rank approximation. Different from existing FM-based approaches which use a fixed rank for all features, this paper proposes a Rank-Aware FM…

Machine Learning · Computer Science 2019-05-21 Xiaoshuang Chen , Yin Zheng , Jiaxing Wang , Wenye Ma , Junzhou Huang

We present a novel summarization framework for reviews of products and services by selecting informative and concise text segments from the reviews. Our method consists of two major steps. First, we identify five frequently occurring…

Information Retrieval · Computer Science 2012-11-26 Trung V. Nguyen , Alice H. Oh

We consider the problem of using sentence compression techniques to facilitate query-focused multi-document summarization. We present a sentence-compression-based framework for the task, and design a series of learning-based compression…

Computation and Language · Computer Science 2016-06-27 Lu Wang , Hema Raghavan , Vittorio Castelli , Radu Florian , Claire Cardie

We present Semantic WordRank (SWR), an unsupervised method for generating an extractive summary of a single document. Built on a weighted word graph with semantic and co-occurrence edges, SWR scores sentences using an…

Computation and Language · Computer Science 2018-09-14 Hao Zhang , Jie Wang

Review-based Product Question Answering (PQA) allows e-commerce platforms to automatically address customer queries by leveraging insights from user reviews. However, existing PQA systems generate answers with only a single perspective,…

Computation and Language · Computer Science 2025-06-05 An Quang Tang , Xiuzhen Zhang , Minh Ngoc Dinh , Zhuang Li