Mutual Screening Graph Algorithm: A New Bootstrapping Algorithm for Lexical Acquisition

  • Authors:
  • Yuhan Zhang;Yanquan Zhou

  • Affiliations:
  • Research Center of Intelligence Science and Technology, Beijing University of Posts and Telecommunications, Beijing, China 100876;Research Center of Intelligence Science and Technology, Beijing University of Posts and Telecommunications, Beijing, China 100876

  • Venue:
  • AIRS '09 Proceedings of the 5th Asia Information Retrieval Symposium on Information Retrieval Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.02

Visualization

Abstract

Bootstrapping is a weakly supervised algorithm that has been the focus of attention in many Information Extraction(IE) and Natural Language Processing(NLP) fields, especially in learning semantic lexicons. In this paper, we propose a new bootstrapping algorithm called Mutual Screening Graph Algorithm (MSGA) to learn semantic lexicons. The approach uses only unannotated corpus and a few of seed words to learn new words for each semantic category. By changing the format of extracted patterns and the method for scoring patterns and words, we improve the former bootstrapping algorithm. We also evaluate the semantic lexicons produced by MSGA with previous bootstrapping algorithm Basilisk [1] and GMR (Graph Mutual Reinforcement based Bootstrapping) [4]. Experiments have shown that MSGA can outperform those approaches.