Spell Corrector

Background

It is a program in which for a given string it checks if the spelling provided is correct or not, if not then it recommends words. We use the concepts of levenshtein distance(Edit Distance) to consider possible recommended words for the given string. Trie data structure is used for storing words with count of how many times word was found in the text file(big.txt) used. Idea was taken from Peter Norvig's article(How to Write a Spelling Corrector) and understanding of some C++ aspects of implementation from here.

Getting Started and Deployment

Just download the whole repository in zip format ,unzip it. Then double click the 'Spell Corrector.exe'. It will open a console where on screen instructions are provided.

Prerequisites

Concepts

• Trie Data Structure.

• Levenshtein distance for strings.

• C++.

Software and Tools

• Any C++ IDE (I used DevC++)

• Any Code Editor (I used Sublime Text3)

Installing

Download all the files of repository. Create a project in IDE and add the files('main.cpp','spell_corrector.h' and 'spell_corrector.cpp') to the project. Then build and run the project.

Screenshot of my IDE:-

Contributing

Please read CONTRIBUTING.md for details on our code of conduct, and the process for submitting pull requests to me.

Authors

• Anudeex D Shetty - anudeexCR7

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Acknowledgments

• Hat tip to anyone who's code was used
• Inspiration
• Peter Norvig link
• grandpriest link
• felipefarinon link