Navigation in a hierarchical structured transaction processing system
DCFirst Claim
1. A method performed in a system having multiple navigable nodes interconnected in a hierarchical arrangement comprising:
- at a first node, receiving an input from a user of the system, the input containing at least one word identifiable with at least one keyword from among multiple keywords,identifying at least one node, other than the first node, that is not directly connected to the first node but is associated with the at least one keyword, andjumping to the at least one node.
5 Assignments
Litigations
6 Petitions
Accused Products
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.
34 Citations
7 Claims
-
1. A method performed in a system having multiple navigable nodes interconnected in a hierarchical arrangement comprising:
-
at a first node, receiving an input from a user of the system, the input containing at least one word identifiable with at least one keyword from among multiple keywords, identifying at least one node, other than the first node, that is not directly connected to the first node but is associated with the at least one keyword, and jumping to the at least one node. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method performed in connection with an arrangement of nodes representable as a hierarchical graph containing vertices and edges connecting at least two of the vertices, the method comprising:
-
receiving an input from a user as a response to a verbal description associated with a first vertex; analyzing the input to identify a meaningful term that can be associated with at least one keyword; selecting a vertex in the graph structure that is not connected by an edge to the first vertex, based upon an association between the meaningful term and the at least one keyword and a correlation between the at least one keyword and the vertex; and
jumping to the vertex.
-
Specification