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
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.