English
Related papers

Related papers: Consistent CCG Parsing over Multiple Sentences for…

200 papers

Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose interpretation is the most `sensible', one comes to the conclusion…

cmp-lg · Computer Science 2008-02-03 Michael Niv

Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In…

Artificial Intelligence · Computer Science 2011-08-30 Yuliya Lierler , Peter Schüller

We present the architecture and the evaluation of a new system for recognizing textual entailment (RTE). In RTE we want to identify automatically the type of a logical relation between two input texts. In particular, we are interested in…

Computation and Language · Computer Science 2013-10-21 Andreas Wotzlaw , Ravi Coote

This paper builds on previous work using Combinatory Categorial Grammar (CCG) to derive a transparent syntax-semantics interface for Abstract Meaning Representation (AMR) parsing. We define new semantics for the CCG combinators that is…

Computation and Language · Computer Science 2019-04-12 Austin Blodgett , Nathan Schneider

Comparative constructions play an important role in natural language inference. However, attempts to study semantic representations and logical inferences for comparatives from the computational perspective are not well developed, due to…

Computation and Language · Computer Science 2019-10-03 Izumi Haruta , Koji Mineshima , Daisuke Bekki

This report describes the parsing problem for Combinatory Categorial Grammar (CCG), showing how a combination of Transformer-based neural models and a symbolic CCG grammar can lead to substantial gains over existing approaches. The report…

Computation and Language · Computer Science 2021-09-29 Stephen Clark

Syntax-incorporated machine translation models have been proven successful in improving the model's reasoning and meaning preservation ability. In this paper, we propose a simple yet effective graph-structured encoder, the Recurrent Graph…

Computation and Language · Computer Science 2019-08-20 Liang Ding , Dacheng Tao

We present a compositional semantics for various types of polar questions and wh-questions within the framework of Combinatory Categorial Grammar (CCG). To assess the explanatory power of our proposed analysis, we introduce a…

Computation and Language · Computer Science 2023-12-25 Hayate Funakura , Koji Mineshima

Machine-translated text plays an important role in modern life by smoothing communication from various communities using different languages. However, unnatural translation may lead to misunderstanding, a detector is thus needed to avoid…

Computation and Language · Computer Science 2019-04-25 Hoang-Quoc Nguyen-Son , Tran Phuong Thao , Seira Hidano , Shinsaku Kiyomoto

While Retrieval-Augmented Generation (RAG) systems enhance Large Language Models (LLMs) by incorporating external knowledge, they still face persistent challenges in retrieval inefficiency and the inability of LLMs to filter out irrelevant…

Computation and Language · Computer Science 2025-02-13 Ruobing Yao , Yifei Zhang , Shuang Song , Yuhua Liu , Neng Gao , Chenyang Tu

Controlled text generation (CTG) seeks to guide large language model (LLM) output to produce text that conforms to desired criteria. The current study presents a novel CTG algorithm that enforces adherence toward specific rhetorical…

Computation and Language · Computer Science 2024-02-12 Joshua Zingale , Jugal Kalita

We propose a new domain adaptation method for Combinatory Categorial Grammar (CCG) parsing, based on the idea of automatic generation of CCG corpora exploiting cheaper resources of dependency trees. Our solution is conceptually simple, and…

Computation and Language · Computer Science 2019-06-06 Masashi Yoshikawa , Hiroshi Noji , Koji Mineshima , Daisuke Bekki

Context-free grammars (CFGs) are the de-facto formalism for declaratively describing concrete syntax for programming languages and generating parsers. One of the major challenges in defining a desired syntax is ruling out all possible…

Programming Languages · Computer Science 2026-02-23 Yunjeong Lee , Gokul Rajiv , Ilya Sergey

Recognizing textual entailment is a fundamental task in a variety of text mining or natural language processing applications. This paper proposes a simple neural model for RTE problem. It first matches each word in the hypothesis with its…

Computation and Language · Computer Science 2017-05-26 Zhipeng Xie , Junfeng Hu

Semantic parsing can be defined as the process of mapping natural language sentences into a machine interpretable, formal representation of its meaning. Semantic parsing using LSTM encoder-decoder neural networks have become promising…

Computation and Language · Computer Science 2018-07-20 Fabiano Ferreira Luz , Marcelo Finger

Robots are widely collaborating with human users in diferent tasks that require high-level cognitive functions to make them able to discover the surrounding environment. A difcult challenge that we briefy highlight in this short paper is…

Computation and Language · Computer Science 2020-03-16 Amir Aly , Tadahiro Taniguchi

Previous works have demonstrated the effectiveness of utilising pre-trained sentence encoders based on their sentence representations for meaning comparison tasks. Though such representations are shown to capture hidden syntax structures,…

Computation and Language · Computer Science 2022-10-12 Qiwei Peng , David Weir , Julie Weeds

The Neural Contextual Reinforcement Framework introduces an innovative approach to enhancing the logical coherence and structural consistency of text generated by large language models. Leveraging reinforcement learning principles, the…

Computation and Language · Computer Science 2025-08-11 Marcus Irvin , William Cooper , Edward Hughes , Jessica Morgan , Christopher Hamilton

Generative retrieval (GR) models encode a corpus within model parameters and generate relevant document identifiers directly for a given query. While this paradigm shows promise in retrieval tasks, existing GR models struggle with complex…

Information Retrieval · Computer Science 2026-03-16 Steven Dong , Yubao Tang , Maarten de Rijke

We describe a Context Free Grammar (CFG) for Bangla language and hence we propose a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language of…

Computation and Language · Computer Science 2012-01-11 K. M. Azharul Hasan , Al-Mahmud , Amit Mondal , Amit Saha
‹ Prev 1 2 3 10 Next ›