Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{199795,
        author = {Abhishek Bahubali Patil and Siddhant Suryakant Miraje and Rohit Ashok Bahir and Piyush Chougule and Prof. Samdhan Jadhav},
        title = {Hybrid Fuzzy Search Engine Using Trie, BK-Tree and Inverted Index},
        journal = {International Journal of Innovative Research in Technology},
        year = {2026},
        volume = {12},
        number = {11},
        pages = {15237-15243},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=199795},
        abstract = {The fast-paced expansion of the amount of data stored within various digital forms, the requirement for more efficient and tolerant search engines is becoming increasingly evident. During searches for information, many users will make typographical errors or input incomplete queries into search engines to get the needed results; however, traditional search engines are based on exact keyword matches, which limit their ability to return the most relevant documents. The proposed hybrid fuzzy search engine combines three different data structures (Trie, BK-Tree, and inverted index) to increase overall accuracy and performance of searches regardless of how close the keywords entered by the user match the exact keywords used within the document. A Trie provides the ability to perform extremely rapid prefix-based lookups; BK-Trees allow for performing approximate string matches through the use of edit distance; and the inverted index provides the capability to retrieve a document quickly based on a term found in that document. The proposed hybrid fuzzy search engine uses a multi-step (multiple stage) approach for processing user query input that will help to weight the accuracy of its responses against its computational efficiency. Tests run on a large universal dataset produced approximately 90% recall with response lags averaging 20-30ms. Based on these results, it appears that the proposed hybrid fuzzy search engine represents an efficient and usable alternative solution to meet the needs of next generation digital information retrieval systems.},
        keywords = {Fuzzy Search, Approximate String Matching, Trie, BK-Tree, Inverted Index, Information Retrieval},
        month = {April},
        }