{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:22:09Z","timestamp":1764872529962,"version":"3.44.0"},"reference-count":36,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2022,9,26]]},"abstract":"<jats:p>In recent years, we have witnessed a steady growth of linguistic information represented and exposed as linked data on the Web. Such linguistic linked data have stimulated the development and use of openly available linguistic knowledge graphs, as is the case with the Apertium RDF, a collection of interconnected bilingual dictionaries represented and accessible through Semantic Web standards. In this work, we explore techniques that exploit the graph nature of bilingual dictionaries to automatically infer new links (translations). We build upon a cycle density based method: partitioning the graph into biconnected components for a speed-up, and simplifying the pipeline through a careful structural analysis that reduces hyperparameter tuning requirements. We also analyse the shortcomings of traditional evaluation metrics used for translation inference and propose to complement them with new ones, both-word precision (BWP) and both-word recall (BWR), aimed at being more informative of algorithmic improvements. Over twenty-seven language pairs, our algorithm produces dictionaries about 70% the size of existing Apertium RDF dictionaries at a high BWP of 85% from scratch within a minute. Human evaluation shows that 78% of the additional translations generated for dictionary enrichment are correct as well. We further describe an interesting use-case: inferring synonyms within a single language, on which our initial human-based evaluation shows an average accuracy of 84%. We release our tool as free\/open-source software which can not only be applied to RDF data and Apertium dictionaries, but is also easily usable for other formats and communities.<\/jats:p>","DOI":"10.3233\/sw-222899","type":"journal-article","created":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T15:30:30Z","timestamp":1662737430000},"page":"1103-1132","source":"Crossref","is-referenced-by-count":4,"title":["Bilingual dictionary generation and enrichment via graph exploration"],"prefix":"10.1177","volume":"13","author":[{"given":"Shashwat","family":"Goel","sequence":"first","affiliation":[{"name":"IIIT Hyderabad, Professor CR Rao Rd, Gachibowli, Hyderabad, Telangana, 500032, India"}]},{"given":"Jorge","family":"Gracia","sequence":"additional","affiliation":[{"name":"Aragon Institute of Engineering Research, University of Zaragoza, Mariano Esquillor s\/n, 50018 Zaragoza, Spain"}]},{"given":"Mikel L.","family":"Forcada","sequence":"additional","affiliation":[{"name":"Dept.\u00a0de Llenguatges i Sistemes Inform\u00e0tics, Universitat d\u2019Alacant, Ctra.\u00a0St.\u00a0Vicent\u2013Alacant, s\/n, 03690 St.\u00a0Vicent del Raspeig, Spain"}]}],"member":"179","reference":[{"issue":"3","key":"10.3233\/SW-222899_ref1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/jgt.20290","article-title":"On the maximum number of cycles in a planar graph","volume":"57","author":"Aldred","year":"2008","journal-title":"Journal of Graph Theory"},{"key":"10.3233\/SW-222899_ref2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1162\/tacl_a_00034","article-title":"Linear algebraic structure of word senses, with applications to polysemy","volume":"6","author":"Arora","year":"2018","journal-title":"Transactions of the Association for Computational Linguistics"},{"key":"10.3233\/SW-222899_ref3","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1250"},{"key":"10.3233\/SW-222899_ref4","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-1494"},{"issue":"2","key":"10.3233\/SW-222899_ref5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10579-007-9038-4","article-title":"Combining linguistic resources to create a machine-tractable Japanese-Malay dictionary","volume":"42","author":"Bond","year":"2008","journal-title":"Language Resources and Evaluation"},{"key":"10.3233\/SW-222899_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30225-2"},{"key":"10.3233\/SW-222899_ref7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1613\/jair.3456","article-title":"The CQC algorithm: Cycling in graphs to semantically enrich and enhance a bilingual dictionary","volume":"43","author":"Flati","year":"2012","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"10.3233\/SW-222899_ref8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10590-011-9090-0","article-title":"Apertium: A free\/open-source platform for rule-based machine translation","volume":"25","author":"Forcada","year":"2011","journal-title":"Machine translation"},{"key":"10.3233\/SW-222899_ref9","doi-asserted-by":"crossref","unstructured":"P.\u00a0Fung and L.\u00a0Yuen Yee, An IR approach for translating new words from nonparallel, comparable texts, in: Proc. of 17th International Conference on Computational Linguistics (COLING 1998), ACL, 1998, pp.\u00a0414\u2013420, https:\/\/www.aclweb.org\/anthology\/C98-1066.","DOI":"10.3115\/980451.980916"},{"key":"10.3233\/SW-222899_ref10","unstructured":"S.\u00a0Goel and K.S.S.\u00a0Grover, From pivots to graphs: Augmented CycleDensity as a generalization to one time inverse consultation, in: Proc. of 4th Translation Inference Across Dictionaries (TIAD 2021) @ LDK\u201921, 2021, [in press]."},{"key":"10.3233\/SW-222899_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62466-8-31"},{"key":"10.3233\/SW-222899_ref12","doi-asserted-by":"publisher","DOI":"10.5281\/ZENODO.3555155"},{"issue":"2","key":"10.3233\/SW-222899_ref13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.3233\/SW-170258","article-title":"The apertium bilingual dictionaries on the web of data","volume":"9","author":"Gracia","year":"2018","journal-title":"Semantic Web"},{"key":"10.3233\/SW-222899_ref14","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1410.0718"},{"issue":"6","key":"10.3233\/SW-222899_ref15","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Algorithm 447: Efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Commun. ACM"},{"key":"10.3233\/SW-222899_ref16","unstructured":"A.\u00a0Irvine and C.\u00a0Callison-Burch, Supervised bilingual lexicon induction with multiple monolingual signals, in: Proc. of NAACL-HLT 2013, Association for Computational Linguistics, 2013, pp.\u00a09\u201314, https:\/\/www.aclweb.org\/anthology\/C98-1066\/."},{"issue":"1","key":"10.3233\/SW-222899_ref17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","article-title":"Finding all the elementary circuits of a directed graph","volume":"4","author":"Johnson","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.3233\/SW-222899_ref18","unstructured":"H.\u00a0Kaji, S.\u00a0Tamamura and D.\u00a0Erdenebat, Automatic construction of a Japanese-Chinese dictionary via English, in: Proc. of the Sixth International Conference on Language Resources and Evaluation (LREC\u201908), European Language Resources Association (ELRA), 2008."},{"key":"10.3233\/SW-222899_ref19","unstructured":"I.\u00a0Kernerman, S.\u00a0Krek, J.P.\u00a0Mccrae, J.\u00a0Gracia, S.\u00a0Ahmadi and B.\u00a0Kabashi, Introduction to the globalex 2020 workshop on linked lexicography, in: Proc of Globalex\u201920 workshop on linked lexicography at LREC 2020, in: ELRA, I.\u00a0Kernerman, S.\u00a0Krek, J.P.\u00a0McCrae, J.\u00a0Gracia, S.\u00a0Ahmadi and B.\u00a0Kabashi, eds, 2020. ISBN 979-10-95546-46-7."},{"key":"10.3233\/SW-222899_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"10.3233\/SW-222899_ref21","unstructured":"G.\u00a0Lample, A.\u00a0Conneau, A.\u00a0Ranzato, L.\u00a0Denoyer and H.\u00a0J\u00e9gou, Word translation without paralell data, in: Proc. of 6th International Conference on Learning Representations (ICRL 2018), 2018."},{"key":"10.3233\/SW-222899_ref22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.17562\/pb-43-6","article-title":"Low cost construction of a multilingual lexicon from bilingual lists","volume":"43","author":"Lim","year":"2011","journal-title":"Polibits"},{"key":"10.3233\/SW-222899_ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1121"},{"key":"10.3233\/SW-222899_ref24","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/N15-1028"},{"key":"10.3233\/SW-222899_ref25","doi-asserted-by":"crossref","unstructured":"Mausam, S.\u00a0Soderland, O.\u00a0Etzioni, D.\u00a0Weld, M.\u00a0Skinner and J.\u00a0Bilmes, Compiling a massive, multilingual dictionary via probabilistic inference, in: Proc. of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, Association for Computational Linguistics, Suntec, Singapore, 2009, pp.\u00a0262\u2013270, https:\/\/www.aclweb.org\/anthology\/P09-1030.","DOI":"10.3115\/1687878.1687917"},{"key":"10.3233\/SW-222899_ref26","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2010.04.020","article-title":"Panlingual lexical translation via probabilistic inference","volume":"174","author":"Mausam","year":"2010","journal-title":"Artificial Intelligence"},{"key":"10.3233\/SW-222899_ref27","unstructured":"J.P.\u00a0McCrae, F.\u00a0Bond, P.\u00a0Buitelaar, P.\u00a0Cimiano, T.\u00a0Declerck, J.\u00a0Gracia, I.\u00a0Kernerman, E.\u00a0Montiel-Ponsoda, N.\u00a0Ordan and M.\u00a0Piasecki\u00a0(eds), Proceedings of LDK Workshops: OntoLex, TIAD and Challenges for Wordnets, 2017, ISSN 1613-0073, http:\/\/ceur-ws.org\/Vol-1899\/."},{"key":"10.3233\/SW-222899_ref28","unstructured":"J.P.\u00a0McCrae, J.\u00a0Bosque-Gil, J.\u00a0Gracia, P.\u00a0Buitelaar and P.\u00a0Cimiano, The OntoLex-lemon model: Development and applications, in: Electronic Lexicography in the 21st Century, Proc. of ELex 2017 Conference, in Leiden, Netherlands, Lexical Computing CZ S.R.O., 2017, pp.\u00a0587\u2013597, ISSN 2533-5626."},{"key":"10.3233\/SW-222899_ref30","doi-asserted-by":"publisher","DOI":"10.3115\/981658.981709"},{"key":"10.3233\/SW-222899_ref31","doi-asserted-by":"publisher","DOI":"10.5555\/2145432.2145526"},{"key":"10.3233\/SW-222899_ref32","doi-asserted-by":"publisher","DOI":"10.3115\/991886.991937"},{"key":"10.3233\/SW-222899_ref33","unstructured":"A.\u00a0Toral, M.\u00a0Ginest\u00ed-Rosell and F.M.\u00a0Tyers, An Italian to Catalan RBMT system reusing data from existing language pairs, in: Proc. of the Second International Workshop on Free\/Open-Source Rule-Based Machine Translation, Barcelona (Spain), 2011, pp.\u00a077\u201381."},{"key":"10.3233\/SW-222899_ref34","unstructured":"M.\u00a0Villegas, M.\u00a0Melero, N.\u00a0Bel and J.\u00a0Gracia, Leveraging RDF graphs for crossing multiple bilingual dictionaries, in: Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC\u201916), 2016, pp.\u00a0868\u2013876."},{"key":"10.3233\/SW-222899_ref35","unstructured":"I.\u00a0Vuli\u0107 and M.-F.\u00a0Moens, A study on bootstrapping bilingual vector spaces from non-parallel data (and nothing else), in: Proc.of the 2013 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics, 2013, pp.\u00a01613\u20131624, https:\/\/www.aclweb.org\/anthology\/D13-1168."},{"issue":"1","key":"10.3233\/SW-222899_ref36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/321679.321684","article-title":"A new search algorithm for finding the simple cycles of a finite directed graph","volume":"19","author":"Weinblatt","year":"1972","journal-title":"J. ACM"},{"issue":"7","key":"10.3233\/SW-222899_ref37","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1073\/pnas.1520752113","article-title":"On the universal structure of human lexical semantics","volume":"113","author":"Youn","year":"2016","journal-title":"Proceedings of the National Academy of Sciences"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-222899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T11:01:14Z","timestamp":1756206074000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-222899"}},"subtitle":[],"editor":[{"given":"Julia","family":"Bosque-Gil","sequence":"additional","affiliation":[{"name":"University of Zaragoza, Spain"}]},{"given":"Milan","family":"Dojchinovski","sequence":"additional","affiliation":[{"name":"Czech Technical University in Prague, Czech Republic"}]},{"given":"Philipp","family":"Cimiano","sequence":"additional","affiliation":[{"name":"Bielefeld University, Germany"}]},{"given":"Julia","family":"Bosque-Gil","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Cimiano","sequence":"additional","affiliation":[]},{"given":"Milan","family":"Dojchinovski","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,9,26]]},"references-count":36,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/sw-222899","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"type":"electronic","value":"2210-4968"},{"type":"print","value":"1570-0844"}],"subject":[],"published":{"date-parts":[[2022,9,26]]}}}