Algorithms lab project. Based on optimal string alignment algorithm (extended Levenshtein), implemented with dynamic programming. Contains training program for getting frequencies for weighting.
First of all, I have to say that your project is unbeliveable! The documentation is so clear and wide that it feels so professional! The code is pure and I can't find anything really worth of telling. Well, something is required so here is some minor things that you perhaps see worth of thinking!
Those 15,000 words are quite plenty but could it be more? I don't really know if this has any impact to your project but perhaps a larger collection could serve you more?
I see that there are more comments and javadoc in the SpellChecker than in the TrainSpellChecker. If this is a part of the final project remember to add those as well! Just like in the SpellChecker (really nicely done!). Same thing about tests etc.
Hmm, perhaps the lines in the code could be divided when those go over the prefered length? For example, Netbeans suggests that by white/grey line how long it should be.
Is there going to be tests for dao and ui as well? There is now tests only for domain. Maybe those are quite useless but maybe worth of something!
I really can't wait to see your demo and the project functioning when fully ready!
Tosi hyvä työ on tehty. Projekti on hyvä kokonaisuus ja aihe on valittu hyvin.
Kodi on hyvin jaettu, helppo lukea ja nimikkeitä ovat kunnossa.
Dokumentaatio on täydellinen, se avaa aiheen, prosessin ja anna selkeät ohjeet asennukseen.
Testejä on myös tehty.
Repository on siisti, gitin viestit kertovat hyvin sisällöstä, linkit kotisivulla.
Voitko tässä vaiheessa tehdä releasin? Jos työ on valmis, niin eikö nyt ole hyvä hetki? :)