# US 2004/0083198 A1 · Dynamic database reordering system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0083198 A1
- Document ID: US20040083198A1
- Status: Published application
- Kind: A1
- Application number: 10/621,864
- Filed: 2003-07-16
- Published: 2004-04-29
- Earliest claimed: 2002-07-18
- Assignees: Tegic Communications, Inc.
- Inventors: Ethan R. Bradford; David Jon Kay
- Web page: https://patentgrep.com/patent/US20040083198A1

## CPC

- G06F 3/0236: {using selection techniques to select from displayed items}
- G06F 40/274: Converting codes to words; Guess-ahead of partial word inputs
- Y10S 707/99931: Database or file accessing
- Y10S 707/99932: Access augmentation or optimizing
- Y10S 707/99933: Query processing, i.e. searching
- Y10S 707/99934: Query formulation, input preparation, or translation
- Y10S 707/99935: Query augmenting and refining, e.g. inexact access
- Y10S 707/99936: Pattern matching access
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A dynamic database reordering system provides a linguistics database that contains words that are ordered according to a linguistics model that dictates the order in which words are presented to a user. While a user enters keystrokes on a keypad of a communications device is pressing keys, the invention predicts the words, letters, numbers, or word stubs that the user is trying to enter. The invention reorders the linguistics model order based on the user's usage of the system by tracking the user's word selections. Once a word has been selected as a result of a next key selection (the nexted word), a frequency value is applied to the selected word and the word ordered first by the linguistics model in the linguistics database for that key sequence. The frequency value of the nexted word will become greater than the frequency value of the first displayed word upon repeated nexting to the same word. Subsequent user entries of the key sequence for the nexted word and the first ordered word will result in displaying the nexted word before the word ordered first by the linguistics model.

## Claims

### Claim 1

A process for reordering items retrieved from a database for display to a user, comprising the steps of:
accepting user input from a keyboard;
providing a linguistic database;
wherein said linguistic database contains words ordered using a linguistic model;
dynamically retrieving words from said linguistic database that comprise letters formed by the user's keyboard input;
displaying a list of said retrieved words to the user;
wherein words in said list are ordered using the linguistic database ordering and a dynamic reordering frequency count;
wherein the dynamic reordering frequency count overrides the linguistic database ordering for words in said list; and
assigning a dynamic reordering frequency count to words selected by the user from said list.

### Claim 2 (depends on 1)

The process of claim 1, further comprising the step of:
providing a reorder database; and
wherein said assigning step inserts selected words and their associated reordering frequencies into said reorder database.

### Claim 3 (depends on 2)

The process of claim 2, further comprising the step of:
providing a user database;
wherein words that the user specifically enters into the system are stored in said user database; and
wherein said retrieving step also retrieves words that comprise letters formed by the user's keyboard input from said user database.

### Claim 4 (depends on 2)

The process of claim 2, wherein said assigning step inserts a first ordered word from said list and a non first ordered word into said reorder database if the user has selected the non first ordered word for the first time, and wherein the first ordered word is inserted if it does not already exist in said reorder database.

### Claim 5 (depends on 4)

The process of claim 4, wherein the first ordered word in said list loses its position if the non first ordered word is selected by the user a predetermined number of times, and wherein the non first ordered word is then assigned a higher frequency value than the first ordered word.

### Claim 6 (depends on 4)

The process of claim 4, wherein all non first ordered words entered into said reorder database are initially assigned equal reordering frequencies.

### Claim 7 (depends on 1)

The process of claim 1, wherein a word's reordering frequency is increased each time the user selects the word.

### Claim 8 (depends on 1)

The process of claim 1, wherein if a word in said list is selected by the user and the word is below a second ordered position then said assigning step assigns the word's reordering frequency to a value that places the word in the second ordered position in said list.

### Claim 9 (depends on 2)

The process of claim 2, further comprising the step of:
periodically performing an aging process to the reordering frequencies in said reorder database; and
wherein the reordering frequencies in said reordering database are reduced by a predetermined factor by said aging step.

### Claim 10 (depends on 3)

