Navigation in a hierarchical structured transaction processing system

• US 7,370,056 B2
• Filed: 03/11/2004
• Issued: 05/06/2008
• 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,506
• Publication Number:
  US 20040169679A1
• Time in Patent Office: 1,517 Days
• Field of Search: 707 1- 6, 707/104.1, 706 45- 52
• US Class Current: 1/1
• 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 in connection with an arrangement of nodes representable as a graph comprising:

correlating keywords with nodes in which the keywords appear to create an inverted index so that the keywords each appear only once and all nodes containing each of the keywords are indexed to those keywords;

maintaining a thesaurus of synonyms for at least some of the keywords;

receiving an input from a user containing a meaningful word;

searching the inverted index to determine whether the meaningful word is a keyword and, if the meaningful word is a keyword, jumping to a node identified in the inverted index as correlated to that keyword, otherwise,

searching the thesaurus to determine if the meaningful word is a synonym for at least one particular keyword and, if the meaningful word is the synonym, using the synonym to identify the at least one particular keyword, and

jumping to at least one node correlated to the at least one particular keyword.

2. The method of claim 1 further comprising:

creating the thesaurus by analyzing at least two files and determining synonymy among application meaningful words contained therein based upon a frequency of co-occurrence among the application meaningful words.

3. A system comprising:

a series of nodes;

an inverted index correlating keywords with the nodes;

a thesaurus correlating at least some keywords with synonyms for those keywords;

a processor executable learning procedure configured to, upon receipt of a term that is identified as neither a synonym nor a keyword based upon a search of both the inverted index and the thesaurus,

(a) identify the term as at last one particular synonym for at least one particular keyword and

(b) correlate the term with the at least one particular keyword, so that when a subsequent user provides the term the system will operate as if the term was synonymous with the at least one particular keyword.

4. The system of claim 3 further comprising:

a set of verbal descriptions for at least some of the nodes.

5. The system of claim 3 wherein at least one of the nodes is a service node.

6. The system of claim 3 further comprising an interactive voice response system and wherein the series of nodes is part of the interactive voice response system.

7. The system of claim 3 wherein the series of nodes is part of a file system browser application.

8. The system of claim 3 wherein the series of nodes is part of a navigation system for television listings.

9. The system of claim 3 wherein the series of nodes is part of one of a document navigation or a document retrieval system.

10. The system of claim 3 wherein the series of nodes is part of a geographic information system.

11. A transaction processing system, having an arrangement of nodes and configured to interact with a user so that the user can navigate among the nodes, the system comprising:

an inverted index correlating keywords with at least some of the nodes in the arrangement so that when the user interacts with the system and provides an input in response to a verbal description from one node and the response includes a meaningful word correlatable with a keyword, the system will identify at least one node that is correlated to the meaningful word by the inverted index and jump to that at least one node without first traversing any other node.

12. The system of claim 11 further comprising:

a thesaurus correlating at least some of the keywords with synonyms for the at least some keywords.

13. The system of claim 11 further comprising:

at least one stored learned word correlated to a keyword.