A Review Paper on Text Corrector Using Finite Automata

EasyChair Preprint 7631

Abstract

Time plays an important role in everyone’s life, and for some, it is not easy to spare it. In scenarios where a person has to meticulously keep track of spelling legibility and websites that are to be listed, time runs short. And it is therefore important to rely upon tools like spelling checkers to ensure minimum human error. Use of Deterministic Finite Automata is undertaken, to identify which language a given string of characters is from, and also to verify whether the order of strings represents the structure of a valid URL. When a DFA is being run, it will come to the end of the string after a while. And then will result in a match, if possible.

Keyphrases: Levenshtein edit distance, deterministic finite automata, nondeterministic finite automata, spell checker

@booklet{EasyChair:7631,
  author    = {Mrugakshi Deshmukh and Shreyash Deshmukh and Devansh Jangid and Dhanashree Dewalkar and Rushikesh Dighole},
  title     = {A Review Paper on Text Corrector Using Finite Automata},
  howpublished = {EasyChair Preprint 7631},
  year      = {EasyChair, 2022}}