Please include a report file with a discription of your solution.
- "Me spell rite"
The Evil Lord Wladimir has cast the Spellus Incorrectus magical spell on your fellow students. Your task is to
implement a simple spell checker that decides whether each individual word in a text file is spelled correctly.
You might use the english word list available at: [login to view URL]
Try: a naive (linear list) approach, string BBST, trie and a hash map. You may use library solutions for BBST, e.g. std::ordered_set or alike.
Compare running times for dictionary building and spell checking on a large piece of text.
Your report should contain description of algorithms, comparison findings including graphs showing the relation of RT against the text length.
1 freelancer está oferecendo em média $45 para esse trabalho
Hi i have read the description about implementation of a spell checker using various data structures. I can build all the required data structures quickly and efficiently. Please DM me so that we can start immediately.