| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignorin (0) - 35 freq ignoring (1) - 2 freq ignoran (1) - 2 freq ignorin' (1) - 1 freq ignorn (1) - 1 freq ignored (2) - 45 freq snorin (2) - 19 freq ignore (2) - 59 freq ignitin (2) - 1 freq ignoret (2) - 4 freq ignorant (2) - 37 freq ignort (2) - 3 freq ignores (2) - 10 freq notin (3) - 6 freq hinnerin (3) - 2 freq stoorin (3) - 2 freq glourin (3) - 1 freq kiggerin (3) - 1 freq grin (3) - 137 freq nonin (3) - 1 freq porin (3) - 1 freq injin (3) - 33 freq inclin (3) - 1 freq smoorin (3) - 10 freq nogin (3) - 1 freq |
ignorin (0) - 35 freq ignoran (1) - 2 freq ignorn (1) - 1 freq ignorin' (2) - 1 freq ignoring (2) - 2 freq ignort (3) - 3 freq ignores (3) - 10 freq ignoret (3) - 4 freq ignorant (3) - 37 freq ignored (3) - 45 freq ignitin (3) - 1 freq snorin (3) - 19 freq ignore (3) - 59 freq gnawin (4) - 2 freq winrin (4) - 2 freq gurrin (4) - 1 freq ignition (4) - 2 freq nynorn (4) - 1 freq garrin (4) - 35 freq unnerin (4) - 1 freq norn (4) - 34 freq ignorance (4) - 34 freq gaarin (4) - 1 freq honourin (4) - 2 freq grouin (4) - 10 freq |
SoundEx code - I256 ignorant - 37 freq ignore - 59 freq ignored - 45 freq 'ignoramus - 1 freq ignores - 10 freq ignorin - 35 freq ignorin' - 1 freq ignorance - 34 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 - IKNRN ignorin - 35 freq ignorin' - 1 freq ignorn - 1 freq ignoran - 2 freq |
IGNORIN |
| Time to execute Levenshtein function - 0.307059 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.407881 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.027805 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.038610 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.001184 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. |