[PDF] Top 20 A Class based Probabilistic approach to Structural Disambiguation
Has 10000 "A Class based Probabilistic approach to Structural Disambiguation" found on our website. Below are the top 20 most common "A Class based Probabilistic approach to Structural Disambiguation".
A Class based Probabilistic approach to Structural Disambiguation
... Knowledge of which words are able to ll partic- ular argument slots of a predicate can be used for structural disambiguation. This paper de- scribes a proposal for acquiring such knowledge, and in line with ... See full document
7
A Novel Disambiguation Method for Unification Based Grammars Using Probabilistic Context Free Approximations
... The approximation method can be seen as the construction of the least fixpoint of a certain mono- tonic function and shares similarities with the in- stantiation of rules in a bottom-up passive chart parser or with ... See full document
7
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 ...The probabilistic ... See full document
7
A Probabilistic Approach to Damage Localization in Structural Health Monitoring.
... has been introduced. In their work, they focused on applying statistical process control methods referred to as “control charts” to vibration-based damage detection. First, an auto regressive (AR) model was fit to ... See full document
103
Structural Disambiguation Based on Reliable Estimation of Strength of Association
... We proposed a class-based method that selects classes to be used to estimate the strength of association for word co-occurrences.. The classes selected by our method can be used to estim[r] ... See full document
7
Probabilistic Coordination Disambiguation in a Fully Lexicalized Japanese Parser
... A number of machine learning-based approaches to Japanese parsing have been developed. Among them, the best parsers are the SVM-based depen- dency analyzers (Kudo and Matsumoto, 2002; Sas- sano, 2004). In ... See full document
9
An Empirical Study on Class Based Word Sense Disambiguation
... 2007) are small sets of meanings representing the whole nominal and verbal part of WN. BLC can be obtained by a very simple method that uses ba- sic structural WN properties. In fact, the algorithm only considers ... See full document
9
Dependency Analyzer: A Knowledge Based Approach to Structural Disambiguation
... Dependency Analyzer A Knowledge Based Approach to Structural Disambiguation Dependency Analyzer A Knowledge Based Approach to Structural Disambiguation K a t a s h i N a g a o I B M R e s e a r c h ,[.] ... See full document
6
ENHANCE INTRUSION DETECTION CAPABILITIES VIA WEIGHTED CHI SQUARE, DISCRETIZATION AND SVM
... (KNN) approach with a probabilistic method for the prediction of stock price ...This approach excludes the non-centric data points which can be statistically significant in the problem of predicting ... See full document
11
A Simple Approach to Building Ensembles of Naive Bayesian Classifiers for Word Sense Disambiguation
... Abstract This paper presents a corpus-based approach to word sense disambiguation that builds an ensemble of Naive Bayesian classifiers, each of which is based on lexical features that r[r] ... See full document
7
Structural Semantic Relatedness: A Knowledge Based Method to Named Entity Disambiguation
... entity disambiguation by developing algorithms which can exploit these knowledge sources at ...called Structural Semantic Relatedness (SSR), which can en- hance the named entity disambiguation by ... See full document
10
A Contribution for a Pragmatics-Based Approach to Concurrent Engineering Implementation
... iii) While it is evident that use of advanced computer technologies contributes to a reduction of the throughput time of CE implementation processes, providing more efficiency and speed in the processes, the role of ... See full document
12
Probabilistic Disambiguation Models for Wide Coverage HPSG Parsing
... Figure 1 shows a chart for parsing “he saw a girl with a telescope”, where the modifiee (“saw” or “girl”) of “with” is ambiguous. Each feature structure expresses an equivalence class, and the ar- rows represent ... See full document
8
A Concept based Adaptive Approach to Word Sense Disambiguation
... For instance, Figure 1 shows the initial contextual representation CR extracted from the Longrnan Dictionary of Contemporary English Protor 1978, LDOCE for the GEO-bank sense contained b[r] ... See full document
7
A Rule Based Approach to Prepositional Phrase Attachment Disambiguation
... A Rule Based Approach to Prepositional Phrase Attachment Disambiguation A R u l e B a s e d A p p r o a c h to P r e p o s i t i o n a l P h r a s e A t t a c h m e n t D i s a m b i g u a t i o n Eri[.] ... See full document
7
Unsupervised Sense Disambiguation Using Bilingual Probabilistic Models
... for disambiguation and automatic sense ...sense disambiguation results which demonstrate the gain brought by this probabilistic approach, even while only using the translated word to provide ... See full document
8
A Probabilistic Context free Grammar for Disambiguation in Morphological Parsing
... Since the pronunciation of a word does not always consists of the concatenation of the pronunciation of the morphemes, because the pronunciation of mor- phemes can be modified in certain[r] ... See full document
10
Word Sense Disambiguation of Adjectives Using Probabilistic Networks
... wsd dvi Word Sense Disambiguation of Adjectives Using Probabilistic Networks Gerald Chao and Michael G Dyer Computer Science Department, University of California, Los Angeles Los Angeles, California 9[.] ... See full document
7
Computational Complexity of Probabilistic Disambiguation by means of Tree Grammars
... Computational Complexity of Probabilistic Disambiguation by means of Tree Grammars C o m p u t a t i o n a l C o m p l e x i t y o f P r o b a b i l i s t i c D i s a m b i g u a t i o n by m e a n s[.] ... See full document
6
Relating Probabilistic Grammars and Automata
... In this paper, we show that probabilistic contextfree grammars PCFGs and probabilistic pushdown automata PPDAs define the same class of distributions on strings, thus extending the class[r] ... See full document
8
Related subjects