| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignores (0) - 10 freq ignore (1) - 59 freq ignoret (1) - 4 freq ignored (1) - 45 freq snores (2) - 6 freq ignorn (2) - 1 freq ignoran (2) - 2 freq ignorin (2) - 35 freq gnomes (2) - 2 freq ignort (2) - 3 freq ignire (2) - 1 freq ignites (2) - 1 freq flores (3) - 1 freq ignite (3) - 4 freq i'core (3) - 1 freq noses (3) - 20 freq ignited (3) - 1 freq glore (3) - 5 freq igniter (3) - 2 freq gnome (3) - 2 freq godes (3) - 2 freq growes (3) - 31 freq globes (3) - 2 freq signages (3) - 2 freq indorrs (3) - 1 freq |
ignores (0) - 10 freq ignoret (2) - 4 freq ignored (2) - 45 freq ignore (2) - 59 freq ignire (3) - 1 freq ignites (3) - 1 freq gnomes (3) - 2 freq genres (3) - 13 freq ignort (3) - 3 freq snores (3) - 6 freq ignoran (3) - 2 freq ignorn (3) - 1 freq ignorin (3) - 35 freq genomes (4) - 1 freq tenures (4) - 1 freq gnosis (4) - 1 freq ignoramus (4) - 1 freq snares (4) - 4 freq signers (4) - 1 freq nories (4) - 25 freq goners (4) - 1 freq tenors (4) - 1 freq donors (4) - 1 freq glories (4) - 9 freq glares (4) - 8 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 - IKNRS ignores - 10 freq |
IGNORES |
| Time to execute Levenshtein function - 0.216984 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.415715 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.030065 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.041025 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.002418 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. |