Graph-based Analysis of Semantic Drift in Espresso-like Bootstrapping Algorithms

Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of bootstrapping has the same root as the topic drift of Kleinberg's HITS, using a simplified graphbased reformulation of bootstrapping. We confirm that two graph-based algorithms, the von Neumann kernels and the regularized Laplacian, can reduce semantic drift in the task of word sense disambiguation (WSD) on Senseval-3 English Lexical Sample Task. Proposed algorithms achieve superior performance to Espresso and previous graph-based WSD methods, even though the proposed algorithms have less parameters and are easy to calibrate.

• Type: Conference
• Year: 2008
• Where: EMNLP
• Authors: Mamoru Komachi, Taku Kudo, Masashi Shimbo, Yuji Matsumoto
• Keywords: EMNLP 2008, Graph-based Algorithms, Natural Language Processing, Semantic Drift, Topic Drift