English
Related papers

Related papers: A Psycholinguistically Motivated Parser for CCG

200 papers

Unsupervised neural grammar induction aims to learn interpretable hierarchical structures from language data. However, existing models face an expressiveness bottleneck, often resulting in unnecessarily large yet underperforming grammars.…

Computation and Language · Computer Science 2025-09-26 Jinwook Park , Kangil Kim

Large language models (LLMs) demonstrate strong reasoning abilities in solving complex real-world problems. Yet, the internal mechanisms driving these complex reasoning behaviors remain opaque. Existing interpretability approaches targeting…

Artificial Intelligence · Computer Science 2026-02-04 Changming Li , Kaixing Zhang , Haoyun Xu , Yingdong Shi , Zheng Zhang , Kaitao Song , Kan Ren

Syntactic parsing, the process of obtaining the internal structure of sentences in natural languages, is a crucial task for artificial intelligence applications that need to extract meaning from natural language text or speech. Sentiment…

Computation and Language · Computer Science 2017-10-25 Carlos Gómez-Rodríguez , Iago Alonso-Alonso , David Vilares

Lexical ambiguity is widespread in language, allowing for the reuse of economical word forms and therefore making language more efficient. If ambiguous words cannot be disambiguated from context, however, this gain in efficiency might make…

Computation and Language · Computer Science 2024-05-29 Tiago Pimentel , Rowan Hall Maudslay , Damián Blasi , Ryan Cotterell

We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence between linguistic theories and their…

cmp-lg · Computer Science 2008-02-03 Thilo Goetz , Walt Detmar Meurers

The web-scale of pretraining data has created an important evaluation challenge: to disentangle linguistic competence on cases well-represented in pretraining data from generalization to out-of-domain language, specifically the dynamic,…

Computation and Language · Computer Science 2025-08-14 Wesley Scivetti , Melissa Torgbi , Austin Blodgett , Mollie Shichman , Taylor Hudson , Claire Bonial , Harish Tayyar Madabushi

Compounding is a highly productive word-formation process in some languages that is often problematic for natural language processing applications. In this paper, we investigate whether distributional semantics in the form of word…

Computation and Language · Computer Science 2015-09-16 Joachim Daiber , Lautaro Quiroz , Roger Wechsler , Stella Frank

Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar compression develops a smaller CFG by finding duplicated…

Data Structures and Algorithms · Computer Science 2016-09-01 Shouhei Fukunaga , Yoshimasa Takabatake , I Tomohiro , Hiroshi Sakamoto

Parsing sentences to linguistically-expressive semantic representations is a key goal of Natural Language Processing. Yet statistical parsing has focused almost exclusively on bilexical dependencies or domain-specific logical forms. We…

Computation and Language · Computer Science 2017-07-28 Jan Buys , Phil Blunsom

Traditional natural language parsers are based on rewrite rule systems developed in an arduous, time-consuming manner by grammarians. A majority of the grammarian's efforts are devoted to the disambiguation process, first hypothesizing…

cmp-lg · Computer Science 2016-08-31 David M. Magerman

We present an approach for recursively splitting and rephrasing complex English sentences into a novel semantic hierarchy of simplified sentences, with each of them presenting a more regular structure that may facilitate a wide variety of…

Computation and Language · Computer Science 2019-06-05 Christina Niklaus , Matthias Cetto , Andre Freitas , Siegfried Handschuh

Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some language. PEGs are easy to use, and there are efficient…

Formal Languages and Automata Theory · Computer Science 2014-02-17 Sérgio Medeiros , Fabio Mascarenhas , Roberto Ierusalimschy

Recent years the task of incomplete utterance rewriting has raised a large attention. Previous works usually shape it as a machine translation task and employ sequence to sequence based architecture with copy mechanism. In this paper, we…

Computation and Language · Computer Science 2020-09-29 Qian Liu , Bei Chen , Jian-Guang Lou , Bin Zhou , Dongmei Zhang

Semantic parsing has made significant progress, but most current semantic parsers are extremely slow (CKY-based) and rather primitive in representation. We introduce three new techniques to tackle these problems. First, we design the first…

Computation and Language · Computer Science 2014-12-17 Kai Zhao , Liang Huang

With the blooming of various Pre-trained Language Models (PLMs), Machine Reading Comprehension (MRC) has embraced significant improvements on various benchmarks and even surpass human performances. However, the existing works only target on…

Computation and Language · Computer Science 2020-11-16 Yiming Cui , Ting Liu , Shijin Wang , Guoping Hu

This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top-down predictions (derivations and adjacencies). From a functional point of view, the parser is able…

cmp-lg · Computer Science 2007-05-23 Jose F. Quesada

The majority of research in computational psycholinguistics has concentrated on the processing of words. This study introduces innovative methods for computing sentence-level metrics using multilingual large language models. The metrics…

Computation and Language · Computer Science 2024-04-17 Kun Sun , Rong Wang

One important aspect of language is how speakers generate utterances and texts to convey their intended meanings. In this paper, we bring various aspects of the Construction Grammar (CxG) and the Systemic Functional Grammar (SFG) theories…

Computation and Language · Computer Science 2023-02-06 Priyanka Dey , Roxana Girju

This study proposes a multitask learning architecture for extractive summarization with coherence boosting. The architecture contains an extractive summarizer and coherent discriminator module. The coherent discriminator is trained online…

Computation and Language · Computer Science 2023-07-24 Renlong Jie , Xiaojun Meng , Lifeng Shang , Xin Jiang , Qun Liu

The state-of-the-art neural network architectures make it possible to create spoken language understanding systems with high quality and fast processing time. One major challenge for real-world applications is the high latency of these…

Computation and Language · Computer Science 2019-10-01 Stefan Constantin , Jan Niehues , Alex Waibel
‹ Prev 1 3 4 5 6 7 10 Next ›