{"id":"https://openalex.org/W2186446900","doi":"https://doi.org/10.1162/tacl_a_00217","title":"Dijkstra-WSA: A Graph-Based Approach to Word Sense Alignment","display_name":"Dijkstra-WSA: A Graph-Based Approach to Word Sense Alignment","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2186446900","doi":"https://doi.org/10.1162/tacl_a_00217","mag":"2186446900"},"language":"en","primary_location":{"id":"doi:10.1162/tacl_a_00217","is_oa":true,"landing_page_url":"https://doi.org/10.1162/tacl_a_00217","pdf_url":null,"source":{"id":"https://openalex.org/S2729999759","display_name":"Transactions of the Association for Computational Linguistics","issn_l":"2307-387X","issn":["2307-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transactions of the Association for Computational Linguistics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1162/tacl_a_00217","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013126220","display_name":"Michael Matuschek","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Matuschek","raw_affiliation_strings":["Ubiquitous Knowledge Processing Lab (UKP-TUDA), Department of Computer                         Science, Technische Universit\u00e4t Darmstadt, Hochschulstr. 10, 64289                         Darmstadt, Germany,"],"affiliations":[{"raw_affiliation_string":"Ubiquitous Knowledge Processing Lab (UKP-TUDA), Department of Computer                         Science, Technische Universit\u00e4t Darmstadt, Hochschulstr. 10, 64289                         Darmstadt, Germany,","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027450194","display_name":"Iryna Gurevych","orcid":"https://orcid.org/0000-0003-2187-7621"},"institutions":[{"id":"https://openalex.org/I4210138519","display_name":"DIPF | Leibniz Institute for Research and Information in Education","ror":"https://ror.org/0327sr118","country_code":"DE","type":"facility","lineage":["https://openalex.org/I315704651","https://openalex.org/I4210138519"]},{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Iryna Gurevych","raw_affiliation_strings":["Ubiquitous Knowledge Processing Lab (UKP-DIPF), German Institute                         for Educational Research and Educational Information, Schlo\u00dfstr. 29, 60486                         Frankfurt, Germany","Ubiquitous Knowledge Processing Lab (UKP-TUDA), Department of                         Computer Science, Technische Universit\u00e4t Darmstadt, Hochschulstr. 10, 64289                         Darmstadt, Germany,"],"affiliations":[{"raw_affiliation_string":"Ubiquitous Knowledge Processing Lab (UKP-DIPF), German Institute                         for Educational Research and Educational Information, Schlo\u00dfstr. 29, 60486                         Frankfurt, Germany","institution_ids":["https://openalex.org/I4210138519"]},{"raw_affiliation_string":"Ubiquitous Knowledge Processing Lab (UKP-TUDA), Department of                         Computer Science, Technische Universit\u00e4t Darmstadt, Hochschulstr. 10, 64289                         Darmstadt, Germany,","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013126220"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":9.8847,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.9794536,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"1","issue":null,"first_page":"151","last_page":"164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":1.0,"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":1.0,"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/T10028","display_name":"Topic Modeling","score":0.9998999834060669,"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/T13629","display_name":"Text Readability and Simplification","score":0.9943000078201294,"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/wordnet","display_name":"WordNet","score":0.952787458896637},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.881794810295105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8677397966384888},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5779460072517395},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5444262623786926},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.5194920301437378},{"id":"https://openalex.org/keywords/word-sense-disambiguation","display_name":"Word-sense disambiguation","score":0.4476187527179718},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.42293819785118103},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2787228226661682},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.08726322650909424}],"concepts":[{"id":"https://openalex.org/C157659113","wikidata":"https://www.wikidata.org/wiki/Q533822","display_name":"WordNet","level":2,"score":0.952787458896637},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.881794810295105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8677397966384888},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5779460072517395},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5444262623786926},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5194920301437378},{"id":"https://openalex.org/C51646954","wikidata":"https://www.wikidata.org/wiki/Q48522","display_name":"Word-sense disambiguation","level":3,"score":0.4476187527179718},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.42293819785118103},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2787228226661682},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.08726322650909424}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1162/tacl_a_00217","is_oa":true,"landing_page_url":"https://doi.org/10.1162/tacl_a_00217","pdf_url":null,"source":{"id":"https://openalex.org/S2729999759","display_name":"Transactions of the Association for Computational Linguistics","issn_l":"2307-387X","issn":["2307-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transactions of the Association for Computational Linguistics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.2423","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.2423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://wing.comp.nus.edu.sg/~antho/Q/Q13/Q13-1013.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:baf93b2ebd0c4b2e9b8e9f5fb042ad77","is_oa":true,"landing_page_url":"https://doaj.org/article/baf93b2ebd0c4b2e9b8e9f5fb042ad77","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Transactions of the Association for Computational Linguistics, Vol 1 (2021)","raw_type":"article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:104664","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/104664/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel"}],"best_oa_location":{"id":"doi:10.1162/tacl_a_00217","is_oa":true,"landing_page_url":"https://doi.org/10.1162/tacl_a_00217","pdf_url":null,"source":{"id":"https://openalex.org/S2729999759","display_name":"Transactions of the Association for Computational Linguistics","issn_l":"2307-387X","issn":["2307-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Transactions of the Association for Computational Linguistics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1480330719","https://openalex.org/W1572567744","https://openalex.org/W1572864191","https://openalex.org/W1576423642","https://openalex.org/W1750338658","https://openalex.org/W1960027552","https://openalex.org/W2038721957","https://openalex.org/W2055518963","https://openalex.org/W2061287937","https://openalex.org/W2109914305","https://openalex.org/W2114544510","https://openalex.org/W2117805756","https://openalex.org/W2120699290","https://openalex.org/W2143347091","https://openalex.org/W2169528473","https://openalex.org/W2250202867","https://openalex.org/W2251625570","https://openalex.org/W2276318411","https://openalex.org/W3089269909","https://openalex.org/W3105419723"],"related_works":["https://openalex.org/W189413142","https://openalex.org/W2480501668","https://openalex.org/W103065337","https://openalex.org/W2109049551","https://openalex.org/W2186446900","https://openalex.org/W2772864957","https://openalex.org/W4288373537","https://openalex.org/W1561908597","https://openalex.org/W2252015905","https://openalex.org/W2153346776"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"Dijkstra-WSA,":[5],"a":[6,60],"novel":[7],"graph-based":[8],"algorithm":[9],"for":[10,85],"word":[11],"sense":[12],"alignment.":[13],"We":[14,66],"evaluate":[15],"it":[16,35,56],"on":[17,39,52,63],"four":[18],"different":[19,25,77],"pairs":[20],"of":[21,42,49],"lexical-semantic":[22],"resources":[23,78],"with":[24,59],"characteristics":[26],"(WordNet-OmegaWiki,":[27],"WordNet-Wiktionary,":[28],"GermaNet-Wiktionary":[29],"and":[30,32],"WordNet-Wikipedia)":[31],"show":[33],"that":[34,69],"achieves":[36],"competitive":[37],"performance":[38],"3":[40],"out":[41],"4":[43],"datasets.":[44],"Dijkstra-WSA":[45,70],"outperforms":[46],"the":[47,50],"state":[48],"art":[51],"every":[53],"dataset":[54],"if":[55],"is":[57,71],"combined":[58],"back-off":[61],"based":[62],"gloss":[64],"similarity.":[65],"also":[67,80],"demonstrate":[68],"not":[72],"only":[73],"flexibly":[74],"applicable":[75],"to":[76,83],"but":[79],"highly":[81],"parameterizable":[82],"optimize":[84],"precision":[86],"or":[87],"recall.":[88]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}