Swathanthra Malayalam Computing - Tasks: task #12558, Create a spell checker for Indic...
You are not allowed to post comments on this tracker with your current authentication level.
task #12558: Create a spell checker for Indic language that understands inflections
Submitter: | Hrishikesh K B <hrishikesh_kb> | ||
Submitted: | Tue 02 Apr 2013 09:07:53 PM UTC | ||
Votes: | 1 | ||
Category: | Spell-Checker | Should Start On: | Tue 02 Apr 2013 12:00:00 AM UTC |
Should be Finished on: | Tue 31 Dec 2013 12:00:00 AM UTC | Priority: | 5 - Normal |
Status: | None | Privacy: | Public |
Assigned to: | None | Percent Complete: | 0% |
Open/Closed: | Open | Effort: | 0.00 |
No files currently attached
Depends on the following items: None found
Items that depend on this one: None found
Carbon-Copy List
There is 1 vote so far. Votes easily highlight which items people would like to see resolved in priority, independently of the priority of the item set by tracker managers.
Follows 1 latest change.
Date | Changed by | Updated Field | Previous Value | => | Replaced by |
---|---|---|---|---|---|
2016-03-01 | shootingstar | Carbon-Copy | - | Added shootingstar |
Powered by Savane 3.13-3230.
Corresponding source code
SILPA project has a spellchecker written using python with a not so simple algorithm. But still it is not capable of handling inflection and agglutination occurring in Indian languages especially south Indian languages. The dictionary we have for Malayalam spellchecker have about 150000 words. Of course we can expand the dictionary, but that doesn't have much value since words can be formed in Malayalam or Tamil etc by joining multiple words. In addition to that, words get inflected based on grammar forms(sandhi), plural, gender etc. Hunspell has a system to handle this, but so far nobody succeeded in getting it working for multi level suffix stripping as required for Malayalam. Some times a Malayalam word can be formed by more than 5 words joining together. We will need a word splitting logic or a table taking care of all patterns. The project is to attempt solving this with hunspell. If that is not feasible(hunspell upstream is not active), develop an algorithm and implement it.