English
Related papers

Related papers: Emergence of Syntax Needs Minimal Supervision

200 papers

Concept induction requires the extraction and naming of concepts from noisy perceptual experience. For supervised approaches, as the number of concepts grows, so does the number of required training examples. Philosophers, psychologists,…

Machine Learning · Computer Science 2020-01-20 Brett D. Roads , Bradley C. Love

Word sense disambiguation algorithms, with few exceptions, have made use of only one lexical knowledge source. We describe a system which performs unrestricted word sense disambiguation (on all content words in free text) by combining…

cmp-lg · Computer Science 2007-05-23 Yorick Wilks , Mark Stevenson

Clinical trial records are variable resources or the analysis of patients and diseases. Information extraction from free text such as eligibility criteria and summary of results and conclusions in clinical trials would better support…

Computation and Language · Computer Science 2020-01-01 Yingcheng Sun , Kenneth Loparo

This paper studies the potential of identifying lexical paraphrases within a single corpus, focusing on the extraction of verb paraphrases. Most previous approaches detect individual paraphrase instances within a pair (or set) of comparable…

Computation and Language · Computer Science 2007-05-23 Oren Glickman , Ido Dagan

Recognizing shallow linguistic patterns, such as basic syntactic relationships between words, is a common task in applied natural language and text processing. The common practice for approaching this task is by tedious manual definition of…

cmp-lg · Computer Science 2007-05-23 Shlomo Argamon , Ido Dagan , Yuval Krymolowski

We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from text. While previously studied…

Databases · Computer Science 2023-01-25 Liat Peterfreund

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

Large language models (LLMs) have been found to develop surprising internal specializations: Individual neurons, attention heads, and circuits become selectively sensitive to syntactic structure, reflecting patterns observed in the human…

Computation and Language · Computer Science 2025-05-27 Xufeng Duan , Zhaoqian Yao , Yunhao Zhang , Shaonan Wang , Zhenguang G. Cai

We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually…

Other Computer Science · Computer Science 2015-09-03 Michael J. Bannister , David A. Brown , David Eppstein

We describe a number of experiments that demonstrate the usefulness of prosodic information for a processing module which parses spoken utterances with a feature-based grammar employing empty categories. We show that by requiring certain…

This paper introduces a new type of unsupervised learning algorithm, based on the alignment of sentences and Harris's (1951) notion of interchangeability. The algorithm is applied to an untagged, unstructured corpus of natural language…

Machine Learning · Computer Science 2009-09-25 Menno van Zaanen

Generating structured query language (SQL) from natural language is an emerging research topic. This paper presents a new learning paradigm from indirect supervision of the answers to natural language questions, instead of SQL queries. This…

Computation and Language · Computer Science 2018-09-11 Ziwei Bai , Bo Yu , Bowen Wu , Zhuoran Wang , Baoxun Wang

Dependency parsing is a fundamental task in natural language processing (NLP), aiming to identify syntactic dependencies and construct a syntactic tree for a given sentence. Traditional dependency parsing models typically construct…

Computation and Language · Computer Science 2025-02-25 Keunha Kim , Youngjoong Ko

While deep learning approaches to information extraction have had many successes, they can be difficult to augment or maintain as needs shift. Rule-based methods, on the other hand, can be more easily modified. However, crafting rules…

Computation and Language · Computer Science 2022-02-02 Robert Vacareanu , Marco A. Valenzuela-Escarcega , George C. G. Barbosa , Rebecca Sharp , Mihai Surdeanu

We discuss the feasibility of the following learning problem: given unmatched samples from two domains and nothing else, learn a mapping between the two, which preserves semantics. Due to the lack of paired samples and without any…

Machine Learning · Computer Science 2020-01-16 Tomer Galanti , Lior Wolf , Sagie Benaim

Standard methods in deep learning for natural language processing fail to capture the compositional structure of human language that allows for systematic generalization outside of the training distribution. However, human learners readily…

Machine Learning · Computer Science 2019-05-27 Jake Russin , Jason Jo , Randall C. O'Reilly , Yoshua Bengio

The syntactic topic model (STM) is a Bayesian nonparametric model of language that discovers latent distributions of words (topics) that are both semantically and syntactically coherent. The STM models dependency parsed corpora where…

Computation and Language · Computer Science 2010-03-04 Jordan Boyd-Graber , David M. Blei

Compositional generalization -- the ability to understand and generate novel combinations of learned concepts -- enables models to extend their capabilities beyond limited experiences. While effective, the data structures and principles…

Machine Learning · Computer Science 2025-12-12 Lingjing Kong , Shaoan Xie , Yang Jiao , Yetian Chen , Yanhui Guo , Simone Shao , Yan Gao , Guangyi Chen , Kun Zhang

Classic Topic Models are built under the Bag Of Words assumption, in which word position is ignored for simplicity. Besides, symmetric priors are typically used in most applications. In order to easily learn topics with different properties…

Computation and Language · Computer Science 2018-06-27 Simón Roca-Sotelo , Jerónimo Arenas-García

Most existing text generation models follow the sequence-to-sequence paradigm. Generative Grammar suggests that humans generate natural language texts by learning language grammar. We propose a syntax-guided generation schema, which…

Computation and Language · Computer Science 2023-06-27 Yafu Li , Leyang Cui , Jianhao Yan , Yongjing Yin , Wei Bi , Shuming Shi , Yue Zhang