Graph-based Word Sense Disambiguation

10
Tăbăranu Elena-Oana 1 Unsupervised Graph-based Word Sense Disambiguation Using Measures of Word Semantic Similarity

description

Unsupervised Graph-basedWord Sense DisambiguationUsing Measures of WordSemantic Similarity

Transcript of Graph-based Word Sense Disambiguation

Page 1: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 1

Unsupervised Graph-based Word Sense Disambiguation

Using Measures of Word Semantic Similarity

Page 2: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 2

Bibliography

● Ravi Sinha and Rada Mihalcea, Unsupervised Graph-based Word Sense Disambiguation Using Measures of Word Semantic Similarity, In Proceedings of the IEEE International Conference on Semantic Computing (ICSC 2007), Irvine, CA, September 2007

● Rada Mihalcea, Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling, In Proceedings of the Joint Conference on Human Language Technology / Empirical Methods in Natural Language Processing (HLT/EMNLP), Vancouver, October, 2005

Page 3: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 3

Plan

1. Introduction2. Graph-based Centrality for WSD3. Measures of Semantic Similarity4. Graph-based Centrality Algorithms5. Demo

Page 4: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 4

1. Introduction

● WSD = assign automatically the most appropriate meaning to a polysemous word within a given context ● Example: 1. The plant is producing far too little to sustain its operation for more than a year. (fabrică) 2. An overabundance of oxygen was produced by the plant in the third week of the study. (plantă)

Page 5: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 5

2. Graph-based Centrality for WSD(I)

● GWSD = graph representation used to model word sense dependencies in text (WSD with graphs, not just word window)● Goal: identify the most probable sense (label) for each word

Page 6: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 6

2. Graph-based Centrality for WSD(II)

Page 7: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 7

ExampleThe church bells no longer rung on Sundays.● church

1: one of the groups of Christians who have their own beliefs and forms of worship

2: a place for public (especially Christian) worship3: a service conducted in a church

● bell1: a hollow device made of metal that makes a ringing sound when struck2: a push button at an outer door that gives a ringing or buzzing signal when

pushed3: the sound of a bell

● ring1: make a ringing sound2: ring or echo with sound3: make (bells) ring, often for the purposes of musical edification

● Sunday1: first day of the week; observed as a day of rest and worship

by most Christians

Page 8: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 8

3.Measures of Semantic Similarity● Quantify the degree to which two words are semantically relatedusing information drawn from semantic networks● Word similarity measures

1. Leacock & Chodorow

2. Leck

3. Wu and Palmer

4. Resnik

5. Lin

6. Jiang & Conrath

Page 9: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 9

4.Graph-based Centrality Algorithms

● Indegree

● Closeness

● Betweenness

● Page Rank

Page 10: Graph-based Word Sense Disambiguation

Tăbăranu Elena-Oana 10

5. Demo - GWSD

●Dependencies● WordNet (semantic hierarchy)● WordNet::QueryData● WordNet::Similarity(implementation of similarity measures)

●Input● Senseval-2, Senseval-3 datasets in Semcor format

●GWSD improvements● Combine similarity measures(jcn for nouns, lch for verbs,

lesk for other parts of speech)● Voting system between 4 centrality algorithms