English
Related papers

Related papers: AMR Parsing using Stack-LSTMs

200 papers

AM dependency parsing is a linguistically principled method for neural semantic parsing with high accuracy across multiple graphbanks. It relies on a type system that models semantic valency but makes existing parsers slow. We describe an…

Computation and Language · Computer Science 2020-10-07 Matthias Lindemann , Jonas Groschwitz , Alexander Koller

In real-world applications, users often require both translations and transcriptions of speech to enhance their comprehension, particularly in streaming scenarios where incremental generation is necessary. This paper introduces a streaming…

Computation and Language · Computer Science 2023-10-03 Sara Papi , Peidong Wang , Junkun Chen , Jian Xue , Jinyu Li , Yashesh Gaur

Recent studies have shown that using an external Language Model (LM) benefits the end-to-end Automatic Speech Recognition (ASR). However, predicting tokens that appear less frequently in the training set is still quite challenging. The…

Computation and Language · Computer Science 2023-01-03 Yukun Feng , Ming Tu , Rui Xia , Chuanzeng Huang , Yuxuan Wang

We use parsing as sequence labeling as a common framework to learn across constituency and dependency syntactic abstractions. To do so, we cast the problem as multitask learning (MTL). First, we show that adding a parsing paradigm as an…

Computation and Language · Computer Science 2020-01-08 Michalina Strzyz , David Vilares , Carlos Gómez-Rodríguez

Automatic open-domain dialogue evaluation has attracted increasing attention, yet remains challenging due to the complexity of assessing response appropriateness. Traditional evaluation metrics, typically trained with true positive and…

Computation and Language · Computer Science 2025-09-17 Bohao Yang , Kun Zhao , Dong Liu , Chen Tang , Liang Zhan , Chenghua Lin

Process Reward Models (PRMs) provide step-level supervision to large language models (LLMs), but scaling up training data annotation remains challenging for both humans and LLMs. To address this limitation, we propose an active learning…

Machine Learning · Computer Science 2025-04-16 Keyu Duan , Zichen Liu , Xin Mao , Tianyu Pang , Changyu Chen , Qiguang Chen , Michael Qizhe Shieh , Longxu Dou

Transformer-based pre-trained language models (PLMs) have dramatically improved the state of the art in NLP across many tasks. This has led to substantial interest in analyzing the syntactic knowledge PLMs learn. Previous approaches to this…

Computation and Language · Computer Science 2020-10-20 Bowen Li , Taeuk Kim , Reinald Kim Amplayo , Frank Keller

Queries to large language models (LLMs) can be divided into two parts: the instruction/question and the accompanying context. The context for retrieval-augmented generation (RAG) systems in most benchmarks comes from Wikipedia-like texts…

Computation and Language · Computer Science 2025-07-01 Benjamin Reichman , Adar Avsian , Kartik Talamadupula , Toshish Jawale , Larry Heck

Automatic evaluation of ST systems is typically performed by comparing translation hypotheses with one or more reference translations. While effective to some extent, this approach inherits the limitation of reference-based evaluation that…

Computation and Language · Computer Science 2026-04-09 Mauro Cettolo , Marco Gaido , Matteo Negri , Sara Papi , Luisa Bentivogli

We present a knowledge and context-based system for parsing and translating natural language and evaluate it on sentences from the Wall Street Journal. Applying machine learning techniques, the system uses parse action examples acquired…

cmp-lg · Computer Science 2009-09-25 Ulf Hermjakob , Raymond J. Mooney

Transformer-based autoregressive (AR) methods have achieved appealing performance for varied sequence-to-sequence generation tasks, e.g., neural machine translation, summarization, and code generation, but suffer from low inference…

Computation and Language · Computer Science 2023-03-15 Yisheng Xiao , Ruiyang Xu , Lijun Wu , Juntao Li , Tao Qin , Yan-Tie Liu , Min Zhang

We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between transition-based parsing and…

Computation and Language · Computer Science 2020-11-03 Carlos Gómez-Rodríguez , Michalina Strzyz , David Vilares

Sentiment transfer aims at revising the input text to satisfy a given sentiment polarity while retaining the original semantic content. The nucleus of sentiment transfer lies in precisely separating the sentiment information from the…

Computation and Language · Computer Science 2023-02-24 Yingze Xie , Jie Xu , LiQiang Qiao , Yun Liu , Feiren Huang , Chaozhuo Li

LLM-based automatic speech recognition (ASR), a well-established approach, connects speech foundation models to large language models (LLMs) through a speech-to-LLM projector, yielding promising results. A common design choice in these…

Large Language Models (LLMs) excel at understanding natural language but struggle with explicit commonsense reasoning. A recent trend of research suggests that the combination of LLM with robust symbolic reasoning systems can overcome this…

Artificial Intelligence · Computer Science 2025-09-23 Manuel Borroto , Katie Gallagher , Antonio Ielo , Irfan Kareem , Francesco Ricca , Alessandra Russo

Creating abstractive summaries from meeting transcripts has proven to be challenging due to the limited amount of labeled data available for training neural network models. Moreover, Transformer-based architectures have proven to beat…

Computation and Language · Computer Science 2021-08-16 Nima Sadri , Bohan Zhang , Bihan Liu

Large Language Model (LLM)-powered Automatic Speech Recognition (ASR) systems achieve strong performance with limited resources by linking a frozen speech encoder to a pretrained LLM via a lightweight connector. Prior work trains a separate…

Computation and Language · Computer Science 2026-02-03 Yuchen Zhang , Ravi Shekhar , Haralambos Mouratidis

Speech recognition systems for irregularly-spelled languages like English normally require hand-written pronunciations. In this paper, we describe a system for automatically obtaining pronunciations of words for which pronunciations are not…

Computation and Language · Computer Science 2017-06-13 Xiaohui Zhang , Vimal Manohar , Daniel Povey , Sanjeev Khudanpur

Text stemming is a natural language processing technique that is used to reduce words to their base form, also known as the root form. The use of stemming in IR has been shown to often improve the effectiveness of keyword-matching models…

Information Retrieval · Computer Science 2024-02-20 Shuai Wang , Shengyao Zhuang , Guido Zuccon

Cross-lingual AMR parsing is the task of predicting AMR graphs in a target language when training data is available only in a source language. Due to the small size of AMR training data and evaluation data, cross-lingual AMR parsing has…

Computation and Language · Computer Science 2024-10-07 Jeongwoo Kang , Maximin Coavoux , Cédric Lopez , Didier Schwab
‹ Prev 1 8 9 10 Next ›