The process of claim 3, further comprising the step of:
periodically checking the free space of said reordering database;
wherein if the free space in said reordering database below a predetermined threshold, then removing words that have reordering frequencies below a predetermined threshold from said reordering database.

### Claim 11 (depends on 10)

The process of claim 10, wherein said checking step removes user defined words having reordering frequencies below the predetermined threshold after other words having reordering frequencies below the predetermined threshold from said reordering database.

### Claim 12 (depends on 1)

The process of claim 1, further comprising the step of:
resolving reordering frequency collisions in said list;
wherein said resolving step resolves a collision if two words have the same reordering frequency by ordering the most recently selected of the two words first.

### Claim 13 (depends on 1)

The process of claim 1, further comprising the step of:
resolving reordering frequency collisions in said list;
wherein said resolving step resolves a collision if two words have the same reordering frequency by ordering the word having a higher ordering in said linguistic database first.

### Claim 14 (depends on 2)

The process of claim 2, further comprising the step of:
resolving reordering frequency collisions in said list;
wherein said resolving step resolves a collision if two words have the same reordering frequency by ordering user defined words first if a user defined word and a word from said linguistic database have a collision.

### Claim 15 (depends on 1)

The process of claim 1, wherein words selected by the user that do not have a possibility of a collision with other words are not assigned a reordering frequency count.

### Claim 16

An apparatus for reordering items retrieved from a database for display to a user, comprising:
a module for accepting user input from a keyboard;
a linguistic database;
wherein said linguistic database contains words ordered using a linguistic model;
a module for dynamically retrieving words from said linguistic database that comprise letters formed by the user's keyboard input;
a module for displaying a list of said retrieved words to the user;
wherein words in said list are ordered using the linguistic database ordering and a dynamic reordering frequency count;
wherein the dynamic reordering frequency count overrides the linguistic database ordering for words in said list; and
a module for assigning a dynamic reordering frequency count to words selected by the user from said list.

### Claim 17 (depends on 16)

The apparatus of claim 16, further comprising:
a reorder database; and
wherein said assigning module inserts selected words and their associated reordering frequencies into said reorder database.

### Claim 18 (depends on 17)

The apparatus of claim 17, further comprising:
a user database;
wherein words that the user specifically enters into the system are stored in said user database; and
wherein said retrieving module also retrieves words that comprise letters formed by the user's keyboard input from said user database.

### Claim 19 (depends on 17)

The apparatus of claim 17, wherein said assigning module inserts a first ordered word from said list and a non first ordered word into said reorder database if the user has selected the non first ordered word for the first time, and wherein the first ordered word is inserted if it does not already exist in said reorder database.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein the first ordered word in said list loses its position if the non first ordered word is selected by the user a predetermined number of times, and wherein the non first ordered word is then assigned a higher frequency value than the first ordered word.

### Claim 21 (depends on 19)

The apparatus of claim 19, wherein all non first ordered words entered into said reorder database are initially assigned equal reordering frequencies.

### Claim 22 (depends on 16)

The apparatus of claim 16, wherein a word's reordering frequency is increased each time the user selects the word.

### Claim 23 (depends on 16)

The apparatus of claim 16, wherein if a word in said list is selected by the user and the word is below a second ordered position then said assigning module assigns the word's reordering frequency to a value that places the word in the second ordered position in said list.

### Claim 24 (depends on 17)

The apparatus of claim 17, further comprising:
a module for periodically performing an aging process to the reordering frequencies in said reorder database; and
wherein the reordering frequencies in said reordering database are reduced by a predetermined factor by said aging module.

### Claim 25 (depends on 17)

The apparatus of claim 17, further comprising:
a module for periodically checking the free space of said reordering database;
wherein if the free space in said reordering database below a predetermined threshold, then removing words that have reordering frequencies below a predetermined threshold from said reordering database.

### Claim 26 (depends on 25)

The apparatus of claim 25, wherein said checking module removes user defined words having reordering frequencies below the predetermined threshold after other words having reordering frequencies below the predetermined threshold from said reordering database.

### Claim 27 (depends on 16)

