Method and system for information retrieval

• US 20030066025A1
• Filed: 07/15/2002
• Published: 04/03/2003
• Est. Priority Date: 07/13/2001
• Status: Abandoned Application

• Current Assignee: Alexander Pertsemlidis, Harold R. Garner
• Original Assignee: Alexander Pertsemlidis, Harold R. Garner
• Inventors: Pertsemlidis, Alexander, Garner, Harold R.
• Application Number:
  US10/196,738
• Publication Number:
  US 20030066025A1
• Time in Patent Office: Days
• US Class Current: 715/500
• CPC Class Codes: G06F 16/3329 Natural language query formulation or dialogue systems

Abstract

The present invention is directed toward an improved method of mining data. The method uses a query composed of natural language text that may be expanded to include related terms and concepts. The query is parsed into a variety of textual elements that may be keywords, phrases, or concepts, and compared with one or more databases to determine what, if any, information units in the database are related to textual elements that have been culled from the query.

Claims

1. A method for retrieving information from computer databases comprising the steps of:

extracting one or more textual elements from one or more queries for comparison with a target database;

assigning a weighting factor to each textual element; and

comparing the textual elements with the target database to identify a first group of selected information units.

2. The method recited in claim 1, wherein the textual elements further comprise keywords.

3. The method recited in claim 1, wherein the textual elements further comprise phrases.

4. The method recited in claim 1, wherein the query comprises a natural language description.

5. The method recited in claim 1, wherein the query comprises a passage from a reference publication.

6. The method recited in claim 1, wherein the comparing comprises application of a similarity algorithm.

7. The method recited in claim 1, wherein the comparing further comprises a concept counting step.

8. The method recited in claim 1, wherein the comparing further comprises application of a keyword distance matrix.

9. The method recited in claim 1, wherein the assignment of the weighting factor is performed manually.

10. The method recited in claim 1, wherein the weighting factor is normalized.

11. The method recited in claim 1, further comprising the step of applying synonym expansion to the query prior to extracting the textual elements.

12. The method recited in claim 1, further comprising the step of applying a lexical variant algorithm to the query prior to extraction of the textual elements.

13. The method recited in claim 1, further comprising the step of applying a grammar induction algorithm to the query prior to extraction of the textual elements.

14. The method recited in claim 1, further comprising the step of applying a stemming algorithm to the query prior to extraction of the textual elements.

15. The method recited in claim 1, wherein the information units comprise complete documents.

16. The method recited in claim 1, wherein the information units comprise less than a complete document.

17. The method recited in claim 1, further comprising the step of repeating the extracting, assigning and comparing steps using the first groups of selected information units as the query to produce a second group of selected information units.

18. The method recited in claim 1, further comprising the step of outputting the first set of information units.

19. The method recited in claim 18, wherein the outputting is in the form of a relational matrix.

20. The method recited in claim 19, wherein the relational matrix is three-dimensional.

21. An information retrieval system comprising:

a processor capable of extracting one or more textual elements from one or more queries for comparison with a target database, assigning a weighting factor to each textual element, and comparing the textual elements with the target database to identify a first group of selected information units; and

one or more databases communicably coupled to the processor.

22. The system recited in claim 21, wherein the textual elements further comprise keywords.

23. The system recited in claim 21, wherein the textual elements further comprise phrases.

24. The system recited in claim 21, wherein the query comprises a natural language description.

25. The system recited in claim 21, wherein the query comprises a passage from a reference publication.

26. The system recited in claim 21, wherein the comparing comprises application of a similarity algorithm.

27. The system recited in claim 21, wherein the comparing further comprises a concept counting step.

28. The system recited in claim 21, wherein the comparing further comprises application of a keyword distance matrix.

29. The system recited in claim 21, wherein the assignment of the weighting factor is performed manually.

30. The system recited in claim 21, wherein the weighting factor is normalized.

31. The system recited in claim 21, further comprising the step of applying synonym expansion to the query prior to extracting the textual elements.

32. The system recited in claim 21, further comprising the step of applying a lexical variant algorithm to the query prior to extraction of the textual elements.

33. The system recited in claim 21, further comprising the step of applying a grammar induction algorithm to the query prior to extraction of the textual elements.

34. The system recited in claim 21, further comprising the step of applying a stemming algorithm to the query prior to extraction of the textual elements.

35. The system recited in claim 21, wherein the information units comprise complete documents.

36. The system recited in claim 21, wherein the information units comprise less than a complete document.

37. The system recited in claim 21, further comprising the step of repeating the extracting, assigning and comparing steps using the first groups of selected information units as the query to produce a second group of selected information units.

38. The system recited in claim 21, further comprising the step of outputting the first set of information units.

39. The system recited in claim 38, wherein the outputting is in the form of a relational matrix.

40. The system recited in claim 39, wherein the relational matrix is represented in three dimensions using dimensionality reduction.