STRUCTURED DICTIONARY
First Claim
1. A computer-readable storage medium encoded with a dictionary data structure, the data structure comprising:
- a first table comprised of entries each representing a natural language term, each entry of the first table containing a term ID identifying its term;
a second table comprised of entries each representing a definition, each entry of the second table containing a definition ID identifying its definition; and
a third table comprised of entries each representing correspondence between a term and a definition defining the term, each entry of the third table containing a term ID identifying the defined term and a definition ID identifying the defining definition,such that the contents of the data structure are usable to identify any definitions corresponding to a term.
1 Assignment
0 Petitions
Accused Products
Abstract
A dictionary data structure is described. The data structure is made up of first, second, and third tables. The first table is comprised of entries each representing a natural language term, each entry of the first table containing a term ID identifying its term. The second table is comprised of entries each representing a definition, each entry of the second containing a definition ID identifying its definition. The third table is comprised of entries each representing correspondence between a terminate definition defining the term, each entry of the third table containing term ID identifying the defined term and a definition ID identifying the defining definition. The contents of the data structure are usable to identify any definitions corresponding to a term.
8 Citations
38 Claims
-
1. A computer-readable storage medium encoded with a dictionary data structure, the data structure comprising:
-
a first table comprised of entries each representing a natural language term, each entry of the first table containing a term ID identifying its term; a second table comprised of entries each representing a definition, each entry of the second table containing a definition ID identifying its definition; and a third table comprised of entries each representing correspondence between a term and a definition defining the term, each entry of the third table containing a term ID identifying the defined term and a definition ID identifying the defining definition, such that the contents of the data structure are usable to identify any definitions corresponding to a term. - View Dependent Claims (2, 3, 4, 5, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 38)
-
-
6-13. -13. (canceled)
-
32. A computer-readable storage medium encoded with a computer program performing a method for identifying a plurality of alternate definitions for a distinguished natural language term, the method comprising:
-
identifying, among entries of a first table each representing a natural language term, an entry representing the distinguished natural language term; accessing, in the identified entry of the first table, a term ID uniquely identifying the term to which the identified entry of the first table corresponds; identifying, among entries of a second table each representing correspondence between a term and a definition defining the term, a plurality of entries each containing the accessed term ID; accessing, in each of the identified entries of the second table, a definition ID uniquely identifying a definition; for each of the accessed definition IDs, identifying, among entries of a third table each representing a definition, an entry containing the accessed definition ID, the third table being distinct from the second table; for each of the identified entries of the third table, accessing in the identified entry of the third table a natural language representation of the definition represented by the entry of the third table; and attributing the accessed definition natural language representations to the distinguished natural language term. - View Dependent Claims (33, 34)
-
-
35. A method in a computing system for determining a relationship between a first term and a second term, the method comprising:
-
identifying, among entries of a first table each representing a natural language term, a first entry representing the first term; accessing, in the first entry of the first table, a first term ID uniquely identifying the term to which the first entry of the first table corresponds; identifying, among entries of the first table, a second entry representing the second term; accessing, in the second entry of the first table, a second term ID uniquely identifying the term to which the second entry of the first table corresponds; identifying, among entries of a second table each representing a relationship between a pair of terms, an entry containing both the first term ID and the second term ID; accessing, in the identified entry of the second table, an indication of a relationship type between the first and second terms; and attributing the accessed indication of a relationship type to the first term and the second term. - View Dependent Claims (36, 37)
-
Specification