Implemented Binary Search Trees to store entries in a synonym thesaurus. If a word occurs above a certain threshold, the program will replace it with a random synonym from the thesaurus. This project’s goal is to practice good design principles as well as to reinforce my knowledge of Data Structure.
-
Notifications
You must be signed in to change notification settings - Fork 0
Implemented Binary Search Trees to store entries in a synonym thesaurus. If a word occurs above a certain threshold, the program will replace it with a random synonym from the thesaurus. This project’s goal is to practice good design principles as well as to reinforce my knowledge of Data Structure.
quoc-jordan-an/The-Grammar-Checker
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented Binary Search Trees to store entries in a synonym thesaurus. If a word occurs above a certain threshold, the program will replace it with a random synonym from the thesaurus. This project’s goal is to practice good design principles as well as to reinforce my knowledge of Data Structure.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published