Unsupervised word-sense disambiguation using bilingual comparable corpora

被引:6
作者
Kaji, H [1 ]
Morimoto, Y [1 ]
机构
[1] Hitachi Ltd, Cent Res Lab, Kokubunji, Tokyo 1858601, Japan
关键词
word-sense disambiguation; unsupervised learning; comparable corpora;
D O I
10.1093/ietisy/E88-D.2.289
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An unsupervised method for word-sense disambiguation using bilingual comparable corpora was developed. First, it extracts word associations, i.e., statistically significant pairs of associated words, from the corpus of each language. Then, it aligns word associations by consulting a bilingual dictionary and calculates correlation between senses of a target polysemous word and its associated words, which can be regarded as clues for identifying the sense of the target word. To overcome the problem of disparity of topical coverage between corpora of the two languages as well as the problem of ambiguity in word-association alignment, an algorithm for iteratively calculating a sense-vs.-clue correlation matrix for each target word was devised. Word-sense disambiguation for each instance of the target word is done by selecting the sense that maximizes the score, i.e., a weighted sum of the correlations between each sense and clues appearing in the context of the instance. An experiment using Wall Street Journal and Nihon Keizai Shimbun corpora together with the EDR bilingual dictionary showed that the new method has promising performance; namely, the F-measure of its sense selection was 74.6% compared to a baseline of 62.8%. The developed method will possibly be extended into a fully unsupervised method that features automatic division and definition of word senses.
引用
收藏
页码:289 / 301
页数:13
相关论文
共 50 条
[21]   Unsupervised Hindi Word Sense Disambiguation based on Network Agglomeration [J].
Jain, Amita ;
Lobiyal, D. K. .
2015 2ND INTERNATIONAL CONFERENCE ON COMPUTING FOR SUSTAINABLE GLOBAL DEVELOPMENT (INDIACOM), 2015, :195-200
[22]   Unsupervised word sense disambiguation with N-gram features [J].
Preotiuc-Pietro, Daniel ;
Hristea, Florentina .
ARTIFICIAL INTELLIGENCE REVIEW, 2014, 41 (02) :241-260
[23]   A clustering-based Approach for Unsupervised Word Sense Disambiguation [J].
Martin-Wanton, Tamara ;
Berlanga-Llavori, Rafael .
PROCESAMIENTO DEL LENGUAJE NATURAL, 2012, (49) :49-56
[24]   Unsupervised word sense disambiguation with N-gram features [J].
Daniel Preotiuc-Pietro ;
Florentina Hristea .
Artificial Intelligence Review, 2014, 41 :241-260
[25]   An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation [J].
Navigli, Roberto ;
Lapata, Mirella .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (04) :678-692
[26]   Word Sense Disambiguation using KeNet [J].
Cetiner, Meltem ;
Yildirim, Ahmet ;
Onay, Bahadir ;
Oksuz, Cuneyt .
29TH IEEE CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS (SIU 2021), 2021,
[27]   Unsupervised similarity-based word sense disambiguation using context vectors and sentential word importance [J].
Abdalgader, Khaled ;
Skabar, Andrew .
ACM Transactions on Speech and Language Processing, 2012, 9 (01)
[28]   A semantic matching energy function for learning with multi-relational dataApplication to word-sense disambiguation [J].
Antoine Bordes ;
Xavier Glorot ;
Jason Weston ;
Yoshua Bengio .
Machine Learning, 2014, 94 :233-259
[29]   Vector Disambiguation for Translation Extraction from Comparable Corpora [J].
Apidianaki, Marianna ;
Ljubesic, Nikola ;
Fiser, Darja .
INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2013, 37 (02) :193-202
[30]   Word Sense Disambiguation Using Clustered Sense Labels [J].
Park, Jeong Yeon ;
Shin, Hyeong Jin ;
Lee, Jae Sung .
APPLIED SCIENCES-BASEL, 2022, 12 (04)