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.
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.