Collocation map for overcoming data sparseness

  • Authors:
  • Moonjoo Kim;Young S. Han;Key-Sun Choi

  • Affiliations:
  • Korea Advanced Institute of Science and Technology, Taejon, Korea;Korea Advanced Institute of Science and Technology, Taejon, Korea;Korea Advanced Institute of Science and Technology, Taejon, Korea

  • Venue:
  • EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Statistical language models are useful because they can provide probabilistic information upon uncertain decision making. The most common statistic is n-grams measuring word cooccurrences in texts. The method suffers from data shortage problem, however. In this paper, we suggest Bayesian networks be used in approximating the statistics of insufficient occurrences and of those that do not occur in the sample texts with graceful degradation. Collocation map is a sigmoid belief network that can be constructed from bigrams. We compared the conditional probabilities and mutual information computed from bigrams and Collocation map. The results show that the variance of the values from Collocation map is smaller than that from frequency measure for the infrequent pairs by 48%. The predictive power of Collocation map for arbitrary associations not observed from sample texts is also demonstrated.