Applications of n‐grams in textual information systems
Authors:
- 1 March 1998
- journal article
- Published by Emerald Publishing in Journal of Documentation
- Vol. 54 (1) , 48-67
Abstract
This paper provides an introduction to the use of n‐grams in textual information systems, where an n‐gram is a string of n, usually adjacent, characters extracted from a section of continuous text. Applications that can be implemented efficiently and effectively using sets of n‐grams include spelling error detection and correction, query expansion, information retrieval with serial, inverted and signature files, dictionary look‐up, text compression, and language identification.Keywords
This publication has 77 references indexed in Scilit:
- n-Grams and their implication to natural language understandingPattern Recognition, 1990
- Interfacing criteria for recognition logic used with a context post-processorPattern Recognition, 1982
- A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in wordsThe Computer Journal, 1977
- Variety generation—A reinterpretation of Shannon's mathematical theory of communication, and its implications for information scienceJournal of the American Society for Information Science, 1977
- A Contextual Postprocessing System for Error Correction Using Binary n-GramsIEEE Transactions on Computers, 1974
- Selection of equifrequent word fragments for information retrievalInformation Storage and Retrieval, 1973
- Analysis of the microstructure of titles in the inspec data-baseInformation Storage and Retrieval, 1973
- The identification of variable-length, equifrequent character strings in a natural language data baseThe Computer Journal, 1972
- Contextual Word Recognition Using Binary DigramsIEEE Transactions on Computers, 1971
- A study of the statistics of letters in English wordsInformation and Control, 1961