dc.contributor.author |
Win, Thazin |
|
dc.contributor.author |
Pa, Win Pa |
|
dc.date.accessioned |
2022-06-21T06:09:25Z |
|
dc.date.available |
2022-06-21T06:09:25Z |
|
dc.date.issued |
2021-02-25 |
|
dc.identifier.uri |
https://onlineresource.ucsy.edu.mm/handle/123456789/2656 |
|
dc.description.abstract |
This paper describes Myanmar spelling correction intended for real-word errors and non-word errors. There are three main modules in this paper. They are error detection,candidates generation, error correction. Dictionary look up method is used for detecting errors, Levenshtein Distance Algorithm is used for generating candidates and N-grams model is used for correcting errors. There can be human-generated misspellings which can be distinguished into three groups (i) Typographic Errors(Non-word error) (ii)Phonetic Errors(Cognitive error) (iii) Context Errors(Real word errors). This spelling correction can solve all of these three misspellings problem and the main contribution of this paper is to solve the context errors using n-grams model in sentence level. Moreover, this spelling correction can solve the pali misspelling errors. Experimental results show that each of error types can be solved by this spelling correction. The general accuracy of all error types is greater than 85%. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.publisher |
ICCA |
en_US |
dc.subject |
Levenshtein Distance Algorithm, Myanmar spelling correction, N-grams Model |
en_US |
dc.title |
Myanmar Spelling Correction Based On N-grams Model |
en_US |
dc.type |
Article |
en_US |