Navigation in a hierarchical structured transaction processing system

• US 7,260,567 B2
• Filed: 03/11/2004
• Issued: 08/21/2007
• Est. Priority Date: 11/19/2002
• Status: Expired due to Fees

• Current Assignee: Guada Technologies LLC (IP Edge LLC)
• Original Assignee: Noema, Inc
• Inventors: Parikh, Prashant, Peters, Stanley
• Primary Examiner(s): Wu, Yicun
• Application Number:
  US10/799,429
• Publication Number:
  US 20040181392A1
• Time in Patent Office: 1,258 Days
• Field of Search: 707 1- 10, 707100-1041, 707200-206, 704/9, 715/744
• US Class Current: 707/742
• CPC Class Codes: G06F 16/322 Trees
• CPC Class Codes: G06F 16/93 Document management systems
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

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

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.