The apparatus of claim 16, further comprising:
a module for resolving reordering frequency collisions in said list;
wherein said resolving module resolves a collision if two words have the same reordering frequency by ordering the most recently selected of the two words first.

### Claim 28 (depends on 16)

The apparatus of claim 16, further comprising:
a module for resolving reordering frequency collisions in said list;
wherein said resolving module resolves a collision if two words have the same reordering frequency by ordering the word having a higher ordering in said linguistic database first.

### Claim 29 (depends on 18)

The apparatus of claim 18, further comprising:
a module for resolving reordering frequency collisions in said list;
wherein said resolving module resolves a collision if two words have the same reordering frequency by ordering user defined words first if a user defined word and a word from said linguistic database have a collision.

### Claim 30 (depends on 16)

The apparatus of claim 16, wherein words selected by the user that do not have a possibility of a collision with other words are not assigned a reordering frequency count.

### Claim 31

A process for reordering items retrieved from a database for display to a user, comprising the steps of:
accepting user input from a keyboard;
providing a linguistic database;
wherein said linguistic database contains words ordered using a linguistic model and an ordering frequency for each word;
dynamically retrieving words from said linguistic database that comprise letters formed by the user's keyboard input;
displaying a list of said retrieved words to the user;
wherein words in said list are ordered using the linguistic database ordering and a dynamic reordering frequency count;
wherein the dynamic reordering frequency count overrides the linguistic database ordering for words in said list; and
assigning a dynamic reordering frequency count to words selected by the user from said list and initializing the assigned dynamic reordering frequency count for a word to the ordering frequency value obtained from said linguistic database for the word.

### Claim 32 (depends on 31)

The process of claim 31, further comprising the step of:
providing a reorder database; and
wherein said assigning step inserts selected words and their associated reordering frequencies into said reorder database.

### Claim 33 (depends on 32)

The process of claim 32, further comprising the step of:
providing a user database;
wherein words that the user specifically enters into the system are stored in said user database; and
wherein said retrieving step also retrieves words that comprise letters formed b y the user's keyboard input from said user database.

### Claim 34 (depends on 33)

The process of claim 33, wherein all words specifically entered by the user are initially assigned equal reordering frequencies by said assigning step.

### Claim 35 (depends on 32)

The process of claim 32, wherein said assigning step inserts a first ordered word from said list and a non first ordered word into said reorder database if the user has selected the non first ordered word for the first time, and wherein the first ordered word is inserted if it does not already exist in said reorder database.

### Claim 36 (depends on 35)

The process of claim 35, wherein the first ordered word in said list loses its position if the non first ordered word is selected by the user a predetermined number of times, and wherein the non first ordered word is then assigned a higher frequency value than the first ordered word.

### Claim 37 (depends on 31)

The process of claim 31, wherein a word's reordering frequency is increased each time the user selects the word.

### Claim 38 (depends on 31)

The process of claim 31, wherein if a word in said list is selected by the user and the word is below a second ordered position then said assigning step assigns the word's reordering frequency to a value that places the word in the second ordered position in said list.

### Claim 39 (depends on 32)

The process of claim 32, further comprising the step of:
periodically performing an aging process to the reordering frequencies in said reorder database; and
wherein the reordering frequencies in said reordering database are reduced by a predetermined factor by said aging step.

### Claim 40 (depends on 32)

The process of claim 32, further comprising the step of:
periodically checking the free space of said reordering database;
wherein if the free space in said reordering database below a predetermined threshold, then removing words that have reordering frequencies below a predetermined threshold from said reordering database.

### Claim 41 (depends on 40)

The process of claim 40, wherein said checking step removes user defined words having reordering frequencies below the predetermined threshold after other words having reordering frequencies below the predetermined threshold from said reordering database.

### Claim 42 (depends on 31)

The process of claim 31, further comprising the step of:
resolving reordering frequency collisions in said list;
wherein said resolving step resolves a collision if two words have the same reordering frequency by ordering the most recently selected of the two words first.

### Claim 43 (depends on 31)

