Báo cáo khoa học: "Structured Models for Fine-to-Coarse Sentiment Analysis" pdf
Báo cáo khoa học: "Structured Models for Fine-to-Coarse Sentiment Analysis" pdf
... 432–439,
Prague, Czech Republic, June 2007.
c
2007 Association for Computational Linguistics
Structured Models for Fine-to-Coarse Sentiment Analysis
Ryan McDonald
∗
Kerry Hannan Tyler Neylon Mike ... to
determine the sentiment flow of authors in reviews.
Here we show that fine-to-coarse models of senti-
ment can often be reduced to the sequential case.
Cascaded models for fine...
Tài liệu Báo cáo khoa học: "Topic Models for Dynamic Translation Model Adaptation" pptx
... Meeting of the Association for Computational Linguistics, pages 115–119,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
Topic Models for Dynamic Translation ... unseen for a given domain s, we are already
performing an implicit form of smoothing (when
computing the expected counts), since each docu-
ment has a distribution over all topics,...
Báo cáo khoa học: "Distortion Models For Statistical Machine Translation" doc
... for the experiments reported here is the same
as the one used for other experiments reported in this
paper.
The results in Table 3 illustrate how the language
model performs reasonably well for ... search-
ing for the optimal solution among all possible permu-
tations computationally intractable. Therefore, SMT
decoders typically limit the number of permutations
considered for effici...
Tài liệu Báo cáo khoa học: "Discriminative Pruning for Discriminative ITG Alignment" pdf
... of the Association for Computational Linguistics, pages 316–324,
Uppsala, Sweden, 11-16 July 2010.
c
2010 Association for Computational Linguistics
Discriminative Pruning for Discriminative ...
ITG. For instance, there are two parses for three
consecutive word pairs, viz. [/ [/ /
] ] and [[/ /] /] . The problem of re-
dundancy is fixed by adopting ITG normal for...
Báo cáo khoa học: "CONCEPTUAL ASSOCIATION FOR COMPOUND NOUN ANALYSIS" ppt
...
bracketing for a given noun sequence, known to form a
compound noun, without knowledge of the context.
E.G.:
(pottery (coffee mug)); ((coffee mug) holder)
Corpus Statistics: The need for wide ...
ordered pair of thesaurus categories (ti, t2) using the
formula below. CA(t1, t2) is the mutual information
between the categories, weighted for ambiguity. It
measures the degree to wh...
Tài liệu Báo cáo khoa học: "Lexicographic Semirings for Exact Automata Encoding of Sequence Models" pdf
... tasks. We
prove that the semiring allows for exact en-
coding of backoff models with epsilon tran-
sitions. This allows for off-line optimization
of exact models represented as large weighted
finite-state ... con-
vert those models to the T, T semiring. For these
automata, we simply use a default transformation
such that every transition with weight c is assigned
weight 0, c....
Tài liệu Báo cáo khoa học: "Improved Smoothing for N-gram Language Models Based on Ordinary Counts" doc
... known method
for estimating N-gram language models.
Kneser-Ney smoothing, however, requires
nonstandard N-gram counts for the lower-
order models used to smooth the highest-
order model. For some ... 1998), and they
use a different way of computing N-gram counts
for all the lower-order models used for smooth-
ing. For these lower-order models, the actual cor-
pus counts C(w...
Báo cáo khoa học: "Minimized models and grammar-informed initialization for supertagging with highly ambiguous lexicons" pdf
... Association for Computational Linguistics, pages 495–503,
Uppsala, Sweden, 11-16 July 2010.
c
2010 Association for Computational Linguistics
Minimized models and grammar-informed initialization
for ... uniform transition distributions.
We refer to a model learned from basic EM (uni-
formly initialized) as EM, and to a model with
grammar-informed initialization as EM
GI
.
4 Minimized...
Báo cáo khoa học: "Generalized Algorithms for Constructing Statistical Language Models" pdf
... finding all
for a given is . Therefore,
the total cost is .
For all non-empty , we create a new state and
for all we set . We create a transition
, and for all such that ,
we set . For all such ... with other in-
formation sources to rank alternative hypotheses by as-
signing them some probabilities. There are classical
techniques for constructing language models such as
-
gram...
Báo cáo khoa học: "Medical treatment for the terminally ill: the ‘risk of unacceptable badness’"
... the patient has options for
‘survival’ that they did not have before, even though they
are dependent on ‘life support’. There are now variables
Commentary
Medical treatment for the terminally ill: ... to
accept the pie in the sky bye and bye long shot cure’. If the
patient can just be maintained comfortably for long enough,
then a cure may eventually become possible.
3. Surrogates disli...