The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Gauging Similarity with n -Grams: Language-Independent Categorization of Text
Abstract
A language-independent means of gauging topical similarity in unrestricted text is described. The method combines information derived from n -grams (consecutive sequences of n characters) with a simple vector-space technique that makes sorting, categorization, and retrieval feasible in a large multilingual collection of documents. No prior information about document content or language is required. Context, as it applies to document similarity, can be accommodated by a well-defined procedure. When an existing document is used as an exemplar, the completeness and accuracy with which topically related documents are retrieved is comparable to that of the best existing systems. The results of a formal evaluation are discussed, and examples are given using documents in English and Japanese.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
N-gram-based text categorization
Cavnar, W. B., & Trenkle, J. M. (1994) · Cited by 2,060
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Developments in Automatic Text Retrieval
Salton, G. (1991) · Science · doi:10.1126/science.253.5023.974 · Cited by 619
A re-examination of relevance: toward a dynamic, situational definition∗
Schamber, L., Eisenberg, M. B., & Nilan, M. S. (1990) · Information Processing & Management · doi:10.1016/0306-4573(90)90050-c · Cited by 426
Overview of the third text Retrieval conference (TREC-3)
Harman, D. K. (1995) · doi:10.6028/nist.sp.500-225 · Cited by 378
Computer programs for detecting and correcting spelling errors
Peterson, J. L. (1980) · Communications of the ACM · doi:10.1145/359038.359041 · Cited by 334
Automatic Analysis, Theme Generation, and Summarization of Machine-Readable Texts
Salton, G., Allan, J., Buckley, C., & Singhal, A. (1994) · Science · doi:10.1126/science.264.5164.1421 · Cited by 265
Automatic spelling correction using a trigram similarity measure
Angell, R. C., Freund, G. E., & Willett, P. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90022-5 · Cited by 175
The use of trigram analysis for spelling error detection
Zamora, E. M., Pollock, J. J., & Zamora, A. (1981) · Information Processing & Management · doi:10.1016/0306-4573(81)90044-3 · Cited by 118
The second text REtrieval conference (TREC-2)
(1993) · doi:10.6028/nist.sp.500-215 · Cited by 81
Cited by
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Detecting intrusions using system calls: alternative data models
Warrender, C., Forrest, S., & Pearlmutter, B. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766910 · Cited by 1,106
Anomalous Payload-Based Network Intrusion Detection
Wang, K., & Stolfo, S. J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30143-1_11 · Cited by 842
Use of K-Nearest Neighbor classifier for intrusion detection
Liao, Y., & Vemuri, V. R. (2002) · Computers & Security · doi:10.1016/s0167-4048(02)00514-x · Cited by 802
Automatic analysis of malware behavior using machine learning
Rieck, K., Trinius, P., Willems, C., & Holz, T. (2011) · Journal of Computer Security · doi:10.3233/jcs-2010-0410 · Cited by 729
Metadata
- Authors
- Damashek, M.
- Venue
- Science
- Published
- 1995-02-10
- Volume
- 267
- Issue
- 5199
- Pages
- 843-848
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2078396547
- Cited by
- 534
- References
- 13
- FWCI
- 12.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.