Adaptive non-literal text string retrieval

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3642264, G06F 1730, G06F 1728

Patent

active

056008350

ABSTRACT:
Method and system for selectively retrieving information contained in a stored document set using a non-literal, or "fuzzy", search strategy. A text string query is transmitted (200) to a computer processor, and a dissimilarity value D.sub.i is assigned (208) to selected ones of stored text strings representative of information contained in a stored document set, based upon a first set of rules (106). A set of retrieved text strings representative of stored information and related to the text string query is generated (212), based upon a second set of rules (107). Each of the retrieved text strings has an associated dissimilarity value D.sub.i, which is a function of at least one rule R.sub.n from the first set of rules (106) used to retrieve the text string and a weight value w.sub.n associated with that rule R.sub.n. The retrieved text strings are displayed (216) preferably in an order based on their associated dissimilarity value D.sub.i. Once one or more of the retrieved text strings is chosen, the weight value w.sub.n associated with at least one rule of the first set of rules (106) is adjusted (220) and stored.

REFERENCES:
patent: 4453217 (1984-06-01), Boivie
patent: 5008818 (1991-04-01), Bocast
patent: 5099425 (1992-03-01), Kanno: Yuji et al.
J. E. Hopcroft and J. D. Ullman, "Introduction To Automata Theory, Languages, And Computation", Addison-Wesley Publishing Company, 1979.
Brunner and Korfhage, "An Automatic Improvement Processor For An Information Retrieval System," Proc. 2nd International Conference on Expert Database Systems, ed. by L. Kerschberg, Apr. 1988, pp. 449-468.
Feldman and Shapiro, "Spatial Machines: A More Realistic Approach to Parallel Computation", Communications of the ACM, vol. 35, No. 10, Oct. 1992, U.S.A., pp. 61-73.
Hopcroft and Ullman, "Finite Automata and Regular Expressions," Introduction To Automata Theory, Languages, and Computation, Addison-Wesley Publishing Company, U.S.A., 1979, pp. 13-29.
Kharin, "Context-Morphological Method of Iterative Search for Textual Information", 11444 Automatic Documentation & Mathematic Linguistics, vol. 25, 1991, pp. 13-19, Seriya 2, No. 6, New York, New York.
Kobayashi, Imamura, Takahashi, Kubota, Kanaoka, Hamamoto, and Tomita, "A Searching Method of the Most Similar String in The File of a Document Retrieval System", 8169 Systems and Computers in Japan, vol. 23, No. 2, 1992, New York, New York, pp. 24-38.
Wu, Sun, et al., "Fast Text Searching Allowing Errors", Communications of the ACM, Oct. 1992, vol. 35, No. 10, pp. 83-91.
Baeza-Yates, Ricardo, et al., "A New Approach to Text Searching", Communications of the ACM, Oct. 1992, vol. 35, No. 10, pp. 74-82.
Manber, Udi, et al., "Approximate String Matching with Arbitrary Costs for Text and Hypertext", Department of Computer Science, University of Arizona, Feb. 1990.
Schek, H. J., "Tolerating Fuzziness in Keywords by Similarity Searches", Kybernetes, 1977, vol. 6, pp. 175-184.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Adaptive non-literal text string retrieval does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Adaptive non-literal text string retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive non-literal text string retrieval will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-688802

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.