User-oriented electronic dictionary, electronic dictionary system and method for creating same

• US 20040243396A1
• Filed: 05/20/2004
• Published: 12/02/2004
• Est. Priority Date: 12/30/2002
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Liu, Shixia, Yang, Liping
• Application Number:
  US10/739,780
• Publication Number:
  US 20040243396A1
• Time in Patent Office: Days
• US Class Current: 704/10
• CPC Class Codes: G06F 40/242 Dictionaries

Abstract

The invention provides a user-oriented electronic dictionary, an electronic dictionary system and a method for creating the same, in which users may freely modify (add or delete) attributes of a lemma in the electronic dictionary. In the present invention, the entity instances generated from a entity object are used to indicate the information related to a lemma in said electronic dictionary, and the relation instances generated from a relation object are used to indicate the directed relations between two entity instances. Therefore, in the electronic dictionary according to the present invention, all entity instances related to a lemma in said electronic dictionary are linked by the corresponding relation instances to form a directed relation graph. The electronic dictionary according to the present invention promises better reusability and maintainability.

Claims

1. A method for creating a user-oriented electronic dictionary, comprising:

defining an entity object, for indicating a lemma or an attribute of a lemma in said electronic dictionary, said entity object comprising an entity name and an entity type;

creating an entity instance library, for storing entity instances generated from said entity object;

defining a relation object, for indicating a kind of directed relation between two entity objects, said relation object comprising;

a relation type, a source entity and a target entity;

creating a relation instance library, for storing relation instances generated from said relation object;

wherein all entity instances related to a lemma in said electronic dictionary are linked by the corresponding relation instances to form a directed relation graph; and

dynamically adding a lemma, adding an attribute of a lemma, deleting a lemma or deleting an attribute of a lemma to or from said electronic dictionary by instancing said entity object and/or said relation object and performing operations on the instances in said entity instance library and said relation instance library.

2. The method according to claim 1, wherein said entity object further comprises a directed relation graph attribute, after said entity object is instanced, the IDs of all relation instances for indicating the relations between the newly generated entity instance and other entity instances are stored in the directed relation graph of the newly generated entity instance.

3. The method according to claim 2, wherein in said directed relation graph of said entity instance, a linked list is used to store said IDs.

4. The method according to claim 3, wherein in said directed relation graph of said entity instance, only a pointer pointing to said linked list is stored.

5. The method according to claim 1, wherein the step of adding a lemma to said electronic dictionary comprises:

determining if there exists an entity instance corresponding to the lemma to be added in said entity instance library or not;

if there does not exist, generating an entity instance corresponding to the lemma, and adding it into said entity instance library; and

determining if it is needed to add attributes to the lemma, if it is needed, adding attributes to the lemma.

6. The method according to claim 1, wherein the step of adding an attribute of a lemma to said electronic dictionary comprises:

determining if there exists an entity instance corresponding to the attribute in said entity instance library or not;

if there does not exist, generating an entity instance corresponding to the attribute;

generating a relation instance, for linking the newly generated entity instance to the lemma; and

adding the newly generated entity instance into the directed relation graph of the lemma.

7. The method according to claim 6, wherein the step of adding an attribute of a lemma comprises the step of relation consistency checking:

checking if the newly generated relation instance is consistent with the existing relation instances in said relation instance library, and only if consistent, adding the newly generated relation instance into the directed relation graph of the lemma.

8. The method according to claim 7, wherein the step of relation consistency checking comprises the steps of relation redundancy, conflict or deficiency checking.

9. The method according to claim 1, wherein the step of deleting an attribute of a lemma from said electronic dictionary comprises:

finding the entity instance corresponding to the attribute and the relation instance for linking the entity instance to the lemma in said entity instance library and said relation instance library; and

deleting the found relation instance from the directed relation graph of the lemma.

10. The method according to claim 9, wherein the step of deleting an attribute of a lemma further comprises the step of relation consistency checking:

checking if other relation instances in said relation instance library are consistent when deleting the found relation object relation instance, and only if consistent, deleting the found relation instance from the directed relation graph of the lemma.

11. The method according to claim 10, wherein the step of relation consistency checking comprises the steps of relation redundancy, conflict or deficiency checking.

12. The method according to claim 1, wherein the step of deleting a lemma from said electronic dictionary comprises:

finding the entity instance corresponding to the lemma in said entity instance library; and

deleting the found entity instance from said entity instance library.

19. The method according to claim 1, further comprising employing said method for maintaining said user-oriented electronic dictionary.

20. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing creation of a user-oriented electronic dictionary, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of claim 1.

21. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for creating a user-oriented electronic dictionary, said method steps comprising the steps of claim 1.

13. A user-oriented electronic dictionary, comprising:

an entity instance library, for storing a plurality of entity instances generated from an entity object, said entity object for indicating a lemma or an attribute of a lemma in said electronic, and said entity object comprising an entity name and an entity type;

a relation instance library for storing a plurality of relation instances generated from a relation object, said relation object for indicating a kind of directed relation between two entity objects, and said relation object comprising;

a relation type, a source entity and a target entity;

wherein all entity instances related to a lemma in said electronic dictionary are linked by the corresponding relation instances to form a directed relation graph.

14. The dictionary according to claim 13, wherein said entity object further comprises a directed relation graph attribute, after said entity object is instanced, the IDs of all relation instances for indicating the relations between the newly generated entity instance and other entity instances are stored in the directed relation graph of the newly generated entity instance.

15. The dictionary according to claim 14, wherein in said directed relation graph of said entity instance, a linked list is used to store said IDs.

16. The dictionary according to claim 15, wherein in said directed relation graph of said entity instance, only a pointer pointing to said linked list is stored.

22. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing a user-oriented electronic dictionary, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 13.

17. A user-oriented electronic dictionary system, comprising:

an entity instance library, for storing a plurality of entity instances generated from an entity object, said entity object for indicating a lemma or an attribute of a lemma in said electronic dictionary, and said entity object comprising an entity name and an entity type;

a relation instance library for storing a plurality of relation instances generated from a relation object, said relation object for indicating a kind of directed relation between two entity objects, and said relation object comprising;

a relation type, a source entity and a target entity;

wherein all entity instances related to a lemma in said electronic dictionary are linked by the corresponding relation instances to form a directed relation graph;

an entity maintaining means for instancing said entity object, or dynamically adding, modifying or deleting entity instances in said entity instance library; and

a relation maintaining means for instancing said relation object, or dynamically adding, modifying or deleting relation instances in said relation instance library.

18. The system according to claim 17, wherein said system further comprises a dictionary analysis means for performing relation consistency check.

23. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing a user-oriented electronic dictionary system, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 17.