Para-linguistic expansion

• US 20040039562A1
• Filed: 06/17/2003
• Published: 02/26/2004
• Est. Priority Date: 06/17/2002
• Status: Abandoned Application

• Current Assignee: Beingmeta, Inc.
• Original Assignee: Beingmeta, Inc.
• Inventors: Haase, Kenneth
• Application Number:
  US10/463,117
• Publication Number:
  US 20040039562A1
• Time in Patent Office: Days
• US Class Current: 704/1
• CPC Class Codes: G06F 16/3344 using natural language analysis
• CPC Class Codes: G06F 40/242 Dictionaries
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates

Abstract

The present invention relates to systems and methods for databases. One embodiment of the invention provides a system for managing at least one data item. The system includes: a para-linguistic analyzer operative to receive search data and to identify a first keytuple included in the search data; a keytuple expander in communication with the para-linguistic analyzer and operative to generate a set of keytuples associated with the first keytuple; and an information retrieval engine in communication with the keytuple expander and operative to manage at least one data item based at least in part on the set of keytuples.

Claims

1. A system for managing at least one data item, the system comprising:

a para-linguistic analyzer operative to receive search data and to identify a first keytuple included in the search'"'"'data;

a keytuple expander in communication with the para-linguistic analyzer and operative to generate a set of keytuples associated with the first keytuple; and

an information retrieval engine in communication with the keytuple expander and operative to manage at least one data item based at least in part on the set of keytuples.

2. The system of claim 1 wherein the system further comprises:

a fragmenter in communication with the para-linguistic analyzer and operative to receive documents and to separate the documents into a plurality of fragments, wherein the para-linguistic analyzer is operative to use a first fragment from the plurality of fragments as search data, and wherein the information retrieval engine associates the set of keytuples with the first fragment.

3. The system of claim 2 wherein the plurality of fragments are paragraphs.

4. The system of claim 1 wherein the search data is a query and wherein the information retrieval engine is operative to rank data items by comparing keytuple sets associated with data items with keytuple sets associated with the query.

5. The system of claim 1 wherein the search data is a text fragment and wherein the information retrieval engine is operative to rank data items by comparing keytuple sets associated with data items with keytuple sets associated with the query.

6. The system of claim 1 wherein the first keytuple is a pair of words with linguistic significance to the search data.

7. The system of claim 1 wherein the first keytuple is three words with linguistic significance to the search data.

8. A method for managing at least one data item, the method comprising:

receiving search data;

identifying a first keytuple included in the search data;

generating a set of keytuples associated with the first keytuple; and

managing at least one data item based at least in part on the set of keytuples.

9. The method of claim 8 wherein receiving search data comprises:

receiving a document;

separating the document into a plurality of text fragments; and

using a first text fragment from the plurality of text fragments as the search data.

10. The method of claim 9 wherein the text fragments are paragraphs.

11. The method of claim 9 wherein managing at least one data item comprises associating the generated set of keytuples with the first text fragment.

12. The method of claim 8 wherein the search data is a text fragment.

13. The method of claim 8 wherein identifying a first keytuple comprises identifying a plurality of first keytuples and wherein generating a set of keytuples comprises generating a set of keytuples for each of the plurality of first keytuples.

14. The method of claim 8 wherein the search data is text and wherein identifying the first keytuple comprises:

associating words in the text with parts-of-speech data;

determining root forms of words in the text; and

connecting the root forms of words based on the parts-of-speech data associated with the words.

15. The method of claim 8 wherein a keytuple is a plurality of words with linguistic significance to the search data.

16. The method of claim 15 wherein generating a set of keytuples comprises expanding the words of the keytuple to natural language synonyms.

17. The method of claim 15 wherein generating a set of keytuples comprises:

expanding the first keytuple to keytuple synonyms to create a first set of keytuples; and

expanding the words of each of the keytuples in the first set of keytuples to natural language synonyms to create a second set of keytuples.

18. The method of claim 8 wherein the search data is a query and wherein managing a data item comprises:

ranking a set of data items by comparing keytuple sets associated with data items with keytuple sets associated with the query.

19. The method of claim 8 wherein the search data is a fragment and wherein managing a data item comprises:

ranking a set of data items by comparing keytuple sets associated with data items with keytuple sets associated with the fragment.

20. A system for managing at least one data item, the system comprising:

para-linguistic analyzer means for receiving search data and for identifying a first keytuple included in the search data;

keytuple expander means in communication with the para-linguistic analyzer means, the keytuple expander means for generating a set of keytuples associated with the first keytuple; and

information retrieval means in communication with the keytuple expander means, the information retrieval means for managing at least one data item based at least in part on the set of keytuples.