This is a web-based dictionary search app built with a Trie data structure for efficient word search and autocomplete. It includes a feature for suggesting similar words using the Levenshtein distance algorithm, along with tracking the most frequently searched words using a min-heap.
- Word Search: Look up definitions of words.
- Autocomplete Suggestions: Provides word suggestions as you type based on a Trie structure.
- Misspelled Word Suggestions: Suggests similar words for misspelled entries using the Levenshtein distance.
- Most Frequent Searches: Displays the top k most frequently searched words.
- Frontend: HTML, CSS, JavaScript
- Backend: Python
- Data Structures: Trie, Min-Heap
- Algorithm: Levenshtein Distance for word similarity
- Type a word in the search bar and click "Search" to view its definition.
- As you type, autocomplete suggestions will appear based on the words in the Trie.
- If the exact word is not found, the app will suggest similar words using the Levenshtein distance algorithm.
- Most frequently searched words are shown at the bottom.
This project is licensed under the MIT License.
This README is designed for quick setup and understanding, and can be extended with additional details if needed!