Skip to main content
Article thumbnail
Location of Repository

Selecting the Most Highly Correlated Pairs within a Large Vocabulary

By Kyoji Umemura

Abstract

Occurence patterns of words in documents can be expressed as binary vectors. When two vectors are similar, the two words corresponding to the vectors may have some implicit relationship with each other. We call these two words a correlated pair. This report describes a method for obtaining the most highly correlated pairs of a given size. In practice, the method requires ¢¡¤£¦¥¨§�©���¡¤£��� � computation time, and ¢¡¤£� � memory space, where

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.7559
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.ust.hk/~hltc/sem... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.