Method and apparatus for information retrieval from a database by replacing domain specific stemmed phases in a natural language to create a search query
Patent 5265065 Issued on November 23, 1993. Estimated Expiration Date: October 8, 2011. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
A computer implemented process for creating a search query for an information retrieval system in which a database is provided containing a plurality of stopwords and phrases. A natural language input query defines the composition of the test of documents to be identified. Each word of the natural language input query is compared to the database in order to remove stopwords from the query. The remaining words of the input query are stemmed to their basic roots, and the sequence of stemmed words in the list is compared to phrases in the database to identify phrases in the search query. The phrases are substituted for the sequence of stemmed words from the list so that the remaining elements, namely the substituted phrases and unsubstituted stemmed words, form the search query. The completed search query elements are query nodes of a query network used to match representation nodes of a document network of an inference network. The database includes as options a topic and key database for finding numerical keys, and a synonym database for finding synonyms, both of which are employed in the query as query nodes.
Other References
Turtle et al., "Evaluation of an Interence Network-Based Retrieval Model", Transactions on Information Systems, Association for Computer Machinery, vol. 9, No. 3, pp. 187-223 (Jul. 1991)
Croft et al., "Interactive Retrieval of Complex Documents", Information Processing and Management, vol. 26, No. 5, pp. 593-613 (1990)
Haynes, "Designing a System for the Specialized User: A Case Study", Proceedings--1985 National Online MeetingLearned Information Inc., pp. 205-213, (Apr. 30, 1985)
Croft et al, "A Retrieval Model Incorporating Hypertext Links", Hypertex '89 Proceedings, Association for Computer Machinery, pp. 213-224 (Nov. 1989)
Turtle et al, "Inference Networks for Document Retrieval", Coins Technical Report 90-07, University of Massachusetts (Mar. 1990)
Turtle et al, "Inference Network for Document Retrieval", Sigir 90, Association for Computing Machinery, pp. 1-24 (Sep. 1990)
Turtle, "Inference Network for Document Retrieval", Ph.D. Dissertation, Coins Technical Report 90-92, University of Massachusetts (Oct. 1990)
Turtle et al, "Efficient Probabilistic Inference for Text Retrieval", Riao '91 Conference Proceedings, Recherche d'Information Assistee par Ordinateur, Universitat Automa de Barcelona, Spain, pp. 644-661 (Apr. 1991)
Porter, "An Algorithm for Suffix Skipping", Program, vol. 14, pp. 130-137 (1980
October 8, 2011. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
