Locating digital coded words which are both acceptable misspellings and acceptable inflections of digital coded query words
February 12, 2002. 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.Patent ReferencesApparatus for the automatic classifying and finding of groupings of series of distinguishing signs according to the risks of conflict they involve with given groupings Word recognition apparatus Spelled word input directory information retrieval system with input word error corrective searching Device for recognizing an input pattern with approximate patterns used for reference patterns on mapping Information storage and retrieval system Automated information input, storage, and retrieval system Alpha content match prescan method for automatic spelling error correction Electronic dictionary and language interpreter with faculties of examining a full-length word based on a partial word entered and of displaying the total word and a translation corresponding thereto Stem processing for data reduction in a dictionary storage file Spelled word recognizer Patent #: 4355302 InventorsApplicationNo. 06/307571 filed on 09/30/1981US Classes:715/533Spell CheckExaminersPrimary: Zache, Raulfe B.Attorney, Agent or FirmInternational ClassesG06F 17/27 (20060101)G06F 17/30 (20060101) AbstractA method is disclosed using a digital data processing means for determining from a plurality of candidate words at least one which is both an acceptable spelling and an acceptable inflection of a query word. The words are represented by machine readable coded signals and comprise plural characters. The steps are as follows: Determine a stem portion of such query word. Form a suffix class indication for any one of a plurality of classes in which the query word may be included. Compare the determined query stem with characters in the beginning of such candidate words for finding acceptable and nonacceptable spelling matches. Determine an ending portion, if any, in each individual candidate words which is an acceptable spelling match. Utilize the suffix class indication to select a representation of at least one acceptable suffix for the candidate words. Compare a representation of the at least one selected acceptable suffix and the determined ending portions in the individual candidate words which are acceptable spelling matches to determine at least one predetermined acceptable relation therebetween.Other References
| |
