A context sensitive real-time Spell Checker with language adaptability
TABLE I: Average Time taken by suggestion generation algorithms (Edit Distance = 2) (in millisecond)
['[BOLD] Token', '[BOLD] Trie', '[BOLD] DAWGs', '[BOLD] SDA']
We considered four approaches — Trie data structure, Burkhard-Keller Tree (BK Tree) , Directed Acyclic Word Graphs (DAWGs)  and Symmetric Delete algorithm (SDA)6. In Table I, we represent the performance of algorithms for edit distance 2 without adding results for BK trees because its performance was in range of couple of seconds.