English
Related papers

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

200 papers

Various encoder-decoder models have been applied to response generation in open-domain dialogs, but a majority of conventional models directly learn a mapping from lexical input to lexical output without explicitly modeling intermediate…

Computation and Language · Computer Science 2019-06-27 Tianyu Zhao , Shinsuke Mori , Tatsuya Kawahara

In this paper we present a formalization of the centering approach to modeling attentional structure in discourse and use it as the basis for an algorithm to track discourse context and bind pronouns. As described in Grosz, Joshi and…

cmp-lg · Computer Science 2008-02-03 Susan E. Brennan , Marilyn Walker Friedman , Carl J. Pollard

A variety of contextualised language models have been proposed in the NLP community, which are trained on diverse corpora to produce numerous Neural Language Models (NLMs). However, different NLMs have reported different levels of…

Computation and Language · Computer Science 2022-04-19 Keigo Takahashi , Danushka Bollegala

We train one multilingual model for dependency parsing and use it to parse sentences in several languages. The parsing model uses (i) multilingual word clusters and embeddings; (ii) token-level language information; and (iii)…

Computation and Language · Computer Science 2016-07-27 Waleed Ammar , George Mulcaire , Miguel Ballesteros , Chris Dyer , Noah A. Smith

This paper proposes the use of dependent types for pragmatic phenomena such as pronoun binding and presupposition resolution as a type-theoretic alternative to formalisms such as Discourse Representation Theory and Dynamic Semantics.

Computation and Language · Computer Science 2015-07-23 Darryl McAdams , Jonathan Sterling

Document-level relation extraction aims to discover relations between entities across a whole document. How to build the dependency of entities from different sentences in a document remains to be a great challenge. Current approaches…

Computation and Language · Computer Science 2021-03-16 Jiaxin Pan , Min Peng , Yiyan Zhang

Probabilistic topic models are generative models that describe the content of documents by discovering the latent topics underlying them. However, the structure of the textual input, and for instance the grouping of words in coherent text…

Computation and Language · Computer Science 2016-06-02 Georgios Balikas , Massih-Reza Amini , Marianne Clausel

We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension…

Computation and Language · Computer Science 2007-05-23 Jørgen Villadsen

We propose a new word embedding model, called SPhrase, that incorporates supervised phrase information. Our method modifies traditional word embeddings by ensuring that all target words in a phrase have exactly the same context. We…

Computation and Language · Computer Science 2020-02-19 Manni Singh , David Weston , Mark Levene

This thesis presents a broad-coverage probabilistic top-down parser, and its application to the problem of language modeling for speech recognition. The parser builds fully connected derivations incrementally, in a single pass from…

Computation and Language · Computer Science 2007-05-23 Brian Roark

Psycholinguistic normatives represent various affective and mental constructs using numeric scores and are used in a variety of applications in natural language processing. They are commonly used at the sentence level, the scores of which…

Computation and Language · Computer Science 2020-05-21 Anil Ramakrishna , Shrikanth Narayanan

This paper presents a joint model for performing unsupervised morphological analysis on words, and learning a character-level composition function from morphemes to word embeddings. Our model splits individual words into segments, and…

Computation and Language · Computer Science 2016-06-09 Kris Cao , Marek Rei

One of the main challenges in conversational question answering (CQA) is to resolve the conversational dependency, such as anaphora and ellipsis. However, existing approaches do not explicitly train QA models on how to resolve the…

Computation and Language · Computer Science 2021-06-23 Gangwoo Kim , Hyunjae Kim , Jungsoo Park , Jaewoo Kang

This paper presents a corpus-based method to assign grammatical subject/object relations to ambiguous German constructs. It makes use of an unsupervised learning procedure to collect training and test data, and the back-off model to make…

cmp-lg · Computer Science 2008-02-03 Erika F. de Lima

To simultaneously capture syntax and global semantics from a text corpus, we propose a new larger-context recurrent neural network (RNN) based language model, which extracts recurrent hierarchical semantic structure via a dynamic deep topic…

Computation and Language · Computer Science 2020-06-30 Dandan Guo , Bo Chen , Ruiying Lu , Mingyuan Zhou

The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of…

Computation and Language · Computer Science 2018-11-27 Lei Yu , Cyprien de Masson d'Autume , Chris Dyer , Phil Blunsom , Lingpeng Kong , Wang Ling

Transformers underlie almost all state-of-the-art language models in computational linguistics, yet their cognitive adequacy as models of human sentence processing remains disputed. In this work, we use a surprisal-based linking mechanism…

Computation and Language · Computer Science 2026-03-18 Titus von der Malsburg , Sebastian Padó

Machine comprehension question answering, which finds an answer to the question given a passage, involves high-level reasoning processes of understanding and tracking the relevant contents across various semantic units such as words,…

Computation and Language · Computer Science 2018-07-24 Minjeong Kim , David Keetae Park , Hyungjong Noh , Yeonsoo Lee , Jaegul Choo

I review evidence for the claim that syntactic ambiguities are resolved on the basis of the meaning of the competing analyses, not their structure. I identify a collection of ambiguities that do not yet have a meaning-based account and…

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

Most of the syntax-based metrics obtain the similarity by comparing the sub-structures extracted from the trees of hypothesis and reference. These sub-structures are defined by human and can't express all the information in the trees…

Computation and Language · Computer Science 2016-11-07 Hui Yu , Xiaofeng Wu , Wenbin Jiang , Qun Liu , ShouXun Lin