Báo cáo khoa học: "Efficient Search for Transformation-based Inference" pot

... way: instead of searching for a com- plete sequence of transformations that transform t T into t H , we can iteratively search for independent co- herent subsequences of transformations, such ... the major research approaches in this direction. We fo- cus on methods that perform transformations over parse trees, and highlight the search challenge with which they are faced. 2.1 Transf...

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

... λ(y n ) and ¯ λ(y n ) by using the forward and backward Viterbi algorithm, respec- tively. In the search step immediately following initialization, we perform the forward Viterbi al- gorithm to find ... is performed and the best path is searched again. Notice that the active label in the first column is not expanded. (c) The final result. memory space to perform Viterbi decoding in the search...

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

... curve. Maximal F 1 on the curve is .43 for Exact-graph, .41 for TNF, and .34 for No-trans. AUC in the recall range 0-0.5 is .32 for Exact-graph, .31 for TNF, and .26 for No-trans. Run-time of LP-relax ... Fig- ure 1a and is a directed forest. We say a graph is a forest-reducible graph (FRG) if all nodes in its re- duced form have no more than one parent. We now hypothesize that en...

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

... calculated separately for each u in sequence. Allauzen et al. (2010) introduce a transducer for simultaneous calculation of p(u|E) for all un- igrams u ∈ N 1 in a lattice. This transducer is effective for finding ... Speed and Performance Lattice MBR decoding performance is shown in Table 1. Compared to the maximum likelihood translation hypotheses (row ML), LMBR gives gains of +0.8 to...

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

... competitive perfor- mance relative to phrase-based SMT. For these systems, a hypergraph or packed forest provides a compact representation for encoding a huge num- ber of translation hypotheses (Huang, ... 1.0 for the aren-phrase, aren-hier, aren-samt, zhen-phrase zhen-hier and zhen-samt systems re- spectively. For the multi-language case, we train phrase-based systems and perform lat...

Ngày tải lên: 23/03/2014, 16:21

... n-grams will provide as valuable a search heuristic as they do for speech recognition. Second, we explore heuristics for agenda-based search, and present a heuristic for our second pass that combines ... 23.47 Table 1: Speed and BLEU scores for two-pass decoding. UNI stands for the uniform (zero) outside estimate. BO stands for the bigram outside cost estimate. BB stands for...

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

... Sparse model. For the hyper parameter , we empir- ically selected 0.001 for Method 1 (this preserves 99% of probability density), 0 for Method 2, and 4 for Meth- ods 3 and 4. Note that  for Methods ... 91.92 (ours). Our method performs 5∼50 times faster for training (1,774 s for MALLET, 18,134 s for CRF++, 7 Ver. 2.0 RC3, http://mallet.cs.umass.edu/ 8 Ver. 0.51, http://crfpp...

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

... described in (C) and then analysed by flow cytometry for propidium iodide (PI) and FITC uptake, the results shown are for the cells that are positive for both PI and FITC uptake. (E) Cells of the fibroblastic ... survival and proliferation, including those for Bcl-xl, Bcl-2, c-Myc, cyclin D1, survivin, Mcl-1, vascu- lar endothelial growth factor, IL-10 and transforming growth factor b [...

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

... 7.5) buffer, hea- ted at 90 °C for 1 min and incubated at 37 °C for 15 min. Reactions were started by addition of MgCl 2 and spermine, portions of which were placed before on the Eppendorf tube wall ... buffer, heated at 90 °C for 1 min followed by incubation at 37 °C for 15 min. The second ligation substrate S17F5 cp was added and the mixture was incubated at 37 °C for another 10 m...

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

... called Reser- voir Counting for application in online Local- ity Sensitive Hashing. This technique allows for significant savings in the streaming setting, allowing for maintaining a larger number ... 49th Annual Meeting of the Association for Computational Linguistics:shortpapers, pages 18–23, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Effic...

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