Báo cáo khoa học: "A Portable Algorithm for Mapping Bitext Correspondence" pptx

... without an automatic method for construct- ing bitext maps. Bitext maps identify corresponding text units be- tween the two halves of a bitext. The ideal bitext mapping algorithm should be fast ... the bitext space are called chains. Bitext maps are 1-to-1 functions in bitext spaces. A complete set of TPCs for a particular bitext is called a true bitext map (TBM)....

Ngày tải lên: 17/03/2014, 23:20

... Step 2 for Procedure 1 are implemented in each state for (a), (b), (c), (d), (e), and so on. In state (a) for Fig. 4, the index memory's out- put expresses the address range for the ... the worst case time complexity for sequential mor- pheme extraction algorithms is O(MN). On the other hand, the above proposed algorithm (Fukushima's algorithm) has the advant...

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

... Parameter Training Dyna provides facilities for training parameters. For ex- ample, from Fig. 1, it automatically derives the inside- outside (EM) algorithm for training PCFGs. How is this possible? ... used for parsing, syntax-based machine translation, morphological analysis, grammar induction, and finite-state operations. It is well known that various parsing algorithms for CFG...

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

... letters is pre- dicted for each Ugaritic word-form, using Viterbi decoding. Alphabetic Mapping The first essential step to- wards successful decipherment is recovering the mapping between the symbols ... reflexes. By this measure, the baseline recovers correct mappings for 22 out of 30 Ugaritic characters (73.3%). Our model recovers correct mappings for all but one (very low frequency...

Ngày tải lên: 17/03/2014, 00:20

... it still performs well above random chance predictions, which, for the given average of 4 items per ranking, is about 25% for best and worst ranking predictions, and about 8.33% for both. Again, ... single measure by implementing a weighted harmonic mean, for which the weighting factor can be adjusted for optimizing the metric performance. The rest of the paper is organized a...

Ngày tải lên: 17/03/2014, 00: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 ... non-transliterations by N. 3.2 Implementation Details We use the Forward-Backward algorithm to estimate the counts of multigrams. The algorithm has a for- ward variable α and a ba...

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

... a considerable engineer- ing effort, yet there is very limited avail- ability of off-the shelf tools for researchers whose interests are not in coreference, or for researchers who want to concentrate ... standoff format of the MMAX2 annotation tool (M ¨ uller and Strube, 2006) with MiniDiscourse, a library that efficiently imple- ments a subset of MMAX2’s functions. Using a generic format...

Ngày tải lên: 20/02/2014, 09: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. ... dependency ac- curacy. Algorithm 2 depicts the parsing algorithm. 2.2 Correctness and Pipeline Properties We can prove two properties of our algorithm. First we show that the al...

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