Thanks to amonamon I managed to get the algorithm going!
By using this here code a Trie was implemented and filled with the english dictionary (around 23600 words).
By starting reading from each index in the string, feeding it the next char and then the next until the trie does no longer find any more possible solutions (misspelled word or ending of a real one plus the start of the next), judging this outcome and increase the index by 1 words can be found and analyzed.
V
THEQUICKBROWNFOX... Finds THE
_V
THEQUICKBROWNFOX... Finds HE
__V
THEQUICKBROWNFOX... Finds EQ
and so forth.
In this sequence it is possible to check the weigted edit distance between words and find misspellings. However, due to a lack of time this was never fully implemented in my project.
My project has a more advanced approach to this as it is a statistics tool to run sevreal iterations on a given set of texts so feel free to ask if you have more specific questions and I will answer by the best of my capabilities.
Thank you for all the help in this!