ZavierYang/N-gram-model-for-Hangman-game
Use different orders of N-gram model to play Hangman game.
This project helps students and language enthusiasts explore how different N-gram language models perform in the classic game of Hangman. You input a hidden word and observe how the model, using its understanding of common word patterns, attempts to guess it letter by letter. This is ideal for anyone studying natural language processing concepts or interested in AI game-playing strategies.
No commits in the last 6 months.
Use this if you are a student or educator wanting to see practical applications of N-gram models and compare their effectiveness in a game context.
Not ideal if you're looking for a highly competitive Hangman AI or a general-purpose language model for real-world applications beyond game demonstration.
Stars
16
Forks
6
Language
Python
License
—
Category
Last pushed
Jun 26, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/nlp/ZavierYang/N-gram-model-for-Hangman-game"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
hangyav/textLSP
Language server for text spell and grammar check with various tools.
google-research/electra
ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators
gsurma/text_predictor
Char-level RNN LSTM text generatorđź“„.
ujjax/pred-rnn
PredRNN: Recurrent Neural Networks for Predictive Learning using Spatiotemporal LSTMs
oliverguhr/fullstop-deep-punctuation-prediction
A model that predicts the punctuation of English, Italian, French and German texts.