W06-3111 improvements using the refined binary segmentation method . 2 . On the FBIS corpus
W06-3111 , we will describe the refined binary segmentation method . In Section 4.1 , we
W06-3111 translation quality . 3 . In the binary segmentation method , an incorrect segmentation
W06-3111 parallel sentence extraction : binary segmentation of the bilingual texts recursively
W06-3111 optimized the weightings for the binary segmentation method , the sum of the weightings
W06-3111 lexicon parameters . Then the binary segmentation algorithm is applied to extract
W06-3111 methods of Champollion and the binary segmentation with anchors , the BLEU score
W06-3111 . One of the advantages of the binary segmentation is that we do not loose words
W06-3111 Partitioning Parallel Documents Using Binary Segmentation </title> Xu Zens Abstract In
W06-3111 number of different models in the binary segmentation , such as IBM-1 , and anchor
W06-3111 bilingual corpora produced by the binary segmentation and Champollion methods are concatenated
W06-3111 BLEU score . We observe that the binary segmentation methods are comparable to Champollion
P10-3006 generative model after each possible binary segmentation ( splitting ) of the word . If
W15-5011 alignment method based on a recursive binary segmentation process of the alignment matrix
P12-1009 binary segmentations , we create a binary segmentation by setting a turn as a segment
P12-1009 evaluation metrics that require binary segmentations , we create a binary segmentation
W06-3111 sentences using three methods : 1 . Binary segmentation The segmentation method described
W06-3111 hypothesis with maximum probability . 3 Binary Segmentation Method 3.1 Approach Here a document
W06-3111 the original corpora into the binary segmentation . In the monotone case , the
P12-1100 span by enumerating all possible binary segmentation of the chunks in this span .
hide detail