Sort system for text retrieval
作者： Michael L. Horowitz
DOI:
关键词: sort 、 Remainder 、 Heap (data structure) 、 Text retrieval 、 Information retrieval 、 Computer database 、 Computer science
摘要: The present invention is a method for operating computer system to retrieve information from database. This decomposes documents the database into subdocuments and then inverts Also, query retrieving decomposed terms. inverted terms are used compute score that indicates quantitative relation between in subdocuments. resulting list of their scores reorganized heap form. highest ranking subdocument selected by text associated with this displayed. remainder concurrently reheapified.
google.nl 参考文章(29)
John W. Tukey, Jan O. Pedersen, Method of ordering document clusters without requiring knowledge of user interests ,(1995)
Nelson Correa, Associative memory processing method for natural language parsing and pattern recognition ,(1995)
Jonathan J. Hull, Peter E. Hart, Image matching and retrieval by multi-access redundant hashing ,(1994)
Masaomi Atr Auditory And V Oda, Evaluation support method for retrieved data ,(1993)
Hiromichi Fujisawa, Atushi Hatakeyama, Jun'ichi Higashino, Document filing system with knowledge-base network of concept interconnected by generic, subsumption, and superclass relations ,(1986)
Michael L. Horowitz, Sort system for merging database entries ,(1999)
David A. Evans, Overlapping subdocuments in a vector space search process ,(1999)
John M. Knapman, User friendly data base access ,(1983)
Jim Driscoll, Process for determination of text relevancy ,(1993)