How Difficult is it to Develop a Perfect Spell-checker? A Cross-linguistic Analysis through Complex Network Approach

Simple item page
dc.creatorChoudhury, Monojit
dc.creatorThomas, Markose
dc.creatorMukherjee, Animesh
dc.creatorBasu, Anupam
dc.creatorGanguly, Niloy
dc.date2007-03-21
dc.date.accessioned2026-07-07T07:53:06Z
dc.date.available2026-07-07T07:53:06Z
dc.descriptionThe difficulties involved in spelling error detection and correction in a language have been investigated in this work through the conceptualization of SpellNet - the weighted network of words, where edges indicate orthographic proximity between two words. We construct SpellNets for three languages - Bengali, English and Hindi. Through appropriate mathematical analysis and/or intuitive justification, we interpret the different topological metrics of SpellNet from the perspective of the issues related to spell-checking. We make many interesting observations, the most significant among them being that the probability of making a real word error in a language is propotionate to the average weighted degree of SpellNet, which is found to be highest for Hindi, followed by Bengali and English.
dc.description8 pages, 3 figures, to be published in the proceedings of HLT-NAACL Workshop - TextGraphs 2
dc.identifierhttps://arxiv.org/abs/physics/0703198
dc.identifierhttp://arxiv.org/abs/physics/0703198
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126129
dc.subjectPhysics and Society
dc.titleHow Difficult is it to Develop a Perfect Spell-checker? A Cross-linguistic Analysis through Complex Network Approach
dc.typetext

Files

Collections

arXiv