The process of claim 31, further comprising the step of:
resolving reordering frequency collisions in said list;
wherein said resolving step resolves a collision if two words have the same reordering frequency by ordering the word having a higher ordering in said linguistic database first.

### Claim 44 (depends on 43)

The process of claim 43, further comprising the step of:
resolving reordering frequency collisions in said list;
wherein said resolving step resolves a collision if two words have the same reordering frequency by ordering user defined words first if a user defined word and a word from said linguistic database have a collision.

### Claim 45

An apparatus for reordering items retrieved from a database for display to a user, comprising:
a module for accepting user input from a keyboard;
a linguistic database;
wherein said linguistic database contains words ordered using a linguistic model and an ordering frequency for each word;
a module for dynamically retrieving words from said linguistic database that comprise letters formed by the user's keyboard input;
a module for displaying a list of said retrieved words to the user;
wherein words in said list are ordered using the linguistic database ordering and a dynamic reordering frequency count;
wherein the dynamic reordering frequency count overrides the linguistic database ordering for words in said list; and
a module for assigning a dynamic reordering frequency count to words selected by the user from said list and initializing the assigned dynamic reordering frequency count for a word to the ordering frequency value obtained from said linguistic database for the word.

### Claim 46 (depends on 45)

The apparatus of claim 45, further comprising:
a reorder database; and
wherein said assigning module inserts selected words and their associated reordering frequencies into said reorder database.

### Claim 47 (depends on 46)

The apparatus of claim 46, further comprising:
a user database;
wherein words that the user specifically enters into the system are stored in said user database; and
wherein said retrieving module also retrieves words that comprise letters formed by the user's keyboard input from said user database.

### Claim 48 (depends on 47)

The apparatus of claim 47, wherein all words specifically entered by the user are initially assigned equal reordering frequencies by said assigning module.

### Claim 49 (depends on 46)

The apparatus of claim 46, wherein said assigning module inserts a first ordered word from said list and a non first ordered word into said reorder database if the user has selected the non first ordered word for the first time, and wherein the first ordered word is inserted if it does not already exist in said reorder database.

### Claim 50 (depends on 49)

The apparatus of claim 49, wherein the first ordered word in said list loses its position if the non first ordered word is selected by the user a predetermined number of times, and wherein the non first ordered word is then assigned a higher frequency value than the first ordered word.

### Claim 51 (depends on 45)

The apparatus of claim 45, wherein a word's reordering frequency is increased each time the user selects the word.

### Claim 52 (depends on 45)

The apparatus of claim 45, wherein if a word in said list is selected by the user and the word is below a second ordered position then said assigning module assigns the word's reordering frequency to a value that places the word in the second ordered position in said list.

### Claim 53 (depends on 46)

The apparatus of claim 46, further comprising:
a module for periodically performing an aging process to the reordering frequencies in said reorder database; and
wherein the reordering frequencies in said reordering database are reduced by a predetermined factor by said aging module.

### Claim 54 (depends on 46)

The apparatus of claim 46, further comprising:
a module for periodically checking the free space of said reordering database;
wherein if the free space in said reordering database below a predetermined threshold, then removing words that have reordering frequencies below a predetermined threshold from said reordering database.

### Claim 55 (depends on 54)

The apparatus of claim 54, wherein said checking module removes user defined words having reordering frequencies below the predetermined threshold after other words having reordering frequencies below the predetermined threshold from said reordering database.

### Claim 56 (depends on 45)

The apparatus of claim 45, further comprising:
a module for resolving reordering frequency collisions in said list;
wherein said resolving module resolves a collision if two words have the same reordering frequency by ordering the most recently selected of the two words first.

### Claim 57 (depends on 45)

The apparatus of claim 45, further comprising:
a module for resolving reordering frequency collisions in said list;
wherein said resolving module resolves a collision if two words have the same reordering frequency by ordering the word having a higher ordering in said linguistic database first.

### Claim 58 (depends on 43)

The apparatus of claim 43, further comprising:
a module for resolving reordering frequency collisions in said list;
wherein said resolving module resolves a collision if two words have the same reordering frequency by ordering user defined words first if a user defined word and a word from said linguistic database have a collision.
