Conversion of Finite Automata to Fuzzy Automata for string comparison

Ramaswamy, Vidhya; Girijamma, H A

doi:10.5120/4625-6647

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm can use a variety of metrics for determining the distance between two words; and points out that finding the closest match between word and a large list of words, is an extremely demanding task. V. Ramaswamy and H. A. Girijamma [19] presented a way to convert finite automaton to fuzzy automaton as fuzzy automaton is better than finite automaton for strings comparison when individual levels of similarity for particular pairs of symbols or sequences of symbols are defined. A finite automaton is useful in defining whether a given string is accepted or not whereas fuzzy automaton determines the extent to which the string is accepted.…”

Section: Related Workmentioning

confidence: 99%

Automatic Spelling Correction based on n-Gram Model

Atawy¹,

ElGhany²

2018

IJCA

View full text Add to dashboard Cite

A spell checker is a basic requirement for any language to be digitized. It is a software that detects and corrects errors in a particular language. This paper proposes a model to spell error detection and auto-correction that is based on n-gram technique and it is applied in error detection and correction in English as a global language. The proposed model provides correction suggestions by selecting the most suitable suggestions from a list of corrective suggestions based on lexical resources and n-gram statistics. It depends on a lexicon of Microsoft words. The evaluation of the proposed model uses English standard datasets of misspelled words. Error detection, automatic error correction, and replacement are the main features of the proposed model. The results of the experiment reached approximately 93% of accuracy and acted similarly to Microsoft Word as well as outperformed both of Aspell and Google.

show abstract

Section: Related Workmentioning

confidence: 99%

Automatic Spelling Correction based on n-Gram Model

Atawy¹,

ElGhany²

2018

IJCA

View full text Add to dashboard Cite

show abstract

“…The algebraic study of fuzzy tree automata was done by Zoltan and Liu [10]. Few more papers appear in literature on fuzzy automata dealing with various issues and applications [1,6,7,8,9]. The aim of this paper is to introduce fuzzy tree automata defined on ranked alphabet an analogously to that of fuzzy automaton.…”

Section: Introductionmentioning

confidence: 99%