- Jframe for the gui
- Regular expressions
- Lambda
- Threads
- Levenstein algorithm
- Jfreechart for generating bar statistic
- Search for a word and highlight it, match case if needed.
- Replace a word in the text , match case if needed.
- Generate word statistic.
- Spellchecker.
Spellchecker works using the levenstein algorithm , to make it more memory efficent threads are used by dividing the wordlist used for checking in half. Then threads run simultaneously searching for similarities with other words. The Word class holds the name and the similarity in the form of an integer(the number of operations needed in order for the words to be identical). Tree sets are used to hold the Word object and sort them based on the integer similarity variable.