System for semantically disambiguating text information

• US 20060074980A1
• Filed: 09/29/2004
• Published: 04/06/2006
• Est. Priority Date: 09/29/2004
• Status: Abandoned Application

• Current Assignee: Sarkar PTE. LTD.
• Original Assignee: Sarkar PTE. LTD.
• Inventors: Sarkar, Devajyoti
• Application Number:
  US10/954,964
• Publication Number:
  US 20060074980A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/958 Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking

Abstract

Disclosed is a semantic user interface system that allows text information to be tagged with machine-readable IDs that are associated with concepts for conveying information without any ambiguity or without being hampered by the limitations of human languages. Typically, a plurality of vocabularies are stored across a network, and each vocabulary includes a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID. An input interface accepts text information, selects those machine-readable IDs whose keywords match up with the text information, and returns a list of candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description. The machine-readable IDs can carry information in the form of concepts without any ambiguity as opposed to text information. This system can be applied to web and database searches, publishing messages to selected subscribers, interfacing of applications software, machine translations, etc.

Claims

1. An ontology engine, comprising:

a storage holding a vocabulary, the vocabulary including a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

an input interface unit that accepts text information, selects those machine-readable IDs whose keywords match up with the text information, and returns a list of candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description;

a human interface unit that allows a user to select one of the candidates; and

an output interface unit that returns one of the machine-readable IDs corresponding to the candidate selected at the human interface.

2. The ontology engine according to the claim 1, wherein the input interface unit is adapted to accept text information from a member selected from a group consisting of a user input device, a computer application and a computer operating system.

3. The ontology engine according to claim 1, wherein each machine-readable ID is defined as a unique ID within the engine.

4. The ontology engine according to claim 1, wherein each machine-readable ID is defined as a globally unique ID.

5. The ontology engine according to claim 1, wherein the storage includes a plurality of discrete storages that are distributed within a network system.

6. The ontology engine according to claim 5, wherein the discrete storages are distributed within a network system in at least one of a member of a group of configurations consisting of a master-slave configuration, a master-cache configuration, a client-server configuration and a peer-to-peer configuration.

7. The ontology engine according to claim 5, wherein the network consists of the Internet.

8. The ontology engine according to claim 1, wherein the user interface is adapted to have the candidates ordered in the list according to frequency of past selection.

9. The ontology engine according to claim 1, wherein each machine-readable ID is associated with a plurality of keywords in different languages.

10. The ontology engine according to claim 1, wherein the input interface unit, human interface unit and output interface unit are incorporated in a computer operating system and mark up the text information with the returned machine-readable ID for delivery to an external application.

11. The ontology engine according to claim 1, wherein the description of each candidate is selected from the at least one of the corresponding keywords.

12. The ontology engine according to claim 1, wherein the concepts are linked to each other on the basis of a relationship selected from a group of relationships consisting of a narrower-meaning relationship, an exact match relationship and a no relationship.

13. The ontology engine according to claim 12, wherein the graph formed by the narrower-meaning relationship is a Directed Acyclic Graph over all the concepts within the vocabulary.

14. The ontology engine according to claim 12, wherein the list of candidates are given with a tree structure based on the narrower-meaning relationship.

15. The ontology engine according to claim 12, wherein the human interface is adapted to allow a user to navigate and select among narrower and broader concepts.

16. The ontology engine according to claim 1, wherein the output interface unit returns the machine-readable ID by tagging the machine-readable ID to a corresponding part of the text information.

17. The ontology engine according to claim 1, wherein the ontology engine includes a plurality of discrete vocabularies that can be selectively mounted and dismounted.

18. The ontology engine according to claim 17, wherein the vocabularies can be selectively upgraded and downgraded.

19. The ontology engine according to claim 17, wherein each candidate is marked so as to identify which of the discrete vocabularies the candidate has come from.

20. The ontology engine according to claim 17, wherein the keywords are matched up with the text information after stemming the text information.

21. An ontology engine, comprising:

a storage holding a vocabulary, the vocabulary including a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

an input interface unit that accepts a machine-readable ID; and

an output interface unit that returns at least one of the keywords corresponding to each accepted machine-readable ID.

22. The ontology engine according to claim 21, wherein each of at least some of the machine-readable IDs corresponds to a plurality of keywords, and the output interface unit returns one of such plurality of keywords according to past usage and/or context.

23. The ontology engine according to claim 21, further comprising a search engine that searches a machine-readable ID in at least one member selected from a group consisting of files, web sites and databases, passes on a searched machine ID to the input interface, and receives one of the keywords corresponding to the searched machine-readable ID.

24. The ontology engine according to claim 21, wherein each machine-readable ID is associated with a plurality of keywords in different languages, the engine further comprising a language switch for selecting one of the languages so that the output interface unit returns a keyword of that selected language corresponding to each accepted machine-readable ID.

25. The ontology engine according to claim 24, wherein each of at least some of the machine-readable IDs corresponds to a plurality of keywords in at least one of the languages, and the output interface unit returns one of such plurality of keywords according to past usage and/or context.

26. A ontology engine, comprising:

a storage holding a vocabulary, the vocabulary including a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID, the concepts being at least partly linked to each other on the basis of a parent-child relationship;

an input interface unit that accepts a machine-readable ID; and

an output interface unit that returns another machine-readable ID corresponding to a concept that is a parent or child to the concept corresponding to each accepted machine-readable ID.

27. The ontology engine according to claim 26, wherein at least some of the concepts are linked to one another in a one to plural parent-child relationship, and the output interface unit returns two or more concepts that are parents or children to the concept corresponding to each accepted machine-readable ID when such a one to plural parent-child relationship exists.

28. The ontology engine according to claim 26, wherein the concept corresponding to the machine-readable ID that is returned by the output interface unit is related to the concept corresponding to each accepted machine-readable ID on the basis of an exact match relationship, narrower-concept relationship and/or a shortest path relationship.

29. A ontology engine, comprising:

a storage holding a plurality of discrete vocabularies, each vocabulary including a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID, at least some of the concepts in the different vocabularies being linked to each other on the basis of a prescribed relationship;

an input interface unit that accepts a machine-readable ID from a first one of the discrete vocabularies; and

an output interface unit that returns another machine-readable ID corresponding to a concept belonging to a second one of the discrete vocabularies that is related to the concept corresponding to each accepted machine-readable ID.

30. An input method for semantically tagging entered text information, comprising:

mounting a vocabulary that includes a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

entering text information;

matching the entered text information with the keywords that are held in the vocabulary and returning a list of candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description;

allowing selection of one of the candidates; and

returning the machine-readable ID corresponding to the selected candidate.

31. An output method for disambiguating text information by detecting a tag attached to the text information, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

extracting a machine-readable ID from text information; and

returning at least one of the keywords corresponding to the extracted machine-readable ID by looking up the vocabulary.

32. The output method according to claim 31, wherein a machine readable ID is extracted from text information that is searched from at least one member selected from a group consisting of files, web sites and databases.

33. A file save method using an ontology engine, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

providing a file save dialog that allows text information describing the file to be entered;

matching the text information with the keywords in the vocabulary and extracting corresponding machine-readable IDs from the vocabulary;

listing candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description;

allowing a user to select one of the candidates; and

tagging the file with the machine-readable ID corresponding to the selected candidate before saving the file.

34. A file save method using an ontology engine, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

providing a file save dialog that indicates a directory in which a file is going to be saved and allows text information describing the file to be entered;

matching the text information with the keywords in the vocabulary and extracting corresponding machine-readable IDs from the vocabulary;

listing candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description;

allowing a user to select one of the candidates; and

tagging the file with the machine-readable ID corresponding to the selected candidate before saving the file.

35. A method of allocating a file that is tagged with a machine-readable ID corresponding to a concept to a virtual directory according to the concept by using an ontology engine, comprising:

creating a plurality of virtual directories each represented by a concept; and

allocating a file to at least one of the virtual directories according to a machine-readable ID that is tagged to the file and matches the concept represented by the at least one of the virtual directories.

36. The method according to claim 35, wherein the matching of the concepts of the directories with those corresponding to the machine-readable IDs that are tagged to the files are based on a member selected from a group consisting of an exact match relationship and a parent-child relationship.

37. The method according claim 36, wherein the matching of the concepts of the directories with those corresponding to the machine-readable IDs that are tagged to the files is based on a parent-child relationship where all concepts of the directories are ancestors of the IDs tagged to the files.

38. The method according to claim 35, wherein at least some of the concepts are related to each other by a non-exact match relationship, and the matching of the concepts of the directories with those corresponding to the machine-readable IDs that are tagged to the files are at least partly based on the non-exact match relationship.

39. The method according to claim 38, wherein concepts are also related to each other on the basis of a parent-child relationship, and the matching of the concepts of the directories with those corresponding to the machine-readable IDs that are tagged to the files are at least partly based on the non-exact match relationship to the ancestors of the machine-readable ID.

40. A file search method using an ontology engine, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

entering text information that describes a desired file;

matching the text information with the keywords in the vocabulary and extracting corresponding machine-readable IDs from the vocabulary;

listing candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description;

allowing a user to select one of the candidates; and

searching a file that is tagged with a machine-readable ID corresponding to the selected candidate.

41. The file search method according to claim 40, further comprising searching a file that is tagged with another machine-readable ID which is related to the machine-readable ID corresponding to the selected candidate in terms of the corresponding concepts in a prescribed relationship.

42. The file search method according to claim 41, wherein the prescribed relationship is a member selected from at least one of a group consisting of exact-match, parent-child and non-exact-match.

43. The file search method according to claim 42, wherein the descendents of the input machine-readable ID are matched with the machine-readable ID tagged with the file.

44. The file search method according to claim 42, wherein input machine-readable ID is matched with concepts that are related to the machine-readable ID in the tagged file through a non-exact match relationship.

45. The file search method according to claim 44, wherein the input machine-readable ID is matched with concepts that are related to the ancestors of the machine-readable ID in the tagged file through a non-exact match relationship.

46. The file search method according to claim 41, wherein the search is done on the basis of a criterion specified in a query language.

47. The file search method according to claim 41, wherein the search is done on the basis of rules.

48. A method of accepting a command in application software, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to a command for the application software and at least one keyword corresponding to each command;

entering text information that describes a desired command;

matching the text information with the keywords in the vocabulary and extracting corresponding commands from the vocabulary;

listing candidates each corresponding to one of the extracted commands and including a corresponding description;

allowing a user to select one of the candidates; and

forwarding a command that corresponds to the selected candidate for execution in the application software.

49. The method of accepting a command in application software according to claim 48, wherein the entering of text is done through voice recognition.

50. The method of accepting a command in application software according to claim 48, wherein the input parameters of the command is entered through the same input method.

51. A method of embedding a machine-readable ID along with text information in a document so as to serve as a command in an application software, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to certain specific data for the application software and at least one keyword corresponding to each specific data;

entering text information that describes desired command;

matching the text information with the keywords in the vocabulary and extracting a corresponding machine-readable ID from the vocabulary; and

forwarding the extracted machine-readable ID to be stored in the document.

52. A method of embedding a machine-readable ID along with text information in a document so as to serve as input data for a command in an application software, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to certain specific data for the application software and at least one keyword corresponding to each specific data;

entering text information that describes desired data;

matching the text information with the keywords in the vocabulary and extracting a corresponding machine-readable ID from the vocabulary; and

forwarding the extracted machine-readable ID to be stored in the document.

53. A method of publishing a plurality of messages so as to selectively deliver the messages to each of a plurality of subscribers by taking into account a predetermined preference of the subscriber, comprising:

mounting a vocabulary that holds a plurality of machine-readable IDs each corresponding to a concept and at least one keyword corresponding to each machine-readable ID;

allowing each subscriber to enter text information that represents a preference of the subscriber;

assigning at least one of the machine-readable IDs to the subscriber that is extracted from the vocabulary by matching the entered text information with the keywords;

assigning at least one machine-readable ID to each published message according to a concept that represents contents and/or attributes of the message;

finding matches between the machine-readable IDs assigned to the subscribers and the machine-readable IDs assigned to the messages; and

delivering each message only to those subscribers whose machine-readable ID matches with the machine-readable ID of the message.

54. The method according to claim 53, wherein the step of assigning at least one of the machine-readable IDs to the subscriber that is extracted from the vocabulary by matching the entered text information with the keywords is performed by using an input interface unit that accepts text information, selects those machine-readable IDs whose keywords match up with the text information, and returns a list of candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description.

55. The method according to claim 53, wherein the step of assigning at least one machine-readable ID to each published message according to a concept that represents contents and/or attributes of the message is performed by using an input interface unit that accepts text information, selects those machine-readable IDs whose keywords match up with the text information, and returns a list of candidates each corresponding to one of the selected machine-readable IDs and including a corresponding description.

56. The method according to claim 53, wherein a machine-readable ID assigned to a message matches with a machine-readable ID assigned to a subscriber, when the message machine-readable ID is related to the subscriber machine-readable ID through relationships selected from a group consisting of an exact match, child and descendant relationship.

57. The method according to claim 53, wherein a plurality of machine-readable IDs are assigned to at least to some of the subscribers, and the machine-readable IDs of such a subscriber are matched with those of the messages according to a combination of logical expressions.

58. A method according to claim 53, wherein a plurality of machine-readable IDs are assigned to at least to some of the subscribers, and the machine-readable IDs of such a subscriber are matched with those of the messages according to rules.