| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignore (0) - 58 freq ignored (1) - 43 freq ignores (1) - 10 freq ignorn (1) - 1 freq ignoret (1) - 4 freq ignire (1) - 1 freq ignort (1) - 3 freq igor (2) - 6 freq ignoran (2) - 2 freq ignorin (2) - 35 freq glore (2) - 5 freq ignite (2) - 4 freq snore (2) - 6 freq gnome (2) - 2 freq gore (2) - 5 freq incore (2) - 2 freq i'core (2) - 1 freq iphone (3) - 7 freq inde (3) - 4 freq glowe (3) - 3 freq tagore (3) - 2 freq ignorance (3) - 32 freq centre (3) - 268 freq bighorn (3) - 1 freq i'love (3) - 4 freq |
ignore (0) - 58 freq ignire (1) - 1 freq ignored (2) - 43 freq ignores (2) - 10 freq ignort (2) - 3 freq ignorn (2) - 1 freq ignoret (2) - 4 freq gnome (3) - 2 freq genre (3) - 9 freq snore (3) - 6 freq gnar (3) - 1 freq gore (3) - 5 freq ignite (3) - 4 freq igor (3) - 6 freq ignorin (3) - 35 freq ignoran (3) - 2 freq glore (3) - 5 freq gyre (4) - 13 freq glorie (4) - 32 freq gone (4) - 282 freq inner (4) - 44 freq grory (4) - 1 freq tenure (4) - 4 freq glenore (4) - 6 freq conor (4) - 10 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 - IKNR ignore - 58 freq ignire - 1 freq |
IGNORE |
| Time to execute Levenshtein function - 0.202777 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.394876 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.028259 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.037331 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.000811 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. |