Tài liệu Báo cáo khoa học: "An Algorithm for Simultaneously

Tài liệu Báo cáo khoa học: "An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words" ppt

... An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words Dekai Wu HKUST Department of Computer Science University ... serve as generative models for parallel bilingual sentences with weak order constraints. Focusing on Wans- duction grammars for bracketing, we formu- late a normal form, and a stochastic version ... paper is that the lexical i...

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

8
382
0

Tài liệu Báo cáo khoa học: "AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES" pptx

... memory. The algorithm is given no information whatsoever about the phonemic transcription .used, and even though cognate identification is carried out on the basis of a context-free one -for- one ... corresponding to z scores of 4 and beyond. The last improvement in the performance of the algorithm to date was brought by a redefinition of the cognatlon index. Once the individ...

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

4
422
0

Tài liệu Báo cáo khoa học: "An Empirical Investigation of Discounting in Cross-Domain Language Models" ppt

... slightly by having indepen- dent parameters for 1-count, 2-count, and many- count n-grams, but still assumes that ¯ d(i) is constant for i greater than two. Second, by using the same discount for ... for a given n-gram count is well-approximated by its mean. For similar corpora, this seems to be true, with a histogram of test counts for trigrams of count 10 that is nearly...

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

6
444
0

Tài liệu Báo cáo khoa học: "An API for Measuring the Relatedness of Words in Wikipedia" docx

... lexical resources transform these resources into a network or graph and compute relatedness using paths in it (see Budanitsky & Hirst (2006) for an ex- tensive review). For instance, Rada et ... relatedness scores. The information ﬂow of the API is summarized by the sequence diagram in Figure 2. The higher in- put/output layer the user interacts with is provided by a Java API from...

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

4
546
1

Tài liệu Báo cáo khoa học: "Hypertext Authoring for Linking Relevant Segments of Related Instruction Manuals" pptx

... following, cw is calculated for each noun. On the other hand, cw' is calculated for each combination of noun and its case information. Therefore, cw I is calculated for each ( noun, case ... access is realized by linking them in hypertext for- mat by hypertext authoring. Automatic hypertext authoring has been focused on in these years, and much work has been done....

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

5
396
0

Báo cáo khoa học: "AN ALGORITHM FOR FINDING NOUN PHRASE CORRESPONDENCES IN BILINGUAL CORPORA" pptx

... correspondences for English "source" phrases. The algorithm is re- versible, by swapping E with F. The model for correspondence is that a source noun phrase in Ei is responsible for producing ... phrases for both languages. Noun phrases are then mapped to each other using an iterative re-estimation algorithm that bears similarities to the Baum-Welch algorithm w...

Ngày tải lên : 31/03/2014, 06:20

6
327
0

Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspeciﬁed Representations" pdf

... dominance graph by checking each split for eliminability before it is added to the chart. We compare the performance of this algorithm to the baseline of computing the complete chart. For comparison, ... this algorithm by keep- ing track of how often each subgraph is referenced 413 every z D x,y,z a y a x 1 2 3 A x B y C z 4 5 6 7 Figure 4: A graph for which the algorithm is n...

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

8
429
0

Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx

... alternative LR algorithm for TAGs Mark-Jan Nederhof DFKI Stuhlsatzenhausweg 3 D-66123 Saarbr/icken, Germany E-marl: nederhof@dfki.de Abstract We present a new LR algorithm for tree- adjoining ... difficulties, the algorithm as it was published is also incorrect. Brief indications of the nature of the incorrectness have been given before by Kinyon (1997). There seems to...

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

7
413
0

Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt

... An Efficient Generation Algorithm for Lexicalist MT Victor Poznafiski, John L. Beaven &: Pete Whitelock * SHARP Laboratories of Europe Ltd. Oxford Science Park, Oxford OX4 4GA United Kingdom ... Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP- complete. We present a polynomial time algorithm for lexicalist MT generation provided that sufficient information...

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

7
410
0

Tài liệu Báo cáo khoa học: "An Alignment Algorithm using Belief Propagation and a Structure-Based Distortion Model" pdf

... pre- cision will be overestimated. For the BP/EM training, we used 10 BP iter- ations for each sentences, and 5 global EM iter- ations. By using a damping scheme for the BP algorithm, we never observed ... here with an algorithm trained on the same data and with no possibilities for ﬁne-tuning; therefore the comparison should be fair. The comparison show that performance-wise, th...

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

9
455
0