English
Related papers

Related papers: Learning Language from a Large (Unannotated) Corpu…

200 papers

For Relation Extraction (RE), the manual annotation of training data may be prohibitively expensive, since the sentences that contain the target relations in texts can be very scarce and difficult to find. It is therefore beneficial to…

Computation and Language · Computer Science 2025-09-11 Zexuan Li , Hongliang Dai , Piji Li

Understanding how the structure of language can be learned from sentences alone is a central question in both cognitive science and machine learning. Studies of the internal representations of Large Language Models (LLMs) support their…

Machine Learning · Statistics 2026-02-10 Jack T. Parley , Francesco Cagnetta , Matthieu Wyart

This thesis is concerned with type-logical grammars and their practical applicability as tools of reasoning about sentence syntax and semantics. The focal point is narrowed to Dutch, a language exhibiting a large degree of word order…

Computation and Language · Computer Science 2019-09-11 Konstantinos Kogkalidis

Large language models (LLMs) have demonstrated impressive abilities in generating unstructured natural language according to instructions. However, their performance can be inconsistent when tasked with producing text that adheres to…

Computation and Language · Computer Science 2024-02-22 Yinghao Li , Rampi Ramprasad , Chao Zhang

We address the text-to-text generation problem of sentence-level paraphrasing -- a phenomenon distinct from and more difficult than word- or phrase-level paraphrasing. Our approach applies multiple-sequence alignment to sentences gathered…

Computation and Language · Computer Science 2007-05-23 Regina Barzilay , Lillian Lee

Unsupervised dependency parsing aims to learn a dependency parser from unannotated sentences. Existing work focuses on either learning generative models using the expectation-maximization algorithm and its variants, or learning…

Computation and Language · Computer Science 2017-09-26 Yong Jiang , Wenjuan Han , Kewei Tu

A new language model for speech recognition inspired by linguistic analysis is presented. The model develops hidden hierarchical structure incrementally and uses it to extract meaningful information from the word history - thus enabling the…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba , Frederick Jelinek

Open-domain semantic parsing remains a challenging task, as neural models often rely on heuristics and struggle to handle unseen concepts. In this paper, we investigate the potential of large language models (LLMs) for this task and…

Computation and Language · Computer Science 2025-08-21 Xiao Zhang , Qianru Meng , Johan Bos

This article presents a hybrid methodology for building a multilingual corpus designed to support the study of emerging concepts in the humanities and social sciences (HSS), illustrated here through the case of ``non-technological…

Computation and Language · Computer Science 2025-12-09 Revekka Kyriakoglou , Anna Pappa

Existing research on large language models (LLMs) shows that they can solve information extraction tasks through multi-step planning. However, their extraction behavior on complex sentences and tasks is unstable, emerging issues such as…

Computation and Language · Computer Science 2024-08-30 Zepeng Ding , Ruiyang Ke , Wenhao Huang , Guochao Jiang , Yanda Li , Deqing Yang , Jiaqing Liang

Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is prohibitively expensive. This work aims to improve the…

Computation and Language · Computer Science 2007-05-23 Rebecca Hwa

General purpose relation extraction has recently seen considerable gains in part due to a massively data-intensive distant supervision technique from Soares et al. (2019) that produces state-of-the-art results across many benchmarks. In…

Computation and Language · Computer Science 2020-12-07 Amith Ananthram , Emily Allaway , Kathleen McKeown

The paper describes a system that uses large language model (LLM) technology to support the automatic learning of new entries in an intelligent agent's semantic lexicon. The process is bootstrapped by an existing non-toy lexicon and a…

Computation and Language · Computer Science 2023-12-29 Sanjay Oruganti , Sergei Nirenburg , Jesse English , Marjorie McShane

Cross-lingual language tasks typically require a substantial amount of annotated data or parallel translation data. We explore whether language representations that capture relationships among languages can be learned and subsequently…

Computation and Language · Computer Science 2021-06-07 Dian Yu , Taiqi He , Kenji Sagae

The rapid development of large language models (LLMs) has not only provided numerous opportunities but also presented significant challenges. This becomes particularly evident when LLMs inadvertently generate harmful or toxic content,…

Computation and Language · Computer Science 2024-02-20 Kai Chen , Chunwei Wang , Kuo Yang , Jianhua Han , Lanqing Hong , Fei Mi , Hang Xu , Zhengying Liu , Wenyong Huang , Zhenguo Li , Dit-Yan Yeung , Lifeng Shang , Xin Jiang , Qun Liu

After presenting a novel O(n^3) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model…

cmp-lg · Computer Science 2008-02-06 Jason Eisner

Identifying and correcting grammatical errors in the text written by non-native writers has received increasing attention in recent years. Although a number of annotated corpora have been established to facilitate data-driven grammatical…

Computation and Language · Computer Science 2016-11-30 Zhuoran Liu , Yang Liu

We present a novel framework to deal with relation extraction tasks in cases where there is complete lack of supervision, either in the form of gold annotations, or relations from a knowledge base. Our approach leverages syntactic parsing…

Machine Learning · Computer Science 2019-11-04 Yannis Papanikolaou , Ian Roberts , Andrea Pierleoni

Unsupervised relation discovery aims to discover new relations from a given text corpus without annotated data. However, it does not consider existing human annotated knowledge bases even when they are relevant to the relations to be…

Computation and Language · Computer Science 2019-05-07 Yan Liang , Xin Liu , Jianwen Zhang , Yangqiu Song

Some of the major limitations identified in the areas of argument mining, argument generation, and natural language argument analysis are related to the complexity of annotating argumentatively rich data, the limited size of these corpora,…

Computation and Language · Computer Science 2024-02-23 Ramon Ruiz-Dolz , Joaquin Taverner , John Lawrence , Chris Reed
‹ Prev 1 3 4 5 6 7 10 Next ›