English
Related papers

Related papers: An Algorithm to Co-Ordinate Anaphora Resolution an…

200 papers

In this paper, we attempt to solve the problem of Prepositional Phrase (PP) attachments in English. The motivation for the work comes from NLP applications like Machine Translation, for which, getting the correct attachment of prepositions…

Computation and Language · Computer Science 2016-03-30 Geetanjali Rakshit , Sagar Sontakke , Pushpak Bhattacharyya , Gholamreza Haffari

There has recently been considerable interest in the use of lexically-based statistical techniques to resolve prepositional phrase attachments. To our knowledge, however, these investigations have only considered the problem of attaching…

cmp-lg · Computer Science 2007-05-23 Paola Merlo , Matthew Crocker , Cathy Berthouzoz

Previous work on bridging anaphora resolution (Poesio et al., 2004; Hou et al., 2013b) use syntactic preposition patterns to calculate word relatedness. However, such patterns only consider NPs' head nouns and hence do not fully capture the…

Computation and Language · Computer Science 2018-11-15 Yufang Hou

We revisit the challenging problem of resolving prepositional-phrase (PP) attachment ambiguity. To date, proposed solutions are either rule-based, where explicit grammar rules direct how to resolve ambiguities; or statistical, where the…

Computation and Language · Computer Science 2021-02-08 Yida Xin , Henry Lieberman , Peter Chin

Most current models of word representations(e.g.,GloVe) have successfully captured fine-grained semantics. However, semantic similarity exhibited in these word embeddings is not suitable for resolving bridging anaphora, which requires the…

Computation and Language · Computer Science 2018-04-16 Yufang Hou

Anaphora resolution is a challenging task which has been the interest of NLP researchers for a long time. Traditional resolution techniques like eliminative constraints and weighted preferences were successful in many languages. However,…

Computation and Language · Computer Science 2019-11-25 Vinay Annam , Nikhil Koditala , Radhika Mamidi

In order to take steps towards establishing a methodology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to anaphoric processing in discourse by comparing the accuracy and…

cmp-lg · Computer Science 2008-02-03 Marilyn A. Walker

We propose an algorithm to resolve anaphors, tackling mainly the problem of intrasentential antecedents. We base our methodology on the fact that such antecedents are likely to occur in embedded sentences. Sidner's focusing mechanism is…

cmp-lg · Computer Science 2008-02-03 Saliha Azzam

In this paper, we describe a new corpus-based approach to prepositional phrase attachment disambiguation, and present results comparing performance of this algorithm with other corpus-based approaches to this problem.

cmp-lg · Computer Science 2008-02-03 Eric Brill , Philip Resnik

Anaphora resolution is one of the major problems in natural language processing. It is also one of the important tasks in machine translation and man/machine dialogue. We solve the problem by using surface expressions and examples. Surface…

Computation and Language · Computer Science 2009-09-25 Masaki Murata

Anaphora resolution is envisaged in this paper as part of the reference resolution process. A general open architecture is proposed, which can be particularized and configured in order to simulate some classic anaphora resolution methods.…

Computation and Language · Computer Science 2007-05-23 Andrei Popescu-Belis , Isabelle Robba

Prepositions are highly polysemous, and their variegated senses encode significant semantic information. In this paper we match each preposition's complement and attachment and their interplay crucially to the geometry of the word vectors…

Computation and Language · Computer Science 2017-02-07 Hongyu Gong , Jiaqi Mu , Suma Bhat , Pramod Viswanath

Anaphora and ellipses are two common phenomena in dialogues. Without resolving referring expressions and information omission, dialogue systems may fail to generate consistent and coherent responses. Traditionally, anaphora is resolved by…

Artificial Intelligence · Computer Science 2021-05-21 Bo-Hsiang Tseng , Shruti Bhargava , Jiarui Lu , Joel Ruben Antony Moniz , Dhivya Piraviperumal , Lin Li , Hong Yu

Combining the representations of the words that make up a sentence into a cohesive whole is difficult, since it needs to account for the order of words, and to establish how the words present relate to each other. The solution we propose…

Computation and Language · Computer Science 2021-03-04 Diego Maupomé , Marie-Jean Meurs

Recognizing analogies, synonyms, antonyms, and associations appear to be four distinct tasks, requiring distinct NLP algorithms. In the past, the four tasks have been treated independently, using a wide variety of algorithms. These four…

Computation and Language · Computer Science 2008-09-02 Peter D. Turney

Recent work has considered corpus-based or statistical approaches to the problem of prepositional phrase attachment ambiguity. Typically, ambiguous verb phrases of the form {v np1 p np2} are resolved through a model which considers values…

cmp-lg · Computer Science 2008-02-03 Michael Collins , James Brooks

Anaphora resolution is one of the most active research areas in natural language processing. This study examines focusing as a tool for the resolution of pronouns which are a kind of anaphora. Focusing is a discourse phenomenon like…

cmp-lg · Computer Science 2008-02-03 Ebru Ersan , Varol Akman

Enormous explosion in the number of the World Wide Web pages occur every day and since the efficiency of most of the information processing systems is found to be less, the potential of the Internet applications is often underutilized.…

Information Retrieval · Computer Science 2011-09-13 L. Jegatha Deborah , R. Baskaran , A. Kannan

Verbal omissions are complex syntactic phenomena in VP coordination structures. They occur when verbs and (some of) their arguments are omitted from subsequent clauses after being explicitly stated in an initial clause. Recovering these…

Computation and Language · Computer Science 2023-05-29 Royi Rassin , Yoav Goldberg , Reut Tsarfaty

We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and…

cmp-lg · Computer Science 2008-02-03 Claire Gardent , Michael Kohlhase , Noor van Neusen
‹ Prev 1 2 3 10 Next ›