US 7,117,194 B2Granted

Textual and graphic data presentation system and method

AssigneeSnap-on Technologies, Inc.

InventorsDavid Costantino, Richard Donohue

Life of this patent

Estimating the term…

Loading patent…

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.

Claims20

Dependent claims

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.

6 more elements

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.

7 more elements

Dependencies are inferred from the claim text.

Facts

Application: 10/115,322Filed 3 Apr 2002 · continuation in part
Priority: 4 Jun 2001
Published: US 2002/0194153 A119 Dec 2002
Granted: 3 Oct 2006
Term ends: Not estimatedThe source records don’t support an estimate.

Classification12 codes

G06F 15/0283
Adapted to a specific application: for data storage and retrieval
G06F 40/242
Lexical tools: dictionaries
H03M 7/3084
Compression ; Expansion; Suppression of unnecessary data, e.g. redundancy reduction: using adaptive string matching, e.g. the Lempel-Ziv method
H03M 7/3088
Using adaptive string matching, e.g. the Lempel-Ziv method: employing the use of a dictionary, e.g. LZ78

Family

Application60/295,746Us provisional application · filed 4 Jun 2001
Application09/951,100Parent of this continuation-in-part · filed 12 Sep 2001
US 2002/0194153 A1Pre-grant publication · published 19 Dec 2002
US 2003/0217025 A1Published application
US 7,117,194 B2This patent

From the US filing history. Foreign family members aren’t listed.