Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus (1998)
Cached
Download Links
- [www.milab.is.tsukuba.ac.jp]
- [acl.ldc.upenn.edu]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | Computational Linguistics |
| Citations: | 41 - 0 self |
BibTeX
@ARTICLE{Yamamoto98usingsuffix,
author = {Mikio Yamamoto and Kenneth W. Church},
title = {Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus},
journal = {Computational Linguistics},
year = {1998},
volume = {27},
pages = {28--37}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Mutual Information (MI) and similar measures are often used in corpus-based linguistics to find interesting ngrams. MI looks for bigrams whose term frequency (tf) is larger than chance. Residual Inverse Document Frequency (RIDF) is similar, but it looks for ngrams whose document frequency (df) is larger than chance. Previous studies have tended to focus on relatively short ngrams, typically bigrams and trigrams. In this paper, we will show that this approach can be extended to arbitrarily long ngrams.
Citations
No citations identified.
