21. The non-transitory machine-readable medium of claim 14 , wherein the data structure for the dictionary is a prefix tree, the browser-based application further comprising sets of instructions for: changing a set of characters in a misspelled word; discarding, after changing each character, the change when a resulting string is not found in the dictionary prefix tree; and identifying a set of suggestions for the misspelled word when changing the set of characters in the misspelled word results a in valid string in the dictionary prefix tree.
26. The non-transitory machine-readable medium of claim 21 , the browser-based application further comprising sets of instructions for: scoring the set of suggestions for the misspelled word based on a number of characters that are changed in the misspelled word before changing a set of characters in the misspelled word results a valid string in the dictionary prefix tree; and displaying up to a predetermined number of high scored suggestions.