Tài liệu Báo cáo khoa học: "A Modular Toolkit for Coreference Resolution" pdf

... present BART, a highly modular toolkit for de- veloping coreference applications. In the Johns Hopkins workshop on using lexical and encyclopedic knowledge for entity dis- ambiguation, the toolkit was used ... the use of coreference information in summa- rization or question answering techniques is not as widespread as it could be. We believe that the avail- ability of a modula...

Ngày tải lên: 20/02/2014, 09:20

... 352–359, Prague, Czech Republic, June 2007. c 2007 Association for Computational Linguistics Conditional Modality Fusion for Coreference Resolution Jacob Eisenstein and Randall Davis Computer ... modality fusion, which formalizes this intuition by treating the informativeness of gesture as a hidden variable to be learned jointly with the class label. Applied to coreference resolution...

Ngày tải lên: 20/02/2014, 12:20

... satisfiability problem for CNF formulas of propositional logic can be reduced to the consistency (or satisfia- bility) problem for formulas in FML. Thus, the consistency problem for formulas in FML ... Greek alpha- bet axe used to stand for arbitrary formulas in FML. The formulas NIL and TOP axe intended to convey gno information z and ~inconsistent in- formation s respect...

Ngày tải lên: 21/02/2014, 20:20

... incu- bated for 4 days with each of the peptides (10 lm), and cells were fixed and used for immunocytochemical analyses. Immunocytochemistry Neurons were fixed in 4% paraformaldehyde for 20 min at ... to transformed Ca 2+ -competent E. coli cells (ER2566) by heat shock. The transformed cells were spread on LB agar plates containing ampicillin (50 mgÆL )1 ), single colonies were picked fo...

Ngày tải lên: 18/02/2014, 13:20

... labelled information for training. Our sys- tem extracts transliteration pairs in an unsupervised fashion. It is also able to utilize labelled information if available, obtaining improved performance. We ... of the Association for Computational Linguistics, pages 469–477, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics A Statistical Model for...

Ngày tải lên: 19/02/2014, 19:20

... p null = 10 −10 for this value in the experiments we report below. 784 either φ P z i for phrase pairs or φ null for single lan- guage phrases. We choose Dirichlet process (DP) priors for these parameters: φ P z i ∼ ... proce- dure for each sentence pair is non-trivial, prov- ing NP-complete for learning phrase based models (DeNero and Klein, 2008) or a high order poly- nomial (O(...

Ngày tải lên: 20/02/2014, 07:20

... allows that use of future information in ad- dition to past information. The pipeline model nat- urally allows access to all the past information. Algorithm 3 Pseudo code for the look ahead algo- rithm. ... rightmost S action taken before a non-S action happens. Note that it is possible that there is a relation between a and b, but we can- not perform R or L now. Therefore, we should consid...

Ngày tải lên: 20/02/2014, 12:20

... general information about the system’s components, a description and time- stamp for each system event and user event, names and timestamps for the system-recorded sound files, and timestamps for ... Open-ended tasks prompted users to search for any type of information with any input modality. The tasks in the two sets paralleled each other. For example, if one set of tasks as...

Ngày tải lên: 20/02/2014, 12:20

... only for N’s small enough to yield non-zero P(n) scores. For test corpora of reasonable size, the metrics are usually well-defined for N≤4. The BLEU proposed by Papineni et al. (2002) for ... recall scores for increasingly longer n-grams. For test corpora of reasonable size, the metrics are usually well- defined for N≤4. The ROUGE metric proposed by Lin and Hovy (2003)...

Ngày tải lên: 20/02/2014, 16:20

... methods, using the Toolkit for Advanced Opti- mization (Benson et al., 2000) together with a softmax 6 DynaMITE = Dyna Module for Iterative Training and Estimation. technique to enforce sum-to-one ... probabilities, which permits heuristic early stopping before the agenda is empty. With viterbi values, it amounts to uniform-cost search for the best parse, and an item’s value is guaran...

Ngày tải lên: 20/02/2014, 16:20