| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2015-03-31 | Implement Damerau-Levenshtein distance (add transposition) | Peter Wu | 2 | -2/+23 | |
| Suggested around 6:16 of the Coursera lecture on "The Noisy Channel Model of Spelling". https://class.coursera.org/nlp/lecture/22 | |||||
| 2015-03-31 | Add simple getSmoothedCount implementation | Peter Wu | 1 | -3/+7 | |
| 2015-03-31 | Tests and implementation for getCandidateWords | Peter Wu | 2 | -5/+155 | |
| SpellCorrector.ALPHABET is made static to allow for the test. | |||||
| 2015-03-30 | Reformat code (apply consistent coding style) | Peter Wu | 4 | -132/+113 | |
| 2015-03-30 | Initial checkin of assignment4-0.0 | Peter Wu | 15 | -0/+566662 | |
| Extracted from assignment4-0.0.zip (without build/ dirs). The CRLF in test-sentences.txt was replaced by LFs. https://www.win.tue.nl/~wstahw/edu/2ID90/assignments/4/assignment4-0.0.zip size 5189037 sha1 5e0a58acffbcac6e5f13837c98c2c0bb936304b5 | |||||
 |
index : tue/2ID90-AI/assignment4 | |
| Spellchecker | 2ID90 Artificial Intelligence group 8 |
| summaryrefslogtreecommitdiff |
path: root/spellchecker