This is a simple probabilistic model for predicting the next most likely missing letter, given a set of already filled up letters of a word, in a game of Hangman. The model has been trained on corpus present in vocab.txt. Please look at Problem 1.9 of the pdf to understand the algorithmic concept and the specifics of the implementation.
-
Notifications
You must be signed in to change notification settings - Fork 0
ranakroychowdhury/AI-based-Probabilistic-Model-for-Hangman
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published