Báo cáo khoa học: "An Endogeneous Corpus-Based Method for Structural Noun Phrase Disambiguation" pptx

... no-disambiguation for the ten most frequent ambiguous structures are shown in Table 1. (1) noun prep noun adj noun prep noun prep det noun noun adj noun noun prep noun noun noun prep noun prep noun noun ... noun prep noun noun noun prep noun prep noun noun noun adj noun noun noun noun noun prep noun noun prep noun prep noun adj noun prep noun adj adj (2) 573 331 294 260 241 193 160 ... noun2 # noun, ? adj nounl prep noun2 detected nounl prep noun2 not detected number of occurrences : 52 number of occurrences : 81 noun2 prep noun3 noun2 prep noun3 noun2 prep noun3 detected...

Báo cáo khoa học: "An Exact A* Method for Deciphering Letter-Substitution Ciphers" doc

... G(i−2, j2, k)× P (j1|j2) × P(l|j2j1)).end for end for for i = 4 to r do for (l, k) such that σ ∪ {k : c, l : Ci} is con-sistent do for j1, j2such that σ ∪ {k : c, j2:C[i−2], ... G to 0.i = 1 for All (l, k) such that σ ∪ {k : c, l : Ci} isconsistent doG(i, l, k) = P (l).end for i = 2 for All (l, k) such that σ ∪ {k : c, l : Ci} isconsistent do for j such that ... doG(i, l, k) = max(G(i, l, k), G(0, j, k) ×P (l|j))end for end for i = 3 for (l, k) such that σ ∪ {k : c, l : Ci} is consis-tent do for j1, j2such that σ∪{k : c, j2: C[i−2], j1:C[i...

Tài liệu Báo cáo khoa học: "A Kernel PCA Method for Superior Word Sense Disambiguation" ppt

... Empirical Methods in Nat-ural Language Processing, pages 9–16, Philadel-phia, July 2002. SIGDAT, Association for Com-putational Linguistics.Taku Kudo and Yuji Matsumoto. Fast methods for kernel-based ... this, we describe a full model for WSDbuilt on KPCA. We then discuss experimental re-sults conﬁrming that this model outperforms state-of-the-art published models for Senseval-relatedlexical ... nonlinear transform obtained via KPCA as de-scribed below.Similarly, for the test vector x9, Table 4 shows theﬁrst three dimensions of the principal componentvectors obtained by transforming it...

Tài liệu Báo cáo khoa học: "A Pattern Matching Method for Finding Noun and Proper Noun Translations from Noisy Parallel Corpora" doc

... pattern matching method for compiling a bilingual lexicon of nouns and proper nouns from unaligned, noisy paral- lel texts of Asian/Indo-European language pairs. Tagging information of one ... terms are nouns, proper nouns or noun phrases, compiling a bilingual lexicon of these word groups is an impor- tant first step. We have been studying robust lexicon compilation methods which ... guage is used. Word frequency and posi- tion information for high and low frequency words are represented in two different vec- tor forms for pattern matching. New an- chor point finding...

Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx

... BLEU4. For the phrase- based system, phrases are of at most 7 words on either source or target-side. For the hierarchical phrase- based system, all SCFG rules have at most two variables. For the ... the toolkit. 3.1 Phrase Extraction and Reordering Model We use a standard way to implement the phrase extraction module for the phrase- based model. That is, we extract all phrase- pairs that ... first extracts a phrase table and two reordering models for the phrase- based system, or a Synchronous Context-free/Tree-substitution Grammar (SCFG/STSG) for the hierarchical phrase- based and...

Tài liệu Báo cáo khoa học: "An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming" pdf

... mjrepresents the jth mention (e.g., m6 for the pronoun“he”). ei jrepresents the partial entity i before thejth mention. For example, e1 6denotes the part ofe1before m6, i.e., {“Microsoft Corp.”, ... is a bare noun phrase with the same head string as B, and matchesin number with B. In this way, the detailed informa-tion of each individual mention in an entity can becaptured for resolution.A ... negative training in-stances is created for every intervening mentionsbetween mjand the antecedent. Consider the ex-ample text in Table 1, for the pronoun “he”, threeinstances are generated:...

Tài liệu Báo cáo khoa học: "An Equivalent Pseudoword Solution to Chinese Word Sense Disambiguation" ppt

... not enough for the WSD model-ing. The lack of training information leads to a low performance of the supervised methods. 3) With a large-scale training corpus, the un-supervised WSD method has ... mathematical modeling methods can be applied to EP-based WSD methods. This section focuses on the application of the EP concept to WSD, and chooses Bayesian method for the classifier construction. ... the EP-based WSD The EP-based unsupervised method takes the same open test set as the supervised method. The unsupervised method shows a better performance, with the highest F-measure score...

Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx

... satisfying: • CS(N) + C_ CS(N), for each N; • (N, L) • CS(N), for each N such that N <~* l, and each L • Af*; • N • CS(N), for each N such that -~(N<~*l); and • for each N, children(N) ... needed for construction of parse trees (or "derived trees" as they are often called for TAGs) and the computation of features are al- most identical to the corresponding extensions for ... tree. Formally, items are completed if they are of the form [t,T ~ Rt •] or of the form [(t,N),N -+ a •]. The main concept needed for the construction of the LR table is that of LR states....

Tài liệu Báo cáo khoa học: "An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines" docx

... i := O; forall z E F do create uarae-concat¢~atoT'-Rmb age~| J~f i; N, ~= s*lve(x); i := i + 1; forellend for j := 0 to i do R := R U (Wait-lor-result(J~fj)); forend return ... need for real-time NLP systems has been discussed for the last decade. The difficulty in implementing such a system is that people can not use sophisticated but computationally ex- pensive methodologies. ... parallel system for processing Typed Feature Structures (TFSs) on shared-memory parallel machines. We call the system Parallel Substrate for TFS (PSTFS}. PSTFS is designed for parallel computing...

Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx

... within them. In cases where one phrase has more skipped words than the other, the phrase with more skipped words is discarded in favor of the more complete parsed phrase. This operation significantly ... fea- tures are designed to be general and, for the most part, grammar and domain independent. For each parse, the heuristic computes a penalty score for each of the fea- tures. The penalties ... AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION Alon Lavie School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh, PA 15213 email :...

Xem thêm