A classical scenario in machine learning from Russell and Norvig "Artificial Intelliegence A Modern Approach Third Edition"

Baseline trial and conclusion of the gujarati spell checker based on Norvig's solution

An Elixir implementation of Peter Norvig's Sudoku solver.

Simple project for auto correction of words engine using Naive Bayes as an algorithm in modeling.

Norvig's implementation of the General Problem Solver

Given an utterance the spellcheck corrects each token based on a frequency dictionary. It is language agnostic that means it works with any language as soon as a frequency dictionary is provided. The approach is based on the Peter Norvig's blog post on the spell check (see: https://norvig.com/spell-correct.html)

Práctica do curso de especialización en Intelixencia Artificial e Big Data de Formación Profesional - IES de Teis

A Python Implementation of the General Problem Solver

Learning about the utilization of Norvig as a spelling correction with an approach using BERT.

🎍 A simple spellchecker implemented in JavaScript, designed to correct misspelled words based on word frequency from a corpus ✨

Replicated google search engine using Lucene and Norvig Spell Correction program

Machine Learning Sudoku Solver that implmements various machine learning heauristics to solve 3x3, 4x4, and 5x5 sudoku puzzles