Search improvements for electronic spelling machine

• US 5,113,340 A
• Filed: 05/25/1988
• Issued: 05/12/1992
• Est. Priority Date: 05/25/1988
• Status: Expired due to Fees

• Current Assignee: Franklin Electronic Publishers Incorporated (Saunders Acquisition Corp.)
• Original Assignee: Franklin Electronic Publishers Incorporated (Saunders Acquisition Corp.)
• Inventors: McWherter, David
• Primary Examiner(s): Jablon, Clark A.
• Application Number:
  US07/199,060
• Time in Patent Office: 1,448 Days
• Field of Search: 364/419, 364/200, 364/900
• US Class Current: 715/236
• CPC Class Codes: G06F 16/90348 by searching ordered data, e.g. alpha-numerically ordered data
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation
• CPC Class Codes: G06F 40/247 Thesauruses; Synonyms
• CPC Class Codes: G09B 7/02 of the type wherein the student is expected to construct an answer to the question which is presented or wherein the machine gives an answer to the question presented by a student

Abstract

Improvements in a hand-held spelling machine increase the speed with which a query word is compared against the words in memory. One technique is to provide a look up table to encode all character sets of one or two letters into a coded string. Where the set of letters is three or more characters, a previously known algorithm is employed. Search of the memory is limited to only a few main branches of the tree. The limitation is a function of the first query word letter. The time it takes to calculate the similarity function is saved in two circumstances. When a similarity function is calculated at a particular level of the tree and found to be great enough so that there is no prune of the tree, then that decision not to prune is carried forward for other tree branches having the same letters prior to the level involved.

Claims

1. In a machine spelling dictionary having a memory containing a dictionary of words arranged in a tree format, a keyboard to input a query word composed of a set of characters, and encode means to encode each input character string from said tree and from said keyboard into coded strings for purposes of comparing query and tree coded strings, the encoding improvement comprising:

a look up table to encode word segments from said tree having N or fewer characters into a corresponding coded string, and

algorithm means for encoding word segments from said tree having more than N characters into a corresponding coded string,

the word segments encoded by said look up table and by said algorithm means constituting the words in branch segments of the tree.

2. The improvement of claim 1 wherein N=2.

3. In a machine spelling dictionary having a memory containing a dictionary of words arranged in a tree format, a keyboard to input a query word composed of a set of characters, an encode means to encode each input characteristic string into a coded string, means for pruning the tree as a function of a similarity characteristic between the coded string of the query word and the coded string of a memory word from the tree, the pruning occurring when the similarity characteristic falls below a predetermined threshold, the improvement comprising:

means responsive to the similarity characteristic at a node at a tree level N to provide an automatic termination function where said similarity characteristic is greater than a predetermined threshold,

means responsive to said automatic termination function to omit the calculation of said similarity function at said tree level N for all branches that stem from the node at level N-1 that precedes said node at level N,

whereby pruning is avoided for all branches so affected.

4. The improvement of claim 3 wherein N is greater than level 3.

5. The improvement of claim 4 wherein N is less than level 7.

6. The improvement of claim 3 further comprising:

a look up table to encode word segments from said tree having M or fewer characters into a corresponding coded string, and

algorithm means for encoding word segments from said tree having more than M characters into a corresponding coded string,

the word segments encoded by said look up table and by said algorithm means constituting the word segments in a branch of the tree.

7. The improvement of claim 6 wherein M=2.

8. The improvement of claim 7 wherein N is greater than level 3.

9. The improvement of claim 8 wherein N is less than level 7.