English
Related papers

Related papers: ParseTalk about Sentence- and Text-Level Anaphora

200 papers

Inference tasks such as answer sentence selection (AS2) or fact verification are typically solved by fine-tuning transformer-based models as individual sentence-pair classifiers. Recent studies show that these tasks benefit from modeling…

Computation and Language · Computer Science 2022-07-08 Luca Di Liello , Siddhant Garg , Luca Soldaini , Alessandro Moschitti

We present a dependently-typed cross-linguistic framework for analyzing the telicity and culminativity of events, accompanied by examples of using our framework to model English sentences. Our framework consists of two parts. In the nominal…

Computation and Language · Computer Science 2026-04-01 Pavel Kovalev , Carlo Angiuli

An account of utterance interpretation in discourse needs to face the issue of how the discourse context controls the space of interacting preferences. Assuming a discourse processing architecture that distinguishes the grammar and…

cmp-lg · Computer Science 2008-02-03 Megumi Kameyama

A sentence may express sentiments on multiple aspects. When these aspects are associated with different sentiment polarities, a model's accuracy is often adversely affected. We observe that multiple aspects in such hard sentences are mostly…

Computation and Language · Computer Science 2022-02-08 Ting Lin , Aixin Sun , Yequan Wang

In this work, we propose contextual language models that incorporate dialog level discourse information into language modeling. Previous works on contextual language model treat preceding utterances as a sequence of inputs, without…

Computation and Language · Computer Science 2017-01-17 Bing Liu , Ian Lane

For text-level discourse analysis, there are various discourse schemes but relatively few labeled data, because discourse research is still immature and it is labor-intensive to annotate the inner logic of a text. In this paper, we attempt…

Computation and Language · Computer Science 2021-05-26 Yi Cheng , Sujian Li , Yueyuan Li

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

Logic in Computer Science · Computer Science 2017-07-04 Lorenzo Gheri , Andrei Popescu

Syntactic structures used to play a vital role in natural language processing (NLP), but since the deep learning revolution, NLP has been gradually dominated by neural models that do not consider syntactic structures in their design. One…

Computation and Language · Computer Science 2023-11-28 Haoyi Wu , Kewei Tu

The words-as-classifiers model of grounded lexical semantics learns a semantic fitness score between physical entities and the words that are used to denote those entities. In this paper, we explore how such a model can incrementally…

Computation and Language · Computer Science 2019-11-11 Daniele Moro , Stacy Black , Casey Kennington

Bridging refers to the associative relationship between inferable entities in a discourse and the antecedents which allow us to understand them, such as understanding what "the door" means with respect to an aforementioned "house". As…

Computation and Language · Computer Science 2025-06-10 Lauren Levine , Amir Zeldes

A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism---to express syntactic theories purely in terms of the properties of…

cmp-lg · Computer Science 2008-02-03 James Rogers

An important task for designing QA systems is answer sentence selection (AS2): selecting the sentence containing (or constituting) the answer to a question from a set of retrieved relevant documents. In this paper, we propose three novel…

Computation and Language · Computer Science 2022-10-21 Luca Di Liello , Siddhant Garg , Luca Soldaini , Alessandro Moschitti

This paper concerns how to generate and understand discourse anaphoric noun phrases. I present the results of an analysis of all discourse anaphoric noun phrases (N=1,233) in a corpus of ten narrative monologues, where the choice between a…

cmp-lg · Computer Science 2008-02-03 Rebecca J. Passonneau

We review the task of Sentence Pair Scoring, popular in the literature in various forms - viewed as Answer Sentence Selection, Semantic Text Scoring, Next Utterance Ranking, Recognizing Textual Entailment, Paraphrasing or e.g. a component…

Computation and Language · Computer Science 2016-05-18 Petr Baudiš , Jan Pichl , Tomáš Vyskočil , Jan Šedivý

A major challenge to the problem of community question answering is the lexical and semantic gap between the sentence representations. Some solutions to minimize this gap includes the introduction of extra parameters to deep models or…

Computation and Language · Computer Science 2018-01-23 Gaurav Bhatt , Shivam Sharma , Balasubramanian Raman

Word embedding models offer continuous vector representations that can capture rich contextual semantics based on their word co-occurrence patterns. While these word vectors can provide very effective features used in many NLP tasks such as…

Computation and Language · Computer Science 2017-02-27 Cem Safak Sahin , Rajmonda S. Caceres , Brandon Oselio , William M. Campbell

In this paper, we present an approach to improve the accuracy of a strong transition-based dependency parser by exploiting dependency language models that are extracted from a large parsed corpus. We integrated a small number of features…

Computation and Language · Computer Science 2017-09-01 Juntao Yu , Bernd Bohnet

Deep compositional models of meaning acting on distributional representations of words in order to produce vectors of larger text constituents are evolving to a popular area of NLP research. We detail a compositional distributional…

Computation and Language · Computer Science 2015-08-14 Jianpeng Cheng , Dimitri Kartsaklis

Grammatical feedback is crucial for L2 learners, teachers, and testers. Spoken grammatical error correction (GEC) aims to supply feedback to L2 learners on their use of grammar when speaking. This process usually relies on a cascaded…

Computation and Language · Computer Science 2024-07-22 Stefano Bannò , Rao Ma , Mengjie Qian , Kate M. Knill , Mark J. F. Gales

Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the…

Logic in Computer Science · Computer Science 2007-05-23 Frederic Blanqui
‹ Prev 1 4 5 6 7 8 10 Next ›