Báo cáo khoa học: "Probabilistic disambiguation models for wide-coverage HPSG parsing" pot
Báo cáo khoa học: "Probabilistic disambiguation models for wide-coverage HPSG parsing" pot
... possibility of parsing models for HPSG.
2 Disambiguation models for HPSG
Discriminative log-linear models are now becom-
ing a de facto standard for probabilistic disambigua-
tion models for deep parsing ... basis for the development and
the evaluation of statistical disambiguation models
for wide-coverage HPSG parsing.
The aim of this paper is to report the...
Báo cáo khoa học: "Generalizing Tree Transformations for Inductive Dependency Parsing" potx
... treebanks, making the inverse trans-
formation for PADT more problematic than for the
other treebanks. The absence of a positive effect for
PADT is therefore understandable given the deeply
nested ... Transformations, Parsers, and Treebanks
Pseudo-projective parsing and transformations for
coordination and verb groups are instances of the
same general methodology:
1. Apply a tree tran...
Báo cáo khoa học: "Learning Expressive Models for Word Sense Disambiguation" pot
... 41–48,
Prague, Czech Republic, June 2007.
c
2007 Association for Computational Linguistics
Learning Expressive Models for Word Sense Disambiguation
Lucia Specia
NILC/ICMC
University of São Paulo ... (Res-
nik and Yarowsky, 1997). For example, in machine
translation, WSD, or translation disambiguation, is
responsible for identifying the correct translation
for an ambiguous...
Báo cáo khoa học: "Probabilistic Document Modeling for Syntax Removal in Text Summarization" ppt
... Association for Computational Linguistics:shortpapers, pages 642–647,
Portland, Oregon, June 19-24, 2011.
c
2011 Association for Computational Linguistics
Probabilistic Document Modeling for Syntax ... Nevertheless, for SumBasic to per-
form well, stop-words must be removed from the
composition scoring function. Because these words
add nothing to the content of a summary, if they
wer...
Báo cáo khoa học: "Employing Topic Models for Pattern-based Semantic Class Discovery" doc
... perform preprocess-
ing (refer to Section 3.4 for details) before build-
ing topic models for C
R
(q), where some low-
frequency items are removed.
Determine the number of topics: Most topic
models ... number k. We fix the k value for all dif-
ferent query item q, as has been done for the top-
ic model approach. For fair comparison, the same
postprocessing is made for all th...
Báo cáo khoa học: "Re-Ranking Models For Spoken Language Understanding Marco Dinarelli University of Trento Italy" potx
... hypothesis is given by
C = project
C
(bestpath
1
(λ
SLU
)),
where bestpath
n
(in this case n is 1 for the 1-best
hypothesis) performs a Viterbi search on the FST
203
and outputs the n-best hypotheses ... hypotheses. This means that
re-ranking the m-best hypotheses in a convenient
way could improve the SLU performance. The
best choice in this case is a discriminative model,
since it allows...
Báo cáo khoa học: "Rule Markov Models for Fast Tree-to-String Translation" pot
... Meeting of the Association for Computational Linguistics, pages 856–864,
Portland, Oregon, June 19-24, 2011.
c
2011 Association for Computational Linguistics
Rule Markov Models for Fast Tree-to-String ... performance of vertically composed
rules at various settings. Here we have chosen the
setting that gives the best performance on the test
set for inclusion in Table 1.
Table 6 sho...
Báo cáo khoa học: "Flow Network Models for Word Alignment and Terminology Extraction from Bilingual Corpora" docx
... 1993), for example, allow to take
this fact into account.
We can envisage more complex models, in-
cluding distortion parameters, multiword no-
tions, or information on part-of-speech, infor- ... can simplify the above formula and write:
le+l 1
P(a,e,,f,)= ]-I p(ei,f~ilal
)i-1 (5)
i=1
where a~ -1 is a shorthand for
(al, ,ai-1).
p(ei, f~,)
is a shorthand for
p(a~(ei)
= f~,...
Báo cáo khoa học: "Latent Variable Models for Semantic Orientations of Phrases" pdf
... (z|n) =
ac
f
nac
¯
P (z|nac)
ac
f
nac
. (13)
For classification, we use the formula :
P (c|na) =
z
P (c|az)P (z|n). (14)
3.3 Other Models for Comparison
We will also test the 3-PLSI model ... the clusters that are suitable for our task,
by incorporating the new variable c for semantic
orientation in the EM computation.
5 Conclusion
We proposed models for phrases with semant...
Báo cáo khoa học: "Smaller Alignment Models for Better Translations: Unsupervised Word Alignment with the 0" potx
... the Association for Computational Linguistics, pages 311–319,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
Smaller Alignment Models for Better Translations:
Unsupervised ... d, but the differences do not concern us
here. All three models, as well as IBM Models 3–5,
share the same t. For further details of these models,
the reader is...
Từ khóa: