{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:59Z","timestamp":1750307099481,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003665","name":"National IT Industry Promotion Agency","doi-asserted-by":"publisher","award":["(NIPA-2011-C1810-1102-0008)"],"award-info":[{"award-number":["(NIPA-2011-C1810-1102-0008)"]}],"id":[{"id":"10.13039\/501100003665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p>This article studies the problem of mining entity translation, specifically, mining English and Chinese name pairs. Existing efforts can be categorized into (a) transliteration-based approaches that leverage phonetic similarity and (b) corpus-based approaches that exploit bilingual cooccurrences. These approaches suffer from inaccuracy and scarcity, respectively. In clear contrast, we use under-leveraged resources of monolingual entity cooccurrences crawled from entity search engines, which are represented as two entity-relationship graphs extracted from two language corpora, respectively. Our problem is then abstracted as finding correct mappings across two graphs. To achieve this goal, we propose a holistic approach to exploiting both transliteration similarity and monolingual cooccurrences. This approach, which builds upon monolingual corpora, complements existing corpus-based work requiring scarce resources of parallel or comparable corpus while significantly boosting the accuracy of transliteration-based work. In addition, by parallelizing the mapping process on multicore architectures, we speed up the computation by more than 10 times per unit accuracy. We validated the effectiveness and efficiency of our proposed approach using real-life datasets.<\/jats:p>","DOI":"10.1145\/2382438.2382444","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T15:02:27Z","timestamp":1354201347000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Entity Translation Mining"],"prefix":"10.1145","volume":"30","author":[{"given":"Gae-Won","family":"You","sequence":"first","affiliation":[{"name":"Pohang University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seung-Won","family":"Hwang","sequence":"additional","affiliation":[{"name":"Pohang University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-In","family":"Song","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Jiang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaiqing","family":"Nie","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,11]]},"reference":[{"volume-title":"Proceedings of the 20th International Conference on Parallel and Distributed Processing (IPDPS\u201906)","author":"Abou","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","first-page":"1","article-title":"The efficacy of round-trip translation for MT evaluation","volume":"14","author":"Aiken M.","year":"2010","journal-title":"Translation J."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.3115\/1073083.1073150"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_2_1_5_1","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithm 2nd Ed. MIT Press. Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithm 2nd Ed. MIT Press."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_2_1_7_1","unstructured":"Engkoo. 2010. http:\/\/www.engkoo.com\/. Engkoo . 2010. http:\/\/www.engkoo.com\/."},{"key":"e_1_2_1_8_1","unstructured":"EntityCube. 2010. http:\/\/entitycube.research.microsoft.com\/. EntityCube . 2010. http:\/\/entitycube.research.microsoft.com\/."},{"volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP\u201904)","author":"Feng D.","key":"e_1_2_1_9_1"},{"volume-title":"Proceedings of the 19th Design Automation Conference (DAC\u201982)","author":"Fiduccia C. M.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219885"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.3115\/980845.980916"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3115\/1075096.1075131"},{"key":"e_1_2_1_14_1","unstructured":"GoogleTranslator. 2010. http:\/\/translate.google.com\/. GoogleTranslator . 2010. http:\/\/translate.google.com\/."},{"volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI\u201907)","author":"Jiang L.","key":"e_1_2_1_15_1"},{"volume-title":"Proceedings of the 47th Annual Meeting of the Association for Computational Linguistics (ACL\u201909)","author":"Jiang L.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/972764.972767"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.3115\/981574.981577"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198296.1198298"},{"volume-title":"Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS\u201990)","author":"Leighton T.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3115\/1218955.1218976"},{"volume-title":"Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics (ACL\u201908)","author":"Lin D.","key":"e_1_2_1_23_1"},{"key":"e_1_2_1_24_1","unstructured":"Metaphone. 2009. http:\/\/aspell.net\/metaphone\/. Metaphone . 2009. http:\/\/aspell.net\/metaphone\/."},{"key":"e_1_2_1_25_1","unstructured":"Renlifang. 2010. http:\/\/renlifang.msra.cn\/. Renlifang . 2010. http:\/\/renlifang.msra.cn\/."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220355.1220444"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827593255135"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220175.1220185"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1351324901002789"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.3115\/980691.980789"},{"key":"e_1_2_1_31_1","unstructured":"West D. B. 2000. Introduction to Graph Theory 2nd Ed. Prentice Hall. West D. B. 2000. Introduction to Graph Theory 2nd Ed. Prentice Hall."},{"volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP\u201910)","author":"You G.","key":"e_1_2_1_32_1"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382438.2382444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2382438.2382444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:49Z","timestamp":1750239289000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2382438.2382444"}},"subtitle":["A Parallelized Graph Alignment Approach"],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1145\/2382438.2382444"],"URL":"https:\/\/doi.org\/10.1145\/2382438.2382444","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"type":"print","value":"1046-8188"},{"type":"electronic","value":"1558-2868"}],"subject":[],"published":{"date-parts":[[2012,11]]},"assertion":[{"value":"2011-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}