| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignorant (0) - 37 freq ignoran (1) - 2 freq ignorin (2) - 35 freq eegnorant (2) - 1 freq ignurnt (2) - 1 freq imporant (2) - 1 freq ignoret (2) - 4 freq ignorin' (2) - 1 freq iggerant (2) - 1 freq ignort (2) - 3 freq ignorance (2) - 32 freq ignoring (2) - 2 freq ignorn (2) - 1 freq infront (3) - 1 freq ignore (3) - 58 freq itinerant (3) - 1 freq migrant (3) - 6 freq innocent (3) - 35 freq ignores (3) - 10 freq instant (3) - 33 freq ignoramus (3) - 1 freq groant (3) - 2 freq grant (3) - 101 freq important (3) - 368 freq ignored (3) - 43 freq |
ignorant (0) - 37 freq ignurnt (2) - 1 freq eegnorant (2) - 1 freq ignoran (2) - 2 freq ignorance (3) - 32 freq ignoring (3) - 2 freq ignort (3) - 3 freq ignorn (3) - 1 freq ignoret (3) - 4 freq ignorin (3) - 35 freq iggerant (3) - 1 freq ignorin' (3) - 1 freq groant (4) - 2 freq itinerant (4) - 1 freq grant (4) - 101 freq imporant (4) - 1 freq ignore (5) - 58 freq groint (5) - 3 freq granut (5) - 1 freq graint (5) - 4 freq granit (5) - 2 freq granet (5) - 1 freq gnurlit (5) - 3 freq graunt (5) - 1 freq grunt (5) - 32 freq |
SoundEx code - I256 ignorant - 37 freq ignore - 58 freq ignored - 43 freq 'ignoramus - 1 freq ignores - 10 freq ignorin - 35 freq ignorin' - 1 freq ignorance - 32 freq ignoramuses - 2 freq ignire - 1 freq ignort - 3 freq ignorn - 1 freq ignoran - 2 freq ignoramus - 1 freq ignurnt - 1 freq ignoret - 4 freq ignoring - 2 freq |
MetaPhone code - IKNRNT ignorant - 37 freq ignurnt - 1 freq |
IGNORANT |
| Time to execute Levenshtein function - 0.239651 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.555420 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027101 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.038302 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.030958 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |