Method for document retrieval and for word sense disambiguation using neural networks
Patent 5317507 Issued on May 31, 1994. Estimated Expiration Date: 
May 31, 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.
May 31, 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.Patent ReferencesArrays of machines such as computers Multiple-parts-of-speech disambiguating method and apparatus for machine translation system Sentence analyzer Search improvements for electronic spelling machine Patent #: 5113340 InventorApplicationNo. 610430 filed on 11/07/1990US Classes:715/532DictionaryExaminersPrimary: Envall, Roy N. Jr.Assistant: Shingala, Gita D. Attorney, Agent or FirmInternational ClassG06F 015/38AbstractA method for storing and searching documents also useful in disambiguating word senses and a method for generating a dictionary of context vectors. The dictionary of context vectors provides a context vector for each word stem in the dictionary. A context vector is a fixed length list of component values corresponding to a list of word-based features, the component values being an approximate measure of the conceptual relationship between the word stem and the word-based feature. Documents are stored by combining the context vectors of the words remaining in the document after uninteresting words are removed. The summary vector obtained by adding all of the context vectors of the remaining words is normalized. The normalized summary vector is stored for each document. The data base of normalized summary vectors is searched using a query vector and identifying the document whose vector is closest to that query vector. The normalized summary vectors of each document can be stored using cluster trees according to a centroid consistent algorithm to accelerate the searching process. Said searching process also gives an efficient way of finding nearest neighbor vectors in high-dimensional spaces.Other References
| |
