Digital data processing method and means for word classification by pattern analysis

Patent 4471459 Issued on September 11, 1984. Estimated Expiration Date:

September 30, 2001. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Abstract Claims Description Full Text

Patent References

3648249

3707725

Apparatus for automatically forming hyphenated words
Patent #: 4092729
Issued on: 05/30/1978
Inventor: Rosenbaum, et al.

Electronic dictionary and language interpreter
Patent #: 4158236
Issued on: 06/12/1979
Inventor: Levy

Portable electronic language translation device Patent #: 4159536
Issued on: 06/26/1979
Inventor: Kehoe , et al.

Inventors

Assignee

System Development Corporation

Application

No. 06/307631 filed on 09/30/1981

US Classes:

715/533Spell Check

Examiners

Primary: Smith, Jerry
Assistant: Fleming, Michael R.

Attorney, Agent or Firm

Christie, Parker & Hale

International Class

G06F 17/27 (20060101)

Abstract

Digital data processing means employing a method for separating acceptable spellings of words from nonacceptable spellings wherein each word comprises characters assigned positions. The character positions in each word are assigned increasing values from one end of the word to the other, positions of the same number of characters from the same end of each word being assigned the same value. Two words to be compared are called a query word and a candidate word. The method includes the following steps. A representation of a character in a given position of the query word is compared with representations of characters in the next lower position, the same position, and the next higher position in the candidate word and a compare type indication is formed representing a match or a mismatch between each query word character and the candidate word characters under comparison. The given position of the query word under comparison is changed to the next higher valued position of the query word and the preceding step is repeated to form another compare type indication. The compare type indications are processed to thereby form a spelling classification indication for one of the words under comparison representing an acceptable spelling or a nonacceptable spelling with respect to the other.

Other References

Morgan, "Spelling Corrections in Systems Programs", Communication of the ACM, vol. 13, No. 2, 2/70-pp. 90-94
Damerau, "A Technique for Computer Detection and Correction of Spelling Errors", Communication of the ACM, vol. 17, No. 3, 3/64, pp. 171-176
"Computer Programs for Detecting and Correcting Spelling Errors", Communication of the ACM, vol. 23, No. 12, 12/80
Alberga, "String Similarity and Misspellings", Communication of the ACM, vol. 10, No. 5, 5/67-pp. 302-313
Speedcop; Task B2, Automatic Correction of Misspellings, by Joseph J. Pollock, May, 1981, pp. 1-62
The String-to-String Correction Problem, by Robert A. Wagner and Michael J. Fischer, Journal of the Association for Computing Machinery (1974), vol. 21, pp. 168-173
An Extension of the String-to-String Correction Problem, by Roy Lowrance and Robert A. Wagner, Journal of the Association for Computing Machinery (1975), vol. 22, pp. 177-183
A Binary n-Gram Technique for Automatic Correction of Substitution, Deletion, Insertion and Reversal Errors in Words, by J. R. Ullmann, The Computer Journal (1977), vol. 20, pp. 141-147