![]() Ndiaye, M., Faltin, A.V.: Correcteur Orthographique Adapté à Apprentissage du Français. Pollock, J.J., Zamora, A.: Automatic spelling correction in scientific and scholarly text. Savary: Recensement et description des mots composés–méthodes et applications, version 1, 24 September 2011, 149–158 (2000) Oflazer, K.: Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction. Levenshtein, V.: Binary codes capable of correcting deletions, insertions, and reversals. Communications of the Association for Computing Machinery (1964) 59, 340–349 (2015)ĭamerau, F.J.: A technique for computer detection and correction of spelling errors. Putra, M.E.W., Suwardi, I.S.: Structural off-line handwriting character recognition using approximate subgraph matching and Levenshtein distance. Hall, P.A.V., Dowling, G.R.: Approximate string matching. In: The International Conference on Advanced Wireless, Information, and Communication Technologies (AWICT), vol. Nejja, M., Yousfi, A.: The context in automatic spell correction. Kukich, K.: Techniques for automatically correcting words in text. The performance of this algorithm is evaluated by suggestion generation accuracy for given misspelled words. In this paper, we have implemented a minimum edit distance algorithm and evaluated their performance with accuracy measure. ![]() While doing this, the misspelled word length is a key component to searching in the corpus so that, the searching complexity is minimum. The algorithm detects non-word spelling errors and generates a suitable suggestion set for misspelled words by matching them with the corpus. ![]() It corrects the spelling errors by performing various operations like substitution, insertion, and deletion of characters. In this paper, we proposed the minimum edit distance algorithm (MED) which correct the spelling mistakes in Marathi language text. The minimum edit distance is one of the string-matching algorithms used in various applications like text mining, spell checking, bioinformatics and so on. ![]() Spelling checker is the application used to correct the spelling mistakes done by users unintentionally. The performance of any search engine, social media word processor depends deeply on the spelling checkers, grammar checkers etc. ![]()
0 Comments
Leave a Reply. |