Báo cáo khoa học: "An Exact A* Method for Deciphering Letter-Substitution Ciphers" doc
Báo cáo khoa học: "An Exact A* Method for Deciphering Letter-Substitution Ciphers" doc
... Association for Computational Linguistics, pages 1040–1047,
Uppsala, Sweden, 11-16 July 2010.
c
2010 Association for Computational Linguistics
An Exact A* Method for Deciphering Letter-Substitution ... G(i−2, j
2
, k)
× P (j
1
|j
2
) × P(l|j
2
j
1
)).
end for
end for
for i = 4 to r do
for (l, k) such that σ ∪ {k : c, l : C
i
} is con-
sistent do
for j
1
, j
2
such tha...
Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx
... 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
: ... tree...
Báo cáo khoa học: " An NLP Tool Suite for Processing Word Lattices" docx
... annotation format. Moreover,
the MACAON exchange format was defined from the
bottom up, originating from the authors’ need to use
several existing tools and adapt their input/output
formats in order for ... the
MACAON exchange format. htk2macaon
and fsm2macaon convert word lattices from
the HTK format (Young, 1994) and ATT
FSM format (Mohri et al., 2000) to the
MACAON exchange format. macaon...
Báo cáo khoa học: "An Ontology–Based Approach for Key Phrase Extraction" docx
...
methodology for key phrase extraction. This
method combines a pattern-based method and a
statistical learning method. Both methods will
complement each other to increase the expected
performance ... of
c.
Although we utilize information from Wikipedia
to build the ViDic, our method can be adapted
for an ontology or knowledge base in general.
5 Proposed method
We consider...
Báo cáo khoa học: "PREDICTIVE COMBINATORS A METHOD PROCESSING OF COMBINATORY CATEGORIAL GRAMMARS" doc
... be
uniformly left-branching. For cases of rightward extraction
(8b), derivations will be uniformly right-branching. It is our
conjecture that CCGs can be compiled so as to force uniform
branching ... n 7 for Head Grammars.
piling a predictive form of CCGs, given a base form along
the lines of Steedman (1985), has been implemented for
CCGs expressed in a PATR-like unification gram...
Báo cáo khoa học: "An efficient algorithm for building a distributional thesaurus (and other Sketch Engine developments)" pdf
... each context
(CONTEXTS is the set of all contexts):
for r, w
′
in CONTEXTS:
WLIST = set of all w where w, r, w
′
exists
for w
1
in WLIST:
for w
2
in WLIST:
sim(w
1
, w
2
)+ = f(frequencies)
1
The ... above the thresh-
old
2
http://www.natcorp.ox.ac.uk
3
http://www.askoxford.com/oec/ We are grateful to Oxford
University Press for permission to use the OEC.
42
Corp MIN WDS TYP CTX...
Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx
... Association for Computational Linguistics, pages 19–24,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
NiuTrans: An Open Source Toolkit for
Phrase-based ... of
minimum error rate training that allows for various
evaluation metrics for tuning the system. In
addition, the toolkit provides easy-to-use APIs for
the development of new fe...
Tài liệu Báo cáo khoa học: "An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming" pdf
... learning
algorithm. During resolution, an input document is
processed from the first mention to the last. For each
encountered mention m
j
, a test instance is formed
for each preceding mention, m
k
. This ... Eq. (2) per-
forms coreference resolution at an entity-level. For
simplicity, the framework considered for the entity-
mention model adopts similar training and testing
procedure...
Tài liệu Báo cáo khoa học: "An Empirical Investigation of Proposals in Collaborative Dialogues" docx
... adaptations
for our corpus and research issues. For details about
our scheme, see (Di Eugenio et al., 1997); for details
about features we added to DR/, but that are not
relevant for this paper, ... Kappas for Forward and Backward Func-
tions
exist to the set of constraint equations, each varl in
the set of equations must have a solution. For exam-
ple, if 5 instances of so...
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) ... (unique) Xj
(1 _< j _< m) which is of the form (M, [NIL]),
2Exactly in the case that N dominates a footnote will
(exactly) one of the Xj be of the form (M, L), some M.
and se...