{ "paper_id": "A00-1004", "header": { "generated_with": "S2ORC 1.0.0", "date_generated": "2023-01-19T01:11:53.550436Z" }, "title": "Automatic construction of parallel English-Chinese corpus for cross-language information retrieval", "authors": [ { "first": "Jiang", "middle": [], "last": "Chen", "suffix": "", "affiliation": { "laboratory": "", "institution": "succursale CENTRE-VILLE Montreal (Quebec)", "location": { "postCode": "H3C 3J7", "country": "Canada" } }, "email": "chen@ca" }, { "first": "Jian-Yun", "middle": [], "last": "Nie", "suffix": "", "affiliation": { "laboratory": "", "institution": "succursale CENTRE-VILLE Montreal (Quebec)", "location": { "postCode": "H3C 3J7", "country": "Canada" } }, "email": "nie@iro.umontreal@ca" } ], "year": "", "venue": null, "identifiers": {}, "abstract": "A major obstacle to the construction of a probabilistic translation model is the lack of large parallel corpora. In this paper we first describe a parallel text mining system that finds parallel texts automatically on the Web. The generated Chinese-English parallel corpus is used to train a probabilistic translation model which translates queries for Chinese-English cross-language information retrieval (CLIR). We will discuss some problems in translation model training and show the preliminary CUR results.", "pdf_parse": { "paper_id": "A00-1004", "_pdf_hash": "", "abstract": [ { "text": "A major obstacle to the construction of a probabilistic translation model is the lack of large parallel corpora. In this paper we first describe a parallel text mining system that finds parallel texts automatically on the Web. The generated Chinese-English parallel corpus is used to train a probabilistic translation model which translates queries for Chinese-English cross-language information retrieval (CLIR). We will discuss some problems in translation model training and show the preliminary CUR results.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Abstract", "sec_num": null } ], "body_text": [ { "text": "Parallel texts have been used in a number of studies in computational linguistics. Brown et al. (1993) defined a series of probabilistic translation models for MT purposes. While people may question the effectiveness of using these models for a full-blown MT system, the models are certainly valuable for developing translation assistance tools. For example, we can use such a translation model to help complete target text being drafted by a human translator (Langlais et al., 2000) .", "cite_spans": [ { "start": 83, "end": 102, "text": "Brown et al. (1993)", "ref_id": "BIBREF1" }, { "start": 460, "end": 483, "text": "(Langlais et al., 2000)", "ref_id": "BIBREF8" } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "Another utilization is in cross-language information retrieval (CLIR) where queries have to be translated from one language to another language in which the documents are written. In CLIR, the quality requirement for translation is relatively low. For example, the syntactic aspect is irrelevant. Even if the translated word is not a true translation but is strongly related to the original query, it is still helpful. Therefore, CLIR is a suitable application for such a translation model. However, a major obstacle to this approach is the lack of parallel corpora for model training. Only a few such corpora exist, including the Hansard English-French corpus and the HKUST English-Chinese corpus (Wu, 1994) . In this paper, we will describe a method which automatically searches for parallel texts on the Web. We will discuss the text mining algorithm we adopted, some issues in translation model training using the generated parallel corpus, and finally the translation model's performance in CLIR.", "cite_spans": [ { "start": 698, "end": 708, "text": "(Wu, 1994)", "ref_id": "BIBREF12" } ], "ref_spans": [], "eq_spans": [], "section": "Introduction", "sec_num": "1" }, { "text": "Parallel Text Mining Algorithm", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "The PTMiner system is an intelligent Web agent that is designed to search for large amounts of parallel text on the Web. The mining algorithm is largely language independent. It can thus be adapted to other language pairs with only minor modifications.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "Taking advantage of Web search engines as much as possible, PTMiner implements the following steps (illustrated in Fig. 1 ):", "cite_spans": [], "ref_spans": [ { "start": 115, "end": 121, "text": "Fig. 1", "ref_id": "FIGREF0" } ], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "1 Search for candidate sites -Using existing Web search engines, search for the candidate sites that may contain parallel pages;", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "2 File name fetching -For each candidate site, fetch the URLs of Web pages that are indexed by the search engines;", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "3 Host crawling -Starting from the URLs collected in the previous step, search through each candidate site separately for more URLs;", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "4 Pair scan -From the obtained URLs of each site, scan for possible parallel pairs;", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "5 Download and verifying -Download the parallel pages, determine file size, language, and character set of each page, and filter out non-parallel pairs.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "2", "sec_num": null }, { "text": "We take advantage of the huge number of Web sites indexed by existing search engines in determining candidate sites. This is done by submitting some particular requests to the search engines. The requests are determined according to the following observations. In the sites where parallel text exists, there are normally some pages in one language containing links to the parallel version in the other language. These are usually indicated by those links' anchor texts 1. For example, on some English page there may be a link to its Chinese version with the anchor text \"Chinese Version\" or \"in Chinese\". The same phenomenon can be observed on Chinese pages. Chances are that a site with parallel texts will contain such links in some of its documents. This fact is used as the criterion in searching for candidate sites. Therefore, to determine possible sites for English-Chinese parallel texts, we can request an English document containing the following anchor:", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Search for candidate Sites", "sec_num": "2.1" }, { "text": "anchor : \"english version H [\"in english\", ...] .", "cite_spans": [ { "start": 28, "end": 47, "text": "[\"in english\", ...]", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Search for candidate Sites", "sec_num": "2.1" }, { "text": "Similar requests are sent for Chinese documents.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Search for candidate Sites", "sec_num": "2.1" }, { "text": "From the two sets of pages obtained by the above queries we extract two sets of Web sites. The union of these two sets constitutes then the candidate sites. That is to say, a site is a candidate site when it is found to have either an English page linking to its Chinese version or a Chinese page linking to its English version.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Search for candidate Sites", "sec_num": "2.1" }, { "text": "We now assume that a pair of parallel texts exists on the same site. To search for parallel pairs on a site, PTMiner first has to obtain all (or at least part of) the HTML file names on the site. From these names pairs are scanned. It is possible to use a Web crawler to explore the candidate sites completely. However, we can take advantage of the search engines again to accelerate the process. As the first step, we submit the following query to the search engines:", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "File Name Fetching", "sec_num": "2.2" }, { "text": "host : hostname to fetch the Web pages that they indexed from this site. If we only require a small amount of parallel texts, this result may be sufficient. For our purpose, however, we need to explore the sites more thoroughly using a host crawler. Therefore, we continue our search for files with a host crawler which uses the documents found by the search engines as the starting point.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "File Name Fetching", "sec_num": "2.2" }, { "text": "A host crawler is slightly different from a Web crawler.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Host Crawling", "sec_num": "2.3" }, { "text": "Web crawlers go through innumerable pages and hosts on the Web. A host crawler is a Web crawler that crawls through documents on a given host only. A breadth-first crawling algorithm is applied in PTMiner as host crawler. The principle is that when a link to an unexplored document on the same site is found in a document, it is added to a list that will be explored later. In this way, most file names from the candidate sites are obtained.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Host Crawling", "sec_num": "2.3" }, { "text": "After collecting file names for each candidate site, the next task is to determine the parallel pairs. Again, we try to use some heuristic rules to guess which files may be parallel texts before downloading them. The rules are based on external features of the documents. By external feature, we mean those features which may be known without analyzing the contents of the file, such as its URL, size, and date. This is in contrast with the internal features, such as language, character set, and HTML structure, which cannot be known until we have downloaded the page and analyzed its contents.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Pair Scan", "sec_num": "2.4" }, { "text": "The heuristic criterion comes from the following observation: We observe that parallel text pairs usually have similar name patterns. The difference between the names of two parailel pages usually lies in a segment which indicates the language. For example, \"file-ch.html\" (in Chinese) vs. \"file-en.html\" (in English). The difference may also appear in the path, such as \".../chinese/.../file.html\" vs. \".../english/.../file.html'. The name patterns described above are commonly used by webmasters to help organize their sites. Hence, we can suppose that a pair of pages with this kind of pattern are probably parallel texts.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Pair Scan", "sec_num": "2.4" }, { "text": "First, we establish four lists for English prefixes, English suffixes, Chinese prefixes and Chinese suffixes. For example: English Prefix = {e, en, e_, en_, e-, en-, ...}. For each file in one language, if a segment in its name corresponds to one of the language affixes, several new names are generated by changing the segment to the possible corresponding affixes of the other language. If a generated name corresponds to an existing file, then the file is considered as a candidate parallel document of the original file.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Pair Scan", "sec_num": "2.4" }, { "text": "Next, we further examine the contents of the paired files to determine if they are really parallel according to various external and internal features. This may further improve the pairing precision. The following methods have been implemented in our system.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Filtering", "sec_num": "2.5" }, { "text": "Parallel files often have similar file lengths. One simple way to filter out incorrect pairs is to compare the lengths of the two files. The only problem is to set a reasonable threshold that will not discard too many good pairs, i.e. balance recall and precision. The usual difference ratio depends on the language pairs we are dealing with. For example, Chinese-English parallel texts usually have a larger difference ratio than English-French parallel texts. The filtering threshold had to be determined empirically, from the actual observations. For Chinese-English, a difference up to 50% is tolerated.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Text Length", "sec_num": "2.5.1" }, { "text": "It is also obvious that the two files of a pair have to be in the two languages of interest. By automatically identifying language and character set, we can filter out the pairs that do not satisfy this basic criterion. Some Web pages explicitly indicate the language and the character set. More often such information is omitted by authors. We need some language identification tool for this task.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Language and Character Set", "sec_num": "2.5.2" }, { "text": "SILC is a language and encoding identification system developed by the RALI laboratory at the University of Montreal. It employs a probabilistic model estimated on tri-grams. Using these models, the system is able to determine the most probable language and encoding of a text (Isabelle et al., 1997) .", "cite_spans": [ { "start": 277, "end": 300, "text": "(Isabelle et al., 1997)", "ref_id": "BIBREF5" } ], "ref_spans": [], "eq_spans": [], "section": "Language and Character Set", "sec_num": "2.5.2" }, { "text": "In the STRAND system (Resnik, 1998) , the candidate pairs are evaluated by aligning them according to their HTML structures and computing confidence values. Pairs are assumed to be wrong if they have too many mismatching markups or low confidence values.", "cite_spans": [ { "start": 21, "end": 35, "text": "(Resnik, 1998)", "ref_id": "BIBREF10" } ], "ref_spans": [], "eq_spans": [], "section": "HTML Structure and Alignment", "sec_num": "2.5.3" }, { "text": "Comparing HTML structures seems to be a sound way to evaluate candidate pairs since parallel pairs usually have similar HTML structures. However, we also noticed that parallel texts may have quite different HTML structures. One of the reasons is that the two files may be created using two HTML editors. For example, one may be used for English and another for Chinese, depending on the language handling capability of the editors. Therefore, caution is required when measuring structure difference numerically.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "HTML Structure and Alignment", "sec_num": "2.5.3" }, { "text": "Parallel text alignment is still an experimental area. Measuring the confidence values of an alignment is even more complicated. For example, the alignment algorithm we used in the training of the statistical translation model produces acceptable alignment results but it does not provide a confidence value that we can \"confidently\" use as an evaluation criterion. So, for the moment this criterion is not used in candidate pair evaluation.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "HTML Structure and Alignment", "sec_num": "2.5.3" }, { "text": "3 Generated", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "HTML Structure and Alignment", "sec_num": "2.5.3" }, { "text": "In this section, we describe the results of our parallel text mining and translation model training.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Corpus and Translation Model Training", "sec_num": null }, { "text": "Using the above approach for Chinese-English, 185 candidate sites were searched from the domain hk. We limited the mining domain to hk because Hong Kong is a bilingual English-Chinese city where high quality parallel Web sites exist. Because of the small number of candidate sites, the host crawler was used to thoroughly explore each site. The resulting corpus contains 14820 pairs of texts including 117.2Mb Chinese texts and 136.5Mb English texts. The entire mining process lasted about a week. Using length comparison and language identification, we refined the precision of the corpus to about 90%. The precision is estimated by examining 367 randomly picked pairs.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "The Corpus", "sec_num": "3.1" }, { "text": "Many approaches in computational linguistics try to extract translation knowledge from previous translation examples. Most work of this kind establishes probabilistic models from parallel corpora. Based on one of the statistical models proposed by Brown et al. (1993) , the basic principle of our translation model is the following: given a corpus of aligned sentences, if two words often co-occur in the source and target sentences, there is a good likelihood that they are translations of each other. In the simplest case (model 1), the model learns the probability, p(tls), of having a word t in the translation of a sentence containing a word s. For an input sentence, the model then calculates a sequence of words that are most probable to appear in its translation. Using a similar statistical model, Wu (1995) extracted a largescale English-Chinese lexicon from the HKUST cor- Journal of Primary Education 1996, VoI., No. l&2, pp. 19 -27 Journal of Primary Education
Volume 6, No l&2, pp. 19-27 (May, 1996)

Principles for Redesigning Teacher Education

Alan TOM

Abstract pus which is built manually. In our case, the probabilistic translation model will be used for CLIR. The requirement on our translation model may be less demanding: it is not absolutely necessary that a word t with high p(tls ) always be a true translation of s. It is still useful if t is strongly related to s. For example, although \"railway\" is not a true translation of \"train\" (in French), it is highly useful to include \"railway\" in the translation of a query on \"train\". This is one of the reasons why we think a less controlled parallel corpus can be used to train a translation model for CLIR.", "cite_spans": [ { "start": 248, "end": 267, "text": "Brown et al. (1993)", "ref_id": "BIBREF1" }, { "start": 807, "end": 816, "text": "Wu (1995)", "ref_id": "BIBREF14" }, { "start": 1077, "end": 1122, "text": "Primary Education 1996, VoI., No. l&2, pp. 19", "ref_id": null } ], "ref_spans": [], "eq_spans": [], "section": "Statistical Translation Model", "sec_num": "3.2" }, { "text": "Before the mined documents can be aligned into parallel sentences, the raw texts have to undergo a series of some preprocessing, which, to some extent, is language dependent. For example, the major operations on the Chinese-English corpus include encoding scheme transformation (for Chinese), sentence level segmentation, parallel text alignment, Chinese word segmentation (Nie et al., 1999) and English expression extraction.", "cite_spans": [ { "start": 373, "end": 391, "text": "(Nie et al., 1999)", "ref_id": "BIBREF9" } ], "ref_spans": [], "eq_spans": [], "section": "Parallel Text Alignment", "sec_num": "3.3" }, { "text": "The parallel Web pages we collected from various sites are not all of the same quality. Some are highly parallel and easy to align while others can be very noisy. Aligning English-Chinese parallel texts is already very difficult because of the great differences in the syntactic structures and writing systems of the two languages. A number of alignment techniques have been proposed, varying from statistical methods (Brown et al., 1991; Gale and Church, 1991) to lexical methods (Kay and RSscheisen, 1993; Chen, 1993) . The method we adopted is that of Simard et al. (1992) . Because it considers both length similarity and cognateness as alignment criteria, the method is more robust and better able to deal with noise than pure length-based methods. Cognates are identical sequences of characters in corresponding words in two languages. They are commonly found in English and French. In the case of English-Chinese alignment, where there are no cognates shared by the two languages, only the HTML markup in both texts are taken as cognates. Because the HTML structures of parallel pages are normally similar, the markup was found to be helpful for alignment.", "cite_spans": [ { "start": 418, "end": 438, "text": "(Brown et al., 1991;", "ref_id": "BIBREF1" }, { "start": 439, "end": 461, "text": "Gale and Church, 1991)", "ref_id": "BIBREF4" }, { "start": 481, "end": 507, "text": "(Kay and RSscheisen, 1993;", "ref_id": "BIBREF6" }, { "start": 508, "end": 519, "text": "Chen, 1993)", "ref_id": "BIBREF2" }, { "start": 555, "end": 575, "text": "Simard et al. (1992)", "ref_id": "BIBREF11" } ], "ref_spans": [], "eq_spans": [], "section": "Parallel Text Alignment", "sec_num": "3.3" }, { "text": "To illustrate how markup can help with the alignment, we align the same pair with both the pure length-based method of Gale & Church (Fig. 2) , and the method of Simard et al. (Fig. 3) . First of all, we observe from the figures that the two texts are Journal of Primary Education


Volume 6, No l&2, pp. 19-27 (May, 1996) divided into sentences. The sentences are marked by and . Note that we determine sentences not only by periods, but also by means of HTML markup.", "cite_spans": [ { "start": 343, "end": 375, "text": "6, No l&2, pp. 19-27 (May, 1996)", "ref_id": null } ], "ref_spans": [ { "start": 133, "end": 141, "text": "(Fig. 2)", "ref_id": "FIGREF1" }, { "start": 176, "end": 184, "text": "(Fig. 3)", "ref_id": "FIGREF2" } ], "eq_spans": [], "section": "Parallel Text Alignment", "sec_num": "3.3" }, { "text": "
", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Parallel Text Alignment", "sec_num": "3.3" }, { "text": "We further notice that it is difficult to align sentences 0002. The sentence in the Chinese page is much longer than its counterpart in the English page because some additional information (font) is added. The length-based method thus tends to take sentence 0002, 0003, and 0004 in the English page as the translation of sentence 0002 in the Chinese page (Fig. 2) , which is wrong. This in turn provocated the three following incorrect alignments. As we can see in Fig. 3 , the cognate method did not make the same mistake because of the noise in sentence 0002. Despite their large length difference, the two 0002 sentences are still aligned as a 1-1 pair, because the sentences in the following 4 alignments (0003 -0003; 0004 -0004, 0005; 0005 -0006; 0006 -0007) have rather similar HTML markups and are taken by the program to be the most likely alignments.", "cite_spans": [], "ref_spans": [ { "start": 355, "end": 363, "text": "(Fig. 2)", "ref_id": "FIGREF1" }, { "start": 465, "end": 471, "text": "Fig. 3", "ref_id": "FIGREF2" } ], "eq_spans": [], "section": "Parallel Text Alignment", "sec_num": "3.3" }, { "text": "Beside HTML markups, other criteria may also be incorporated. For example, it would be helpful to consider strong correspondence between certain English and Chinese words, as in (Wu, 1994) . We hope to implement such correspondences in our future research.", "cite_spans": [ { "start": 178, "end": 188, "text": "(Wu, 1994)", "ref_id": "BIBREF12" } ], "ref_spans": [], "eq_spans": [], "section": "Parallel Text Alignment", "sec_num": "3.3" }, { "text": "To evaluate the precision of the English-Chinese translation model trained on the Web corpus, we examined two sample lexicons of 200 words, one in each direction. The 200 words for each lexicon were randomly selected from the training source. We examined the most probable translation for each word. The Chinese-English lexicon was found to have a precision of 77%. The English-Chinese lexicon has a higher precision of 81.5%. Part of the lexicons are shown in Fig. 4 , where t/f indicates whether a translation is true or false.", "cite_spans": [], "ref_spans": [ { "start": 461, "end": 467, "text": "Fig. 4", "ref_id": null } ], "eq_spans": [], "section": "Lexicon Evaluation", "sec_num": "3.4" }, { "text": "These precisions seem to be reasonably high. They are quite comparable to that obtained by Wu (1994) using a manual Chinese-English parallel corpus.", "cite_spans": [ { "start": 91, "end": 100, "text": "Wu (1994)", "ref_id": "BIBREF12" } ], "ref_spans": [], "eq_spans": [], "section": "Lexicon Evaluation", "sec_num": "3.4" }, { "text": "We also found that stop-lists have significant effect on the translation model. Stop-list is a set of the most frequent words that we remove from the train- ing source. Because these words exist in most alignments, the statistical model cannot derive correct translations for them. More importantly, their existence greatly affects the accuracy of other translations. They can be taken as translations for many words. A priori, it would seem that both the English and Chinese stop-lists should be applied to eliminate the noise caused by them. Interestingly, from our observation and analysis we concluded that for better precision, only the stop-list of the target language should be applied in the model training.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "We first explain why the stop-list of the target language has to be applied. On the left side of Fig. 5 , if the Chinese word C exists in the same alignments with the English word E more than any other Chinese words, C will be the most probable translation for E. Because of their frequent appearance, some Chinese stopwords may have more chances to be in the same alignments with E. The probability of the translation E --+ C is then reduced (maybe even less than those of the incorrect ones). This is the reason why many English words are translated to \"~' (of) by the translation model trained without using the Chinese stop-list.", "cite_spans": [], "ref_spans": [ { "start": 97, "end": 103, "text": "Fig. 5", "ref_id": "FIGREF3" } ], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "We also found that it is not necessary to remove the stopwords of the source language. In fact, as illustrated on the right side of Fig. 5 , the existence of the English stopwords has two effects on the probability of the translation E -~ C:", "cite_spans": [], "ref_spans": [ { "start": 132, "end": 138, "text": "Fig. 5", "ref_id": "FIGREF3" } ], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "1 They may often be found together with the Chinese word C. Owing to the Expectation Maximization algorithm, the probability of E -~ C may therefore be reduced.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "2 On the other hand, there is a greater likelihood that English stopwords will be found together with the most frequent Chinese words. Here, we use the term \"Chinese frequent words\" instead of \"Chinese stopwords\" because even if a stop-list is applied, there may still remain some common words that have the same effect as the stopwords. The coexistence of English and Chinese frequent words reduces the probability that the Chinese frequent words are the translations of E, and thus raise the probability of E -+ C.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "The second effect was found to be more significant than the first, since the model trained without the English stopwords has better precision than the model trained with the English stopwords. For the correct translations given by both models, the model English-Chinese CLIR Results", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "Our final goal was to test the performance of the translation models trained on the Web parallel corpora in CLIR. We conducted CLIR experiments using the Smart IR system.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Effect of Stopwords", "sec_num": null }, { "text": "The English test corpus (for C-E CLIR) was the AP corpus used in TREC6 and TREC7. The short English queries were translated manually into Chinese and then translated back to English by the translation model. The Chinese test corpus was the one used in the TREC5 and TREC6 Chinese track. It contains both Chinese queries and their English translations.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Results", "sec_num": "4.1" }, { "text": "Our experiments on these two corpora produced the results shown in Tab. 1. The precision of monolingual IR is given as benchmark. In both E-C and C-E CLIR, the translation model achieved around 40% of monolingual precision. To compare with the dictionary-based approach, we employed a Chinese-English dictionary, CEDICT (Denisowski, 1999) , and an English-Chinese online dictionary (Anonymous, 1999a) to translate queries. For each word of the source query, all the possible translations given by the dictionary are included in the translated query. The Chinese-English dictionary has about the same performace as the translation model, while the English-Chinese dictionary has lower precision than that of the translation model.", "cite_spans": [ { "start": 320, "end": 338, "text": "(Denisowski, 1999)", "ref_id": "BIBREF3" } ], "ref_spans": [], "eq_spans": [], "section": "Results", "sec_num": "4.1" }, { "text": "We also tried to combine the translations given by the translation model and the dictionary. In both C-E and E-C CLIR, significant improvements were achieved (as shown in Tab. 1). The improvements show that the translations given by the translation model and the dictionary complement each other well for IR purposes. The translation model may give either exact translations or incorrect but related words. Even though these words are not correct in the sense of translation, they are very possibly related to the subject of the query and thus helpful for IR purposes. The dictionary-based approach expands a query along another dimension. It gives all the possible translations for each word including those that are missed by the translation model.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Results", "sec_num": "4.1" }, { "text": "One advantage of a parallel text-based translation model is that it is easier to build than an MT system. Now that we have examined the CLIR performance of the translation model, we will compare it with two existing MT systems. Both systems were tested in E-C CLIR.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Comparison With MT Systems", "sec_num": "4.2" }, { "text": "Using the Sunshine WebTran server (Anonymous, 1999b) , an online Engiish-Chinese MT system, to translate the 54 English queries, we obtained an average precision of 0.2001, which is 50.3% of the mono-lingual precision. The precision is higher than that obtained using the translation model (0.1804) or the dictionary (0.1427) alone, but lower than the precison obtained using them together (0.2232). Kwok (1999) investigated the CLIR performance of an English-Chinese MT software called Transperfect, using the same TREC Chinese collection as we used in this study. Using the MT software alone, Kwok achieved 56% of monolingual precision. The precision is improved to 62% by refining the translation with a dictionary. Kwok also adopted pretranslation query expansion, which further improved the precison to 70% of the monolingual results.", "cite_spans": [ { "start": 34, "end": 52, "text": "(Anonymous, 1999b)", "ref_id": null }, { "start": 400, "end": 411, "text": "Kwok (1999)", "ref_id": "BIBREF7" } ], "ref_spans": [], "eq_spans": [], "section": "Sunshine WebTran Server", "sec_num": "4.2.1" }, { "text": "In our case, the best E-C CLIR precison using the translation model (and dictionary) is 56.1%. It is lower than what Kwok achieved using Transperfect, however, the difference is not large.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Transperfect", "sec_num": "4.2.2" }, { "text": "The Chinese-English translation model has a fax lower CLIR performance than that of the English-French model established using the same method (Nie et al., 1999) . The principal reason for this is the fact that English and Chinese are much more different than English and French. This problem surfaced in many phases of this work, from text alignment to query translation. Below, we list some further factors affecting CLIR precision.", "cite_spans": [ { "start": 143, "end": 161, "text": "(Nie et al., 1999)", "ref_id": "BIBREF9" } ], "ref_spans": [], "eq_spans": [], "section": "Further Problems", "sec_num": "4.3" }, { "text": "\u2022 The Web-collected corpus is noisy and it is difficult to align English-Chinese texts. The alignment method we employed has performed more poorly than on English-French alignment. This in turn leads to poorer performance of the translation model. In general, we observe a higher variability in Chinese-English translations than in English-French translations.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Further Problems", "sec_num": "4.3" }, { "text": "\u2022 For E-C CLIR, although queries in both languages were provided, the English queries were not strictly translated from the original Chinese ones. For example, AJg,~ (human right situation) was translated into human right issue. We cannot expect the translation model to translate issue back to ~ (situation). ", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Further Problems", "sec_num": "4.3" }, { "text": "The goal of this work was to investigate the feasibility of using a statistical translation model trained on a Web-collected corpus to do English-Chinese CLIR.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Summary", "sec_num": "5" }, { "text": "In this paper, we have described the algorithm and implementation we used for parallel text mining, translation model training, and some results we obtained in CLIR experiments. Although further work remains to be done, we can conclude that it is possible to automatically construct a Chinese-English parallel corpus from the Web. The current system can be easily adapted to other language pairs. Despite the noisy nature of the corpus and the great difference in the languages, the evaluation lexicons generated by the translation model produced acceptable precision. While the current CLIR results are not as encouraging as those of English-French CLIR, they could be improved in various ways, such as improving the alignment method by adapting cognate definitions to HTML markup, incorporating a lexicon and/or removing some common function words in translated queries. We hope to be able to demonstrate in the near future that a fine-tuned English-Chinese translation model can provide query translations for CLIR with the same quality produced by MT systems.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "Summary", "sec_num": "5" }, { "text": "1An anchor text is a piece of text on a Web page which, when clicked on, will take you to another linked page. To be helpful, it usually contains the key information about the linked page.", "cite_spans": [], "ref_spans": [], "eq_spans": [], "section": "", "sec_num": null } ], "back_matter": [], "bib_entries": { "BIBREF0": { "ref_id": "b0", "title": "Anonymous. 1999a. Sunrain.net -English-Chinese dictionary", "authors": [], "year": null, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Anonymous. 1999a. Sunrain.net -English-Chinese dictionary, http://sunrain.net/r_ecdict _e.htm. Anonymous. 1999b. Sunshine WebTran server. http://www.readworld.com/translate.htm.", "links": null }, "BIBREF1": { "ref_id": "b1", "title": "The mathematics of machine translation: Parameter estimation", "authors": [ { "first": "P", "middle": [ "F" ], "last": "Brown", "suffix": "" }, { "first": "J", "middle": [ "C" ], "last": "Lai", "suffix": "" }, { "first": "R", "middle": [ "L" ], "last": "Mercer", "suffix": "" } ], "year": 1991, "venue": "29th Annual Meeting of the Association for Computational Linguistics", "volume": "19", "issue": "", "pages": "263--311", "other_ids": {}, "num": null, "urls": [], "raw_text": "P. F. Brown, J. C. Lai, and R. L. Mercer. 1991. Aligning sentences in parallel corpora. In 29th Annual Meeting of the Association for Computa- tional Linguistics, pages 89-94, Berkeley, Calif. P. F. Brown, S. A. Della Pietra, V. J. Della Pietra, and R. L. Mercer. 1993. The mathematics of ma- chine translation: Parameter estimation. Compu- tational Linguistics, 19:263-311.", "links": null }, "BIBREF2": { "ref_id": "b2", "title": "Aligning sentences in bilingual corpora using lexical information", "authors": [ { "first": "S", "middle": [ "F" ], "last": "Chen", "suffix": "" } ], "year": 1993, "venue": "Proceedings of the 31th Annual Meeting of the Association for Computational Linguistics", "volume": "", "issue": "", "pages": "9--16", "other_ids": {}, "num": null, "urls": [], "raw_text": "S. F. Chen. 1993. Aligning sentences in bilingual corpora using lexical information. In Proceedings of the 31th Annual Meeting of the Association for Computational Linguistics, pages 9-16, Colum- bus, Ohio.", "links": null }, "BIBREF3": { "ref_id": "b3", "title": "Cedict (chinese-english dictionary) project", "authors": [ { "first": "Paul", "middle": [], "last": "Denisowski", "suffix": "" } ], "year": 1999, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Paul Denisowski. 1999. Cedict (chinese-english dic- tionary) project, http://www.mindspring.com/ paul_denisowski/cedict.html.", "links": null }, "BIBREF4": { "ref_id": "b4", "title": "A program for aligning sentences in bilingual corpora", "authors": [ { "first": "A", "middle": [], "last": "William", "suffix": "" }, { "first": "Kenneth", "middle": [ "W" ], "last": "Gale", "suffix": "" }, { "first": "", "middle": [], "last": "Church", "suffix": "" } ], "year": 1991, "venue": "Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics", "volume": "", "issue": "", "pages": "177--184", "other_ids": {}, "num": null, "urls": [], "raw_text": "William A. Gale and Kenneth W. Church. 1991. A program for aligning sentences in bilingual cor- pora. In Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics, pages 177-184, Berkeley, Calif.", "links": null }, "BIBREF5": { "ref_id": "b5", "title": "SILC: un syst~me d'identification de la langue", "authors": [ { "first": "P", "middle": [], "last": "Isabelle", "suffix": "" }, { "first": "G", "middle": [], "last": "Foster", "suffix": "" }, { "first": "P", "middle": [], "last": "Plamondon", "suffix": "" } ], "year": 1997, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "P. Isabelle, G. Foster, and P. Plamondon. 1997. SILC: un syst~me d'identification de la langue et du codage, http://www- rali.iro.umontreal.ca/ProjetSILC.en.html.", "links": null }, "BIBREF6": { "ref_id": "b6", "title": "Text-translation alignment", "authors": [ { "first": "M", "middle": [], "last": "Kay", "suffix": "" }, { "first": "M", "middle": [], "last": "Rsscheisen", "suffix": "" } ], "year": 1993, "venue": "Computational Linguistics", "volume": "19", "issue": "", "pages": "121--142", "other_ids": {}, "num": null, "urls": [], "raw_text": "M. Kay and M. RSscheisen. 1993. Text-translation alignment. Computational Linguistics, 19:121- 142.", "links": null }, "BIBREF7": { "ref_id": "b7", "title": "English-chinese cross-language retrieval based on a translation package", "authors": [ { "first": "K", "middle": [ "L" ], "last": "Kwok", "suffix": "" } ], "year": 1999, "venue": "Workshop of Machine Translation for Cross Language Information Retrieval, Machine Translation Summit VII", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "K. L. Kwok. 1999. English-chinese cross-language retrieval based on a translation package. In Work- shop of Machine Translation for Cross Language Information Retrieval, Machine Translation Sum- mit VII, Singapore.", "links": null }, "BIBREF8": { "ref_id": "b8", "title": "Unit completion for a computer-aided translation typing system", "authors": [ { "first": "P", "middle": [], "last": "Langlais", "suffix": "" }, { "first": "G", "middle": [], "last": "Foster", "suffix": "" }, { "first": "G", "middle": [], "last": "Lapalme", "suffix": "" } ], "year": 2000, "venue": "Applied Natural Language Processing Conference (ANLP)", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "P. Langlais, G. Foster, and G. Lapalme. 2000. Unit completion for a computer-aided translation typ- ing system. In Applied Natural Language Pro- cessing Conference (ANLP), Seattle, Washington, May.", "links": null }, "BIBREF9": { "ref_id": "b9", "title": "Cross-language information retrieval based on parallel texts and automatic mining parallel texts from the Web", "authors": [ { "first": "Jianyun", "middle": [], "last": "Nie", "suffix": "" }, { "first": "Michel", "middle": [], "last": "Simard", "suffix": "" }, { "first": "Pierre", "middle": [], "last": "Isabelle", "suffix": "" }, { "first": "Richard", "middle": [], "last": "Durand", "suffix": "" } ], "year": 1999, "venue": "ACM SIGIR '99", "volume": "", "issue": "", "pages": "74--81", "other_ids": {}, "num": null, "urls": [], "raw_text": "Jianyun Nie, Michel Simard, Pierre Isabelle, and Richard Durand. 1999. Cross-language informa- tion retrieval based on parallel texts and auto- matic mining parallel texts from the Web. In ACM SIGIR '99, pages 74-81, August.", "links": null }, "BIBREF10": { "ref_id": "b10", "title": "Parallel stands: A preliminary investigation into mining the Web for bilingual text", "authors": [ { "first": "Philip", "middle": [], "last": "Resnik", "suffix": "" } ], "year": 1998, "venue": "AMTA '98", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Philip Resnik. 1998. Parallel stands: A preliminary investigation into mining the Web for bilingual text. In AMTA '98, October.", "links": null }, "BIBREF11": { "ref_id": "b11", "title": "Using cognates to align sentences in bilingual corpora", "authors": [ { "first": "Michel", "middle": [], "last": "Simard", "suffix": "" }, { "first": "George", "middle": [ "F" ], "last": "Foster", "suffix": "" }, { "first": "Pierre", "middle": [], "last": "Isabelle", "suffix": "" } ], "year": 1992, "venue": "Proceedings of TMI-92", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Michel Simard, George F. Foster, and Pierre Is- abelle. 1992. Using cognates to align sentences in bilingual corpora. In Proceedings of TMI-92, Montreal, Quebec.", "links": null }, "BIBREF12": { "ref_id": "b12", "title": "Aligning a parallel English-Chinese corpus statistically with lexical criteria", "authors": [ { "first": "Dekai", "middle": [], "last": "Wu", "suffix": "" } ], "year": 1994, "venue": "", "volume": "", "issue": "", "pages": "", "other_ids": {}, "num": null, "urls": [], "raw_text": "Dekai Wu. 1994. Aligning a parallel English- Chinese corpus statistically with lexical criteria.", "links": null }, "BIBREF13": { "ref_id": "b13", "title": "ACL-9$: 32nd Annual Meeting of the Assoc. for Computational Linguistics", "authors": [], "year": null, "venue": "", "volume": "", "issue": "", "pages": "80--87", "other_ids": {}, "num": null, "urls": [], "raw_text": "In ACL-9$: 32nd Annual Meeting of the Assoc. for Computational Linguistics, pages 80-87, Las Cruces, NM, June.", "links": null }, "BIBREF14": { "ref_id": "b14", "title": "Large-scale automatic extraction of an English-Chinese lexicon", "authors": [ { "first": "Dekai", "middle": [], "last": "Wu", "suffix": "" } ], "year": 1995, "venue": "Machine Translation", "volume": "9", "issue": "3-4", "pages": "285--313", "other_ids": {}, "num": null, "urls": [], "raw_text": "Dekai Wu. 1995. Large-scale automatic extraction of an English-Chinese lexicon. Machine Transla- tion, 9(3-4):285-313.", "links": null } }, "ref_entries": { "FIGREF0": { "type_str": "figure", "text": "The workflow of the mining process.", "uris": null, "num": null }, "FIGREF1": { "type_str": "figure", "text": "An alignment example using pure length-based method.", "uris": null, "num": null }, "FIGREF2": { "type_str": "figure", "text": "An alignment example considering cognates.", "uris": null, "num": null }, "FIGREF3": { "type_str": "figure", "text": "Effect of stop lists in C-E translation.", "uris": null, "num": null }, "FIGREF4": { "type_str": "figure", "text": "The training source and the CLIR collections were from different domains. The Web corpus are retrieved from the parallel sites in Hong Kong while the Chinese collection is from People's Daily and Xinhua News Agency, which are published in mainland China. As the result, some important terms such as ~$ $ (mostfavored-nation) and ---I!! ~ ~ (one-nation-twosystems) in the collection are not known by the model.", "uris": null, "num": null } } } }