[PDF] Top 20 Unsupervised Name Ambiguity Resolution Using A Generative Model
Has 10000 "Unsupervised Name Ambiguity Resolution Using A Generative Model" found on our website. Below are the top 20 most common "Unsupervised Name Ambiguity Resolution Using A Generative Model".
Unsupervised Name Ambiguity Resolution Using A Generative Model
... Recently, ambiguity resolution for names found on the Web (Artiles et al., 2007), Wikipedia articles (Bunescu and Pasca, 2006), news texts (Pedersen et al., 2005) and medical literature (Ginter et al., ... See full document
8
A generative model for unsupervised discovery of relations and argument classes from clinical texts
... novel unsupervised approach to dis- covering relations in the narrative of electronic med- ical ...a generative model which can simultaneously cluster relation trigger words as well as relation ... See full document
10
Structured Generative Models for Unsupervised Named Entity Clustering
... structured model which defined a notion of consistency between en- tities was that it might allow the construction of an unsupervised alias ...the model, two entities are consistent if they are in ... See full document
9
Unsupervised Coreference Resolution in a Nonparametric Bayesian Model
... Referring to an entity in natural language can broadly be decomposed into two processes. First, speakers directly introduce new entities into dis- course, entities which may be shared across dis- courses. This initial ... See full document
8
Combining Generative and Discriminative Approaches to Unsupervised Dependency Parsing via Dual Decomposition
... tractable generative models jointly and encourages them to agree on certain latent ...joint model can perform better than each independent model on the accuracy or convergence ...combines ... See full document
6
A Hierarchical Distance dependent Bayesian Model for Event Coreference Resolution
... Coreference resolution in general is a difficult natu- ral language processing (NLP) task and typically re- quires sophisticated inferentially-based knowledge- intensive models (Kehler, ...erence resolution ... See full document
12
Unsupervised Text Segmentation Based on Native Language Characteristics
... In terms of possible developments for the mod- els presented for the task here, previous NLI work has shown that other, syntactic features can be useful for capturing L1-based differences. The incorporation of these ... See full document
13
Using a Probabilistic Class Based Lexicon for Lexical Ambiguity Resolution
... The disambiguation method presented in this paper deliberately is restricted to the limited amount of information provided by a proba- bilistic class-based lexicon. This information yet proves itself accurate enough to ... See full document
7
Unsupervised Learning of Field Segmentation Models for Information Extraction
... The applicability of many current information ex- traction techniques is severely limited by the need for supervised training data. We demonstrate that for certain field structured extraction tasks, such as classified ... See full document
8
Chinese Zero Pronoun Resolution: An Unsupervised Probabilistic Model Rivaling Supervised Resolvers
... our generative model to resolve AZPs, the resolution procedure can be improved ...following resolution procedure in our ...incremental resolution procedure may increase the number of ... See full document
12
Language as a Latent Variable: Discrete Generative Models for Sentence Compression
... reconstruction model acts as the reward function evaluating the quality of the compressed sentence which is provided as a reward ...by using additional sequence-level reward (BLEU and Rouge-2) to train the ... See full document
10
Chinese Zero Pronoun Resolution: A Joint Unsupervised Discourse Aware Model Rivaling State of the Art Resolvers
... AZP resolution employed heuristic rules to resolve AZPs in Chinese ...an unsupervised probabilistic model for Chinese AZP resolution that rivaled its supervised counterparts in performance ... See full document
7
Unsupervised Ranking Model for Entity Coreference Resolution
... Several unsupervised learning algorithms have been applied to coreference ...Bayesian model for un- supervised coreference ...this model, Ng (2008) probabilistically induced corefer- ence partitions ... See full document
7
An Unsupervised Alignment Model for Sequence Labeling: Application to Name Transliteration
... 6 name pairs with equal lengths are only ...the name pairs are ...the name pair is included in the training ...means using current ME model to transliterate source name with the ... See full document
9
Integer Ambiguity Resolution Algorithm Based On Different Baseline Method
... H is e m T , 0 , the satellite is not at the top of the reference station. The elevation angle and azimuth angle of the carrier can be better obtained by observing the carrier phase of short baseline. However, when the ... See full document
10
Identification of Speakers in Novels
... A subset of our features correspond to the features that were proposed by EM2010. These are mostly features related to speaker names. For example, since names of speakers are often mentioned in the vicinity of their ... See full document
9
Ambiguity Resolution in the DMTRANS PLUS
... Each hypothesis is assigned a cost which is added when: 1 a new instance is created to satisfy reference success, 2 links between instances are created or removed to sat- isfy constraint[r] ... See full document
8
Ambiguity resolution in a reductionistic parser
... To test whether the addition of clause boundary and functional-syntactic information made morpho- logical disambiguation easier, a finite-state grammar consisting of some 200 syntactic r[r] ... See full document
10
Using a Generative Model for Sentiment Analysis
... a generative model based on the language modeling approach for sentiment ...language model based method is proposed to keep the dependent link between a “term” and other ordinary words in the context ... See full document
20
Name Phylogeny: A Generative Model of String Variation
... Names and words are not the only non-biological objects that are copied with mutation. Documents, database records, bibliographic entries, code, and images can evolve in the same way. Reconstructing these relationships ... See full document
12
Related subjects