Object location and processing

• US 9,773,056 B1
• Filed: 03/23/2011
• Issued: 09/26/2017
• Est. Priority Date: 03/23/2010
• Status: Expired due to Fees

• Current Assignee: Intelligent Language, LLC
• Original Assignee: Intelligent Language, LLC
• Inventors: Smyros, Athena Ann, Smyros, Constantine John
• Primary Examiner(s): Vu, Bai D.
• Application Number:
  US13/070,465
• Time in Patent Office: 2,379 Days
• Field of Search: None
• CPC Class Codes: G06F 16/3335 Syntactic pre-processing, e.g. stopword elimination, stemming
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

Embodiments described herein locate objects in input. Embodiments first parse the input into a form that can be used to perform the analysis required to construct a set of one or more objects. Embodiments then form, when possible, object character strings by using the grammatical values of the underlying terms. The set of object character strings can be used in a variety of textual analysis procedures, such as search, comparisons, and other combinatorial analysis that requires the use of objects in performing tasks related to an information repository of documents, files, messages, etc.

Claims

1. A computer program product having a non-transitory computer-readable medium having computer program logic recorded thereon for locating at least one object in a text input, the computer program product comprising:

means for parsing the text input into parsed terms, wherein the text input is a request to search for information in a repository, wherein the means for parsing the text input further comprises means for determining a fractional length, the fractional length indicating a number of term units from a first term unit to a next functional term unit;

means for analyzing the parsed terms to locate an object term and a plurality of non-object terms, wherein the object term is a noun and each non-object term is one of a verb, adverb, adjective, pronoun, preposition, conjunction, article, and interjection, wherein at least one object term is placed into an object string and at least one non-object term is placed into one of a plurality of non-object buckets; and

means for providing the object string and the plurality of non-object buckets to a search engine, wherein the search engine compares the object string and the non-object buckets with information in the repository.

2. The computer program product of claim 1, wherein the means for parsing the text input comprises:

means for receiving input;

means for locating terms in the text input; and

means for assigning a designation to each term.

3. The computer program product of claim 2, wherein the designation for each term is one of functional or content.

4. The computer program product of claim 3, wherein a functional term is one of an article, a preposition, a pronoun, and a conjunction and a content term is one of a noun, an adjective, an adverb, and a verb.

5. The computer program product of claim 1, wherein each term is separated from another term by a delimiter.

6. The computer program product of claim 5, wherein the delimiter is a space.

7. The computer program product of claim 1, wherein the text input comprise a plurality of nouns, wherein the means for analyzing the parsed terms comprises:

means for adding each noun to the object string.

8. The computer program product of claim 1, wherein the text input comprise a plurality of non-nouns, wherein the means for analyzing the parsed terms comprises:

means for adding each non-noun to one of the plurality of non-object buckets.

9. The computer program product of claim 1, wherein the parsed terms comprises a plurality of non-nouns of at least two types, wherein the means for analyzing the parsed terms comprises:

means for forming the plurality of non-object buckets with a respective non-object bucket for each non-noun type; and

means for adding each non-noun to the respective non-object bucket.

10. The computer program product of claim 9, wherein each non-noun type is one of a verb, adverb, adjective, pronoun, preposition, conjunction, article, and interjection.

11. The computer program product of claim 1, wherein the means for providing comprises:

means for providing the object string and the plurality of non-object buckets to a language analysis tool.

12. The computer program product of claim 1, wherein the search engine compares the object string and the plurality of non-object buckets with information in the repository according to one of an exact match, a simple keyword match, or a grammatical locator.

13. The computer program product of claim 1, wherein the input text includes a topic.

14. The computer program product of claim 1, wherein the parsed terms are in the form a numerical matrix.

15. The computer program product of claim 1, wherein the non-transitory computer-readable medium is associated with one of:

a computer, a laptop computer, a personal computer, a personal data assistant, a camera, phone, a cell phone, a computer server, a music player, a game box, a smart phone, and a data storage device.

16. A computer program product having a non-transitory computer-readable medium having computer program logic recorded thereon for locating at least one object in a text input, the computer program product comprising:

means for parsing the text input into parsed terms, wherein the text input is a request to search for information in a repository;

means for analyzing the parsed terms to locate an object term and a plurality of non-object terms, wherein the object term is a noun and each non-object term is one of a verb, adverb, adjective, pronoun, preposition, conjunction, article, and interjection, wherein at least one object term is placed into an object string and at least one of non-object term is placed into one of a plurality of non-object buckets, wherein the text input comprise a plurality of non-nouns, wherein the parsed terms comprise a plurality of non-nouns of at least two types, wherein the means for analyzing the parsed terms comprises;

means for forming the plurality of non-object buckets with a respective non-object bucket for each non-noun type; and

means for adding each non-noun to the respective non-object bucket; and

means for providing the object string and the plurality of non-object buckets to a search engine, wherein the search engine compares the object string and the non-object buckets with information in the repository.

17. The computer program product of claim 16, wherein the means for parsing the text input further comprises means for determining a fractional length, the fractional length indicating a number of term units from a first term unit to a next functional term unit.

18. The computer program product of claim 16, wherein the search engine compares the object string and the plurality of non-object buckets with information in the repository according to one of an exact match, a simple keyword match, or a grammatical locator.

19. The computer program product of claim 16, wherein the parsed terms are in the form a numerical matrix.

20. A computer program product having a non-transitory computer-readable medium having computer program logic recorded thereon for locating at least one object in a text input, the computer program product comprising:

means for parsing the text input into parsed terms, wherein the text input is a request to search for information in a repository;

means for analyzing the parsed terms to locate an object term and a plurality of non-object terms, wherein the object term is a noun and each non-object term is one of a verb, adverb, adjective, pronoun, preposition, conjunction, article, and interjection, wherein at least one object term is placed into an object string and at least one non-object term is placed into one of a plurality of non-object buckets; and

means for providing the object string and the plurality of non-object buckets to a search engine, wherein the search engine compares the object string and the non-object buckets with information in the repository.