Abstract

Full-text retrieval has the advantages of searching documents over a wide range of words and accessing original text directly. However, because of the inadequate processing speed and insufficient memory capacity, there has been little work done on full text retrieval systems in the past. With the emergence of very large capacity compact disk ROM (CD ROM), research in full-text retrieval systems is becoming increasingly important. Practical systems based on Boolean retrieval models have appeared. However, in spite of its ability to process structured queries, the Boolean model has been criticised for its inability to provide ranked output as all retrieved documents are considered equally important. Probabilistic models have been proposed by some scholars to solve this problem and have successfully been implemented on a small scale trial basis in indexing retrieval systems. This paper focuses on applying the probabilistic model into the full-text retrieval system. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.