IP Library Granted Patent US 7,260,567
Granted Patent B2
US 7,260,567 · App. 10/799,429 · Granted Aug 21, 2007

Navigation in a hierarchical structured transaction processing system

Assignee: Noema, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,260,567
App. No.
10/799,429
Granted
Aug 21, 2007
Kind
B2
Abstract

A method performed in a system having multiple navigable nodes interconnected in a hierarchical arrangement involves receiving an input containing at least one word identifiable with at least one keyword, identifying at least one node, other than the first node, not directly connected to the first node, but associated with the at least one keyword, and jumping to the identified node. A transaction processing system having a hierarchical arrangement of nodes and is configured for user navigation among the nodes. The system has an inverted index correlating keywords with at least some nodes in the arrangement so that when the user provides an input in response to a verbal description and the response includes a meaningful word correlatable with a keyword, the system will identify at least one node correlated to the meaningful word by the inverted index and jump to that node without first traversing any other node.

Claims (17)

1. A method performed by a program executed by a processor to navigate among an arranged group of nodes, each of the nodes having an associated verbal description, the method comprising:

eliminating stop words and duplicates from the verbal descriptions to create a list of keywords;

creating a list of thesaurus words;

creating a first matrix comprising a correlation of at least some thesaurus words with at least some keywords;

creating a second matrix by calculating cosine values from a co-occurrence analysis of the entries in the first matrix;

determining a synonymy among the at least some thesaurus words and the at least some keywords; and

creating a thesaurus configured as an inverted index based upon the synonomy.

2. The method of claim 1 further comprising:

tracking frequency of use of the nodes.

3. The method of claim 2 further comprising:

ranking the nodes based upon a result of the tracking.

4. The method of claim 1 further comprising:

pruning a node from the group of nodes based upon a frequency of usage criterion.

5. The method of claim 1 further comprising:

adding a synonym entry into the thesaurus based upon a result of an unknown word analysis.

6. The method of claim 1 wherein the thesaurus further comprises at least some learned entries, the method further comprising:

deleting a learned entry based upon satisfaction of a frequency of use criterion.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 12, 2016
From: NOEMA, INC.
To: GUADA TECHNOLOGIES LLC
Reel/Frame 039995/0676 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 19, 2005
From: SEMIOSIS, INC.
To: NOEMA, INC.
Reel/Frame 016905/0718 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 10, 2004
From: SEMIOSIS, L.L.C.
To: SEMIOSIS, INC.
Reel/Frame 016062/0254 →
Continuity (2)
Division 1029935900 · Nov 19, 2002
Related Publication 20040181392A1 · Sep 16, 2004