{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T23:09:40Z","timestamp":1775603380928,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Asian Language Information Processing"],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p>Resolving ambiguity in the process of query translation is crucial to cross-language information retrieval (CLIR), given the short length of queries. This problem is even more challenging when only a bilingual dictionary is available, which is the focus of our work described here. In this paper, we will present a statistical framework for dictionary-based CLIR that estimates the translation probabilities of query words based on the monolingual word co-occurrence statistics. In addition, we will present two realizations of the proposed framework, i.e., the \u201cmaximum coherence model\u201d and the \u201cspectral query-translation model,\u201d that exploit different metrics for the coherence measurement between a translation of a query word and the theme of the entire query. Compared to previous work on dictionary-based CLIR, the proposed framework is advantageous in three aspects: (1) Translation probabilities are calculated explicitly to capture the uncertainty in translating queries; (2) translations of all query words are estimated simultaneously rather than independently; and (3) the formulated problem can be solved efficiently with a unique optimal solution. Empirical studies with Chinese--English cross-language information retrieval using TREC datasets have shown that the proposed models achieve a relative 10%--50% improvement, compared to other approaches that also exploit word co-occurrence statistics for query translation disambiguation.<\/jats:p>","DOI":"10.1145\/1236181.1236185","type":"journal-article","created":{"date-parts":[[2007,4,9]],"date-time":"2007-04-09T19:07:12Z","timestamp":1176145632000},"page":"360-387","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A statistical framework for query translation disambiguation"],"prefix":"10.1145","volume":"5","author":[{"given":"Yi","family":"Liu","sequence":"first","affiliation":[{"name":"Michigan State University, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[{"name":"Michigan State University, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joyce Y.","family":"Chai","sequence":"additional","affiliation":[{"name":"Michigan State University, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Workshop of Cross-Language Evaluation Forum, CLEF","author":"Adriani M.","year":"2000","unstructured":"Adriani , M. 2000 a. Dictionary-based clir for the clef multilingual track. In Cross-Language Information Retrieval and Evaluation , Workshop of Cross-Language Evaluation Forum, CLEF 2000. Lisbon. Adriani, M. 2000a. Dictionary-based clir for the clef multilingual track. In Cross-Language Information Retrieval and Evaluation, Workshop of Cross-Language Evaluation Forum, CLEF 2000. Lisbon."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009989801965"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258525.258540"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009715923555"},{"key":"e_1_2_1_5_1","volume-title":"Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society","author":"Chung F. R. K.","year":"1997","unstructured":"Chung , F. R. K. 1997 . Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society , Providence, RI. Chung, F. R. K. 1997. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence, RI."},{"key":"e_1_2_1_6_1","volume-title":"The 5th Text Retrieval Conference (TREC-5), D. K. Harman, Ed. NIST","author":"Davis M. W.","year":"1996","unstructured":"Davis , M. W. 1996 . New experiments in cross-language text retrieval at NMSU's computing research lab . In The 5th Text Retrieval Conference (TREC-5), D. K. Harman, Ed. NIST , Boulder, CO. Davis, M. W. 1996. New experiments in cross-language text retrieval at NMSU's computing research lab. In The 5th Text Retrieval Conference (TREC-5), D. K. Harman, Ed. NIST, Boulder, CO."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM '01)","author":"Ding C. H. Q.","unstructured":"Ding , C. H. Q. , He , X. , Zha , H. , Gu , M. , and Simon , H. D . 2001. A min-max cut algorithm for graph-partitioning and data clustering . In Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM '01) . IEEE Computer Society, Washington, D.C. 107--114. Ding, C. H. Q., He, X., Zha, H., Gu, M., and Simon, H. D. 2001. A min-max cut algorithm for graph-partitioning and data clustering. In Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM '01). IEEE Computer Society, Washington, D.C. 107--114."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564407"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383966"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564409"},{"key":"e_1_2_1_11_1","unstructured":"Gill P. Murray W. and Wright M. 1981. Practical Optimization. Academic Press San Diego CA.  Gill P. Murray W. and Wright M. 1981. Practical Optimization. Academic Press San Diego CA."},{"key":"e_1_2_1_12_1","unstructured":"Golub G. H. and Loan C. F. V. 1989. Matrix Computation. John Hopkins Press Baltimore MD.  Golub G. H. and Loan C. F. V. 1989. Matrix Computation. John Hopkins Press Baltimore MD."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243212"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3115\/1034678.1034718"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007665907178"},{"key":"e_1_2_1_17_1","volume-title":"The 8th Text Retrieval Conference (TREC-8), E. M. Voorhees and D. K. Harman, Eds.","volume":"8","author":"Kraaij W.","unstructured":"Kraaij , W. , Pohlmann , R. , and Hiemstra , D . 2000. Twenty-one at TREC-8: using language technology for information retrieval . In The 8th Text Retrieval Conference (TREC-8), E. M. Voorhees and D. K. Harman, Eds. vol. 8 . National Institute of Standards and Technology, NIST, Boulder, CO. 285--300. NIST Special Publication 500--246. Kraaij, W., Pohlmann, R., and Hiemstra, D. 2000. Twenty-one at TREC-8: using language technology for information retrieval. In The 8th Text Retrieval Conference (TREC-8), E. M. Voorhees and D. K. Harman, Eds. vol. 8. National Institute of Standards and Technology, NIST, Boulder, CO. 285--300. NIST Special Publication 500--246."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Kraaij W. and Pohlmann R. 2001. Different approaches to cross language information retrieval. In Computational Linguistics in the Netherlands 2000 W. Daelemans K. Sima'an J. Veenstra and J. Zavrel Eds. Number 37 in Language and Computers: Studies in Practical Linguistics. Rodopi Amsterdam. 97--111.  Kraaij W. and Pohlmann R. 2001. Different approaches to cross language information retrieval. In Computational Linguistics in the Netherlands 2000 W. Daelemans K. Sima'an J. Veenstra and J. Zavrel Eds. Number 37 in Language and Computers: Studies in Practical Linguistics. Rodopi Amsterdam. 97--111.","DOI":"10.1163\/9789004333901_008"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120103322711587"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383972"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564408"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/355214.355218"},{"key":"e_1_2_1_23_1","volume-title":"Machine Learning","author":"Mitchell T.","unstructured":"Mitchell , T. 1997. Machine Learning . McGraw Hill , New York . Mitchell, T. 1997. Machine Learning. McGraw Hill, New York."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076123"},{"key":"e_1_2_1_25_1","volume-title":"Workshop of Cross-Language Evaluation Forum, CLEF '01","author":"Nie J.-Y.","unstructured":"Nie , J.-Y. and Simard , M . 2002. Using statistical translation models for bilingual ir. In Cross-Language Information Retrieval and Evaluation , Workshop of Cross-Language Evaluation Forum, CLEF '01 . Springer-Verlag, New York. 137--150. Nie, J.-Y. and Simard, M. 2002. Using statistical translation models for bilingual ir. In Cross-Language Information Retrieval and Evaluation, Workshop of Cross-Language Evaluation Forum, CLEF '01. Springer-Verlag, New York. 137--150."},{"key":"e_1_2_1_26_1","volume-title":"IJCAI-99 Workshop on Machine Learning for Information Filtering. 61--67","author":"Nigam K.","year":"1999","unstructured":"Nigam , K. , Lafferty , J. , and McCallum , A. 1999 . Using maximum entropy for text classification . In IJCAI-99 Workshop on Machine Learning for Information Filtering. 61--67 . Nigam, K., Lafferty, J., and McCallum, A. 1999. Using maximum entropy for text classification. In IJCAI-99 Workshop on Machine Learning for Information Filtering. 61--67."},{"key":"e_1_2_1_27_1","volume-title":"Rudin, W. 1987. Real & Complex Analysis","unstructured":"Rudin, W. 1987. Real & Complex Analysis , 3 rd Ed. McGraw-Hill , New York . Rudin, W. 1987. Real & Complex Analysis, 3rd Ed. McGraw-Hill, New York.","edition":"3"},{"key":"e_1_2_1_28_1","volume-title":"1971. The SMART retrieval system","author":"Salton G.","unstructured":"Salton , G. , Ed. 1971. The SMART retrieval system . Prentice-Hall , Englewood Cliffs, NJ . Salton, G., Ed. 1971. The SMART retrieval system. Prentice-Hall, Englewood Cliffs, NJ."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/243199.243206"},{"key":"e_1_2_1_31_1","unstructured":"The Mathworks. Matlab http:\/\/www.mathworks.com\/.  The Mathworks. Matlab http:\/\/www.mathworks.com\/."},{"key":"e_1_2_1_32_1","volume-title":"The 9th Text Retrieval Conference (TREC-9).","author":"Xu J.","unstructured":"Xu , J. and Weischedel , R . 2001. TREC-9 cross-lingual retrieval at BBN . In The 9th Text Retrieval Conference (TREC-9). Xu, J. and Weischedel, R. 2001. TREC-9 cross-lingual retrieval at BBN. In The 9th Text Retrieval Conference (TREC-9)."}],"container-title":["ACM Transactions on Asian Language Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1236181.1236185","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1236181.1236185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:16Z","timestamp":1750258336000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1236181.1236185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1145\/1236181.1236185"],"URL":"https:\/\/doi.org\/10.1145\/1236181.1236185","relation":{},"ISSN":["1530-0226","1558-3430"],"issn-type":[{"value":"1530-0226","type":"print"},{"value":"1558-3430","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]},"assertion":[{"value":"2006-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}