Problem statement: Searching text materials is the one of the most important operations that carried out by search engines either on web or desktop applications, searching algorithms are required sometimes to find a specific word into a text, others to find a multi word term (pattern matching) into a text. Searching for term into a thesaurus database can be carried out using many searching algorithm such as brute-force algorithm and others. Approach: We addressed several issues concerning developing a searching algorithm that search terms into thesaurus database. Two exact algorithms were discussed and compared. The first algorithm, brute-force algorithm and the second one were proposed by this study to enhance brute-force algorithm. Results: We proposed an efficient search algorithm and compare it with brute force technique. Computational results showed that our algorithm can provide an efficient search algorithm that reduces the number of queries and the total time required to finish the required task. Conclusion: Our study showed an optimum solution for larger size of the studied problem with much less processing time than the brute-force algorithm. The modified algorithm has a higher efficiency to deal with Thesaurus Database searching problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.