Textual and graphic data presentation system and method

• US 7,117,194 B2
• Filed: 04/03/2002
• Issued: 10/03/2006
• Est. Priority Date: 06/04/2001
• Status: Expired due to Fees

• Current Assignee: Snap-On Incorporated
• Original Assignee: Snap-On Technologies Incorporated (Snap-On Incorporated)
• Inventors: Donohue, Richard, Costantino, David
• Primary Examiner(s): Gaffin, Jeffrey
• Assistant Examiner(s): Abel-Jalil, Neveen
• Application Number:
  US10/115,322
• Publication Number:
  US 20020194153A1
• Time in Patent Office: 1,644 Days
• Field of Search: 707 1- 10, 707100-1041, 704/2, 704 8- 9, 704/10, 705/10, 705/14, 705/27, 715/501.1, 382/232, 709/217
• US Class Current: 1/1
• CPC Class Codes: G06F 15/0283 for data storage and retrieval
• CPC Class Codes: G06F 40/242 Dictionaries
• CPC Class Codes: G11B 20/00007 Time or data compression or expansion audio compression based on psychoacoustics G10L19/00; data processing for reproducing audio data at different playback speeds G10L21/04; video compression H04N19/00; data compression per se H03M7/30
• CPC Class Codes: H03M 7/3084 using adaptive string matching, e.g. the Lempel-Ziv method
• CPC Class Codes: H03M 7/3088 employing the use of a dictionary, e.g. LZ78
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99936 Pattern matching access

Abstract

A system and method for use in accessing and displaying information is disclosed. The system and method may include a hand-held device for displaying information; the device may include a processor; a memory; and a word dictionary table stored in the memory. The word dictionary table may include a word list of unique words within the information. The word dictionary table may also include a set of word identification tokens that each represent a word in the list. The memory may also include a phrase dictionary table, which may include a phrase list of word identification token groups, each word identification token group representing a phrase that is contained in the information. The phrase dictionary table may further include a set of phrase identification tokens, each representing one of the phrases in the textual information. The memory may be updated or synchronized via a network that includes a satellite link.

Claims

1. A method for storing in memory data in compressed form, wherein the data includes a series of words, each word having a size, the method comprising:

associating a word token to each unique word of the data, each word token having a size, wherein the size of each word token is independent of the size of the unique word;

storing in the memory a word dictionary, wherein the word dictionary comprises each unique word and its associated word token;

converting each of the series of words in the data into a series of word tokens so as to produce tokenized data, wherein each of the series of word tokens corresponds to one of the word tokens in the word dictionary;

associating a phrase token to each repeated phrase in the tokenized data, wherein each of the repeated phrases comprises a sequence of the word tokens in the tokenized data;

storing in the memory a phrase dictionary, wherein the phrase dictionary comprises each repeated phrase and its associated phrase token;

converting each repeated phrase of the tokenized data into its associated phrase token;

storing in memory the tokenized data, whereby the tokenized data has a size less than the size of the series of words when at least one of the words is sized larger than its associated word token, and when the tokenized data comprises at least one repeated phrase; and

updating the data via a synchronization interface.

2. The method of claim 1, further comprising:

determining a compression-efficient-phrase length for repeated phrases in the tokenized data, wherein the compression-efficient-phrase length allows for efficient compression of the tokenized data, and wherein each of the repeated phrases comprises a sequence of the word tokens in the tokenized data.

3. The method of claim 1, wherein the data comprises textual information.

4. The method of claim 3, wherein the textual information comprises automotive repair and servicing information.

5. The method of claim 1, wherein the memory comprises at least one removable module.

6. The method of claim 1, wherein updating the data includes receiving, at the synchronization interface, data from a communications network.

7. The method of claim 6, wherein the synchronization interface comprises a wireless interface.

8. The method of claim 6, wherein the synchronization interface comprises a set of electrical contacts communicatively connectable to a synchronization cradle communicatively coupled to a network device.

9. The method of claim 7, wherein the wireless interface is an infrared interface.

10. The method of claim 7, wherein the wireless interface is a radio frequency interface.

11. The method of claim 6, wherein the communications network comprises a satellite network.

12. The method of claim 6, wherein the communications network comprises the Internet.

13. A method for storing in memory data in compressed form, wherein the data includes a series of words, and wherein each word of the series of words has a size, the method comprising:

(a) associating a word token to each unique word in the data, wherein each word token has a size, the size of each word token being independent of the size of the unique word;

(b) storing in the memory a word dictionary, wherein the word dictionary comprises each unique word and its associated word token;

(c) converting each of the series of words in the data into a series of word tokens so as to produce tokenized data, wherein each of the series of word tokens corresponds to one of the word tokens in the word dictionary;

(d) determining a compression-efficient-phrase length for repeated phrases in the tokenized data, wherein the compression-efficient-phrase length allows for efficient compression of the tokenized data, and wherein each of the repeated phrases comprises a sequence of the word tokens in the tokenized data;

(e) associating a phrase token to each repeated phrase having the compression-coefficient-phase length;

(f) storing in the memory a phrase dictionary, wherein the phrase dictionary comprises each repeated phrase having the compression-efficient-phrase length and the phrase token associated with each repeated phrase having the compression-efficient-phrase length;

(g) converting each repeated phrase of the tokenized data having the compression-efficient-phrase length into its associated phrase token;

(h) storing in memory the tokenized data, whereby the tokenized data has a size less than the size of the series of words when at least one of the words is sized larger than its associated word token, and when the tokenized data comprises at least one repeated phrase; and

(i) updating the word dictionary, phrase dictionary, and tokenized data via a synchronization interface.

14. The method of claim 13, wherein the memory comprises a removable memory and the data comprises textual information.

15. The method of claim 14, wherein the textual information comprises a plurality of words is formatted in accordance with the American Standard Code for Information Interchange (ASCII), wherein each character of the ASCII formatted words is one (1) byte, wherein each word token comprises two (2) bytes, and wherein when any word is greater than three characters, then the tokenized data uses less storage space than the series of words.

16. The method of claim 13, further comprising searching the data for unique words, wherein when a unique word is found, carrying out the steps of associating the word token to the unique word, and storing in the word dictionary the unique word and the associated word token.

17. The method of claim 13, further comprising searching the tokenized data for the repeated phrases, wherein when a repeated phrase is found in the tokenized data, carrying out the steps of associating the phrase token to the repeated phrase, and storing in the phrase dictionary the repeated phrase and the associated word tokens.

18. The method of claim 13, wherein the memory has a given capacity, wherein the data is larger than the given capacity, and wherein after carrying out steps (a)–

(i) the tokenized data, the word dictionary, and the phrase dictionary fit within the given capacity.

19. The method of claim 13, further comprising:

(j) obtaining, via a synchronization interface, new data that is in uncompressed form, wherein the new data includes a series of words;

(k) associating a word token to each unique word in the new data, wherein at least one word token is arranged so as to use less storage space than its associated unique word; and

performing elements (b)–

(i).

20. The method of claim 19, wherein obtaining, via a synchronization interface, the new data comprises obtaining the new data via a wireless synchronization interface.