{"id":"https://openalex.org/W2243775030","doi":"https://doi.org/10.1145/2723144","title":"A Constraint Approach to Pivot-Based Bilingual Dictionary Induction","display_name":"A Constraint Approach to Pivot-Based Bilingual Dictionary Induction","publication_year":2015,"publication_date":"2015-11-21","ids":{"openalex":"https://openalex.org/W2243775030","doi":"https://doi.org/10.1145/2723144","mag":"2243775030"},"language":"en","primary_location":{"id":"doi:10.1145/2723144","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2723144","pdf_url":null,"source":{"id":"https://openalex.org/S4306421405","display_name":"ACM Transactions on Asian and Low-Resource Language Information Processing","issn_l":"2375-4699","issn":["2375-4699","2375-4702"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Asian and Low-Resource Language Information Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041117198","display_name":"Mairidan Wushouer","orcid":"https://orcid.org/0000-0002-9480-6915"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Mairidan Wushouer","raw_affiliation_strings":["Department of Social Informatics, Kyoto University"],"affiliations":[{"raw_affiliation_string":"Department of Social Informatics, Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012774046","display_name":"Donghui Lin","orcid":"https://orcid.org/0000-0001-9462-0216"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Donghui Lin","raw_affiliation_strings":["Department of Social Informatics, Kyoto University"],"affiliations":[{"raw_affiliation_string":"Department of Social Informatics, Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100678332","display_name":"Toru Ishida","orcid":"https://orcid.org/0000-0002-0479-4990"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toru Ishida","raw_affiliation_strings":["Department of Social Informatics, Kyoto University"],"affiliations":[{"raw_affiliation_string":"Department of Social Informatics, Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076865709","display_name":"Katsutoshi Hirayama","orcid":"https://orcid.org/0000-0002-6656-5819"},"institutions":[{"id":"https://openalex.org/I230604491","display_name":"California Maritime Academy","ror":"https://ror.org/051rrf637","country_code":"US","type":"education","lineage":["https://openalex.org/I230604491"]},{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"Katsutoshi Hirayama","raw_affiliation_strings":["Graduate School of Maritime Sciences, Kobe University"],"affiliations":[{"raw_affiliation_string":"Graduate School of Maritime Sciences, Kobe University","institution_ids":["https://openalex.org/I65837984","https://openalex.org/I230604491"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5041117198"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":3.0202,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92769308,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7219641208648682},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6719712615013123},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.640741229057312},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5557947754859924},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.5355809330940247},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5239318013191223},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5134285688400269},{"id":"https://openalex.org/keywords/bilingual-dictionary","display_name":"Bilingual dictionary","score":0.4598759710788727},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4220472574234009},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40345942974090576},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.4021497368812561},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.39415815472602844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3245232105255127},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3051770031452179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19772553443908691},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.13844949007034302}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7219641208648682},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6719712615013123},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.640741229057312},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5557947754859924},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.5355809330940247},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5239318013191223},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5134285688400269},{"id":"https://openalex.org/C2779235283","wikidata":"https://www.wikidata.org/wiki/Q2640207","display_name":"Bilingual dictionary","level":2,"score":0.4598759710788727},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4220472574234009},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40345942974090576},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4021497368812561},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39415815472602844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3245232105255127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3051770031452179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19772553443908691},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.13844949007034302},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2723144","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2723144","pdf_url":null,"source":{"id":"https://openalex.org/S4306421405","display_name":"ACM Transactions on Asian and Low-Resource Language Information Processing","issn_l":"2375-4699","issn":["2375-4699","2375-4702"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Asian and Low-Resource Language Information Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8399999737739563,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W70050165","https://openalex.org/W71111251","https://openalex.org/W113606665","https://openalex.org/W125890617","https://openalex.org/W145302864","https://openalex.org/W149643677","https://openalex.org/W181901128","https://openalex.org/W1487469339","https://openalex.org/W1492520342","https://openalex.org/W1511963917","https://openalex.org/W1531103278","https://openalex.org/W1544567521","https://openalex.org/W1590839732","https://openalex.org/W1615720819","https://openalex.org/W1626233182","https://openalex.org/W1630726320","https://openalex.org/W1963547452","https://openalex.org/W1980630354","https://openalex.org/W1992297672","https://openalex.org/W2002055996","https://openalex.org/W2002275558","https://openalex.org/W2005254050","https://openalex.org/W2007898830","https://openalex.org/W2024181699","https://openalex.org/W2036265926","https://openalex.org/W2040376833","https://openalex.org/W2054458431","https://openalex.org/W2072976288","https://openalex.org/W2084988910","https://openalex.org/W2087572620","https://openalex.org/W2092670679","https://openalex.org/W2095202147","https://openalex.org/W2095821893","https://openalex.org/W2097333193","https://openalex.org/W2100609826","https://openalex.org/W2102749417","https://openalex.org/W2103042430","https://openalex.org/W2106435568","https://openalex.org/W2114368451","https://openalex.org/W2114579619","https://openalex.org/W2121415745","https://openalex.org/W2123595463","https://openalex.org/W2130821241","https://openalex.org/W2133530649","https://openalex.org/W2138753018","https://openalex.org/W2138787466","https://openalex.org/W2140406733","https://openalex.org/W2155983311","https://openalex.org/W2163108352","https://openalex.org/W2169360026","https://openalex.org/W2251446999","https://openalex.org/W2497534763","https://openalex.org/W2506991895","https://openalex.org/W2740532984","https://openalex.org/W2994131038","https://openalex.org/W3170253630","https://openalex.org/W3197645311"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W3124721760","https://openalex.org/W2115480761","https://openalex.org/W2332241156","https://openalex.org/W2408080066","https://openalex.org/W2014111643","https://openalex.org/W2498042365","https://openalex.org/W2796388654","https://openalex.org/W2049271502","https://openalex.org/W2085380335"],"abstract_inverted_index":{"High-quality":[0],"bilingual":[1,42,70,166,202],"dictionaries":[2,43,117],"are":[3,9,20,101,156],"very":[4],"useful,":[5],"but":[6],"such":[7],"resources":[8],"rarely":[10],"available":[11],"for":[12,17],"lower-density":[13],"language":[14,26,97,108,150],"pairs,":[15],"especially":[16],"those":[18],"that":[19,181],"closely":[21,102],"related.":[22,103],"Using":[23],"a":[24,33,75,89,119,159,174,179],"third":[25],"to":[27,47,62,92,161,190],"link":[28],"two":[29,40],"other":[30],"languages":[31],"is":[32,74,124],"well-known":[34],"solution":[35],"and":[36,45,72,99,110,194],"usually":[37],"requires":[38],"only":[39],"input":[41,69,116,149],"A-B":[44],"B-C":[46],"automatically":[48],"induce":[49],"the":[50,64,68,79,84,112,115,128,141,147,163,183,187,200,208],"new":[51],"one,":[52],"A-C":[53],".":[54],"This":[55,86],"approach,":[56],"however,":[57],"has":[58],"never":[59],"been":[60],"demonstrated":[61],"utilize":[63],"complete":[65],"structures":[66,113],"of":[67,114,135,140,151],"dictionaries,":[71],"this":[73],"key":[76],"failing":[77],"because":[78],"dropped":[80],"meanings":[81],"negatively":[82],"influence":[83],"result.":[85],"article":[87],"proposes":[88],"constraint":[90],"approach":[91],"pivot-based":[93],"dictionary":[94,203],"induction":[95],"where":[96],"A":[98],"C":[100],"We":[104,177],"create":[105],"constraints":[106],"from":[107],"similarity":[109],"model":[111],"as":[118,173,186],"Boolean":[120,136],"optimization":[121],"problem,":[122],"which":[123,199],"then":[125],"formulated":[126],"within":[127],"Weighted":[129],"Partial":[130],"Max-SAT":[131],"framework,":[132],"an":[133,196],"extension":[134],"Satisfiability":[137],"(SAT).":[138],"All":[139],"encoded":[142],"CNF":[143],"(Conjunctive":[144],"Normal":[145],"Form),":[146],"predominant":[148],"modern":[152],"SAT/MAX-SAT":[153],"solvers,":[154],"formulas":[155],"evaluated":[157],"by":[158],"solver":[160,189],"produce":[162],"target":[164],"(output)":[165],"dictionary.":[167],"Moreover,":[168],"we":[169],"discuss":[170],"alternative":[171],"formalizations":[172],"comparison":[175],"study.":[176],"designed":[178],"tool":[180],"uses":[182],"Sat4j":[184],"library":[185],"default":[188],"implement":[191],"our":[192],"method":[193],"conducted":[195],"experiment":[197],"in":[198],"output":[201],"achieved":[204],"better":[205],"quality":[206],"than":[207],"baseline":[209],"method.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}