Some parameters that characterize the natural language text behavior for typical structuring of a dictionary have been defined. The typical structure of the dictionary considered here is based on trie structure employing digital search. Digital search is well-suited for applications like optical character recognition. The dictionary uses three partitions in its structure. The first partition carries most frequently used words completely represented in trie structure in the main memory. In the second partition only a part of word is stored in trie structure and the rest is stored in suitable tail structures also in the main memory. In the third partition, a still smaller part of the word is held in trie structure, and the rest of the words are held in files on secondary storage device. The parameters defined are the trie nonutility factor, giving a measure of effectiveness of trie structure; the streaming factor, giving a measure of the common part that exist at the beginning of the word; the node-utilization factor, giving a measure of the extent to which multilink node structure is suited as trie node; and the dispersion factor, giving a measure of the average number of elements in the tail structures. The plots of these parameters act as characteristic curves, much like device characteristics curves, which help the designer to evaluate his choice in terms of memory requirements. These characteristic curves have been obtained using the most commonly cited collection for English text called the Brown Corpus.
[1]
Sargur N. Srihari,et al.
Integrating diverse knowledge sources in text recognition
,
1982,
TOIS.
[2]
Ching Y. Suen,et al.
n-Gram Statistics for Natural Language Understanding and Text Processing
,
1979,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3]
James L. Peterson,et al.
Computer programs for detecting and correcting spelling errors
,
1980,
CACM.
[4]
M. D. McIlroy,et al.
Development of a Spelling List
,
1982,
IEEE Trans. Commun..
[5]
Sargur N. Srihari,et al.
An Integrated Algorithm for Text Recognition: Comparison with a Cascaded Algorithm
,
1983,
IEEE Transactions on Pattern Analysis and Machine Intelligence.