Lexical Sense Alignment using Weighted Bipartite b-Matching

Sina Ahmadi

Research output: Chapter in Book or Conference Publication/ProceedingConference Publicationpeer-review

Abstract

In this study, we present a similarity-based approach for lexical sense alignment in WordNet and Wiktionary with a focus on the polysemous items. Our approach relies on semantic textual similarity using features such as string distance metrics and word embeddings, and a graph matching algorithm. Transforming the alignment problem into a bipartite graph matching enables us to apply graph matching algorithms, in particular, weighted bipartite b-matching (WBbM).
Original languageEnglish (Ireland)
Title of host publication2nd Conference on Language, Data and Knowledge (LDK 2019)
Place of PublicationLeipzig, Germany
DOIs
Publication statusPublished - 1 May 2019

Authors (Note for portal: view the doc link for the full list of authors)

  • Authors
  • Ahmadi, Sina; Arcan, Mihael; McCrae, John

Fingerprint

Dive into the research topics of 'Lexical Sense Alignment using Weighted Bipartite b-Matching'. Together they form a unique fingerprint.

Cite this