English
Related papers

Related papers: Some Properties of Preposition and Subordinate Con…

200 papers

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

We present several unsupervised statistical models for the prepositional phrase attachment task that approach the accuracy of the best supervised methods for this task. Our unsupervised approach uses a heuristic based on attachment…

cmp-lg · Computer Science 2007-05-23 Adwait Ratnaparkhi

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

While dependency parsers reach very high overall accuracy, some dependency relations are much harder than others. In particular, dependency parsers perform poorly in coordination construction (i.e., correctly attaching the "conj" relation).…

Computation and Language · Computer Science 2017-02-23 Jessica Ficler , Yoav Goldberg

We propose and study a novel supervised approach to learning statistical semantic relatedness models from subjectively annotated training examples. The proposed semantic model consists of parameterized co-occurrence statistics associated…

Computation and Language · Computer Science 2013-11-12 Ran El-Yaniv , David Yanay

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

This paper describes research toward the automatic interpretation of compound nouns using corpus statistics. An initial study aimed at syntactic disambiguation is presented. The approach presented bases associations upon thesaurus…

cmp-lg · Computer Science 2008-02-03 Mark Lauer

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

Prepositions are among the most frequent words in English and play complex roles in the syntax and semantics of sentences. Not surprisingly, they pose well-known difficulties in automatic processing of sentences (prepositional attachment…

Computation and Language · Computer Science 2018-05-25 Hongyu Gong , Suma Bhat , Pramod Viswanath

Type-level word embeddings use the same set of parameters to represent all instances of a word regardless of its context, ignoring the inherent lexical ambiguity in language. Instead, we embed semantic concepts (or synsets) as defined in…

Computation and Language · Computer Science 2017-05-09 Pradeep Dasigi , Waleed Ammar , Chris Dyer , Eduard Hovy

Compound nouns such as example noun compound are becoming more common in natural language and pose a number of difficult problems for NLP systems, notably increasing the complexity of parsing. In this paper we develop a probabilistic model…

cmp-lg · Computer Science 2008-02-03 Mark Lauer , Mark Dras

We show how to predict the basic word-order facts of a novel language given only a corpus of part-of-speech (POS) sequences. We predict how often direct objects follow their verbs, how often adjectives follow their nouns, and in general the…

Computation and Language · Computer Science 2017-10-12 Dingquan Wang , Jason Eisner

Recognizing shallow linguistic patterns, such as basic syntactic relationships between words, is a common task in applied natural language and text processing. The common practice for approaching this task is by tedious manual definition of…

cmp-lg · Computer Science 2007-05-23 Shlomo Argamon , Ido Dagan , Yuval Krymolowski

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

A variety of statistical methods for noun compound analysis are implemented and compared. The results support two main conclusions. First, the use of conceptual association not only enables a broad coverage, but also improves the accuracy.…

cmp-lg · Computer Science 2008-02-03 Mark Lauer

Grammatical relationships are an important level of natural language processing. We present a trainable approach to find these relationships through transformation sequences and error-driven learning. Our approach finds grammatical…

Computation and Language · Computer Science 2007-05-23 Lisa Ferro , Marc Vilain , Alexander Yeh

A novel approach to the fully automated, unsupervised extraction of dependency grammars and associated syntax-to-semantic-relationship mappings from large text corpora is described. The suggested approach builds on the authors' prior work…

Computation and Language · Computer Science 2014-01-16 Linas Vepstas , Ben Goertzel

Word embeddings are a fixed, distributional representation of the context of words in a corpus learned from word co-occurrences. While word embeddings have proven to have many practical uses in natural language processing tasks, they…

Computation and Language · Computer Science 2020-10-02 James Powell , Kari Sentz

How do typological properties such as word order and morphological case marking affect the ability of neural sequence models to acquire the syntax of a language? Cross-linguistic comparisons of RNNs' syntactic performance (e.g., on…

Computation and Language · Computer Science 2019-03-28 Shauli Ravfogel , Yoav Goldberg , Tal Linzen

LSTM language models have been shown to capture syntax-sensitive grammatical dependencies such as subject-verb agreement with a high degree of accuracy (Linzen et al., 2016, inter alia). However, questions remain regarding whether they do…

Computation and Language · Computer Science 2020-05-04 Yiding Hao
‹ Prev 1 2 3 10 Next ›