| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignire (0) - 1 freq ignite (1) - 4 freq ignore (1) - 59 freq ignites (2) - 1 freq inite (2) - 6 freq ignited (2) - 1 freq ignores (2) - 10 freq ignored (2) - 45 freq ignoret (2) - 4 freq impire (2) - 2 freq ioniae (2) - 1 freq ignorn (2) - 1 freq ignort (2) - 3 freq igniter (2) - 2 freq nise (3) - 1 freq empire (3) - 82 freq inning (3) - 1 freq 'guir (3) - 1 freq gre (3) - 4 freq seignie (3) - 1 freq minite (3) - 1 freq centre (3) - 275 freq nice (3) - 426 freq gyre (3) - 13 freq €˜aire (3) - 1 freq |
ignire (0) - 1 freq ignore (1) - 59 freq ignite (2) - 4 freq genre (3) - 9 freq ignorn (3) - 1 freq igniter (3) - 2 freq ignoret (3) - 4 freq ignort (3) - 3 freq ignored (3) - 45 freq ignores (3) - 10 freq gnar (3) - 1 freq gunfire (4) - 3 freq gunfre (4) - 1 freq grie (4) - 6 freq igor (4) - 6 freq inner (4) - 46 freq signer (4) - 2 freq manere (4) - 2 freq gnome (4) - 2 freq vanir (4) - 5 freq ganie (4) - 6 freq snare (4) - 13 freq ianuare (4) - 1 freq agnne (4) - 1 freq manure (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 - IKNR ignore - 59 freq ignire - 1 freq |
IGNIRE |
| Time to execute Levenshtein function - 0.447660 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.786458 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.075314 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.089403 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.000923 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. |