Spell Checker Model for String Comparison in Automata

EasyChair Preprint 7375

Abstract

The Spell Checker project incorporates autosuggestion into a Windows-based application to provide spell checking and correction. By recognising spelling errors and making it quicker to repeat searches, it aids the user in decreasing typing time. The basic purpose of the spell checker is to give a consistent treatment of diverse spell repairs. To begin, a formal description of the spell checking and correction problem will be provided in order to provide a better understanding of these activities. A spell checker and corrector can be a stand-alone programme that processes a string of words or text, or it can be an embedded tool that is part of a larger programme, such as a word processor. Because fuzzy automaton outperforms finite automaton for string comparison when unique degrees of similarity for specific pairs of symbols or sequences of symbols are defined, a method for converting finite automaton to fuzzy automaton has been presented. A finite automata can tell you whether or not a string is acceptable, whereas a fuzzy automaton can tell you how much of it is. Various search and replace methods are utilised to fit into the scope of a spell checker. Spell checking distinguishes between words that are correctly spelled and those that are misspelt in the language. When spell checking detects a misspelt word, it proposes one or more alternative alternatives as the proper spelling.

Keyphrases: Autosuggestions, Grammatical mistakes, N-Edit Distance, checking, spell checker

@booklet{EasyChair:7375,
  author    = {Kuldeep Vayadande and Neha Bhavar and Sayee Chauhan and Sushrut Kulkarni and Abhijit Thorat and Yash Annapure},
  title     = {Spell Checker Model for String Comparison in Automata},
  howpublished = {EasyChair Preprint 7375},
  year      = {EasyChair, 2022}}