Word Suggestion System Using Trie Data Structure

  • Unique Paper ID: 169162
  • Volume: 11
  • Issue: 6
  • PageNo: 1660-1663
  • Abstract:
  • This paper explores the development of an efficient word suggestion system utilizing a Trie data structure in C++. The project implements core DSA concepts like Trie Node, vectors, and depth-first search (DFS) for fast and scalable word suggestions based on user input. The system reads from a dictionary file, words.txt, and provides real-time suggestions, ensuring efficient memory usage and search times.

Copyright & License

Copyright © 2025 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.

BibTeX

@article{169162,
        author = {Burange Onkar and Dr. Mrs. Gauri Ghule and Ritesh Pangarkar and Shreyans Gandhi and Aditya Oza and Aditya Muttha},
        title = {Word Suggestion System Using Trie Data Structure},
        journal = {International Journal of Innovative Research in Technology},
        year = {2024},
        volume = {11},
        number = {6},
        pages = {1660-1663},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=169162},
        abstract = {This paper explores the development of an efficient word suggestion system utilizing a Trie data structure in C++. The project implements core DSA concepts like Trie Node, vectors, and depth-first search (DFS) for fast and scalable word suggestions based on user input. The system reads from a dictionary file, words.txt, and provides real-time suggestions, ensuring efficient memory usage and search times.},
        keywords = {},
        month = {November},
        }

Cite This Article

  • ISSN: 2349-6002
  • Volume: 11
  • Issue: 6
  • PageNo: 1660-1663

Word Suggestion System Using Trie Data Structure

Related Articles