| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ignorance (0) - 34 freq iggerance (2) - 2 freq ignoran (2) - 2 freq ignorant (2) - 37 freq ignore (3) - 59 freq ignorn (3) - 1 freq hindrance (3) - 5 freq innocence (3) - 18 freq ignorin' (3) - 1 freq ignoring (3) - 2 freq ignorin (3) - 35 freq importance (3) - 59 freq entrance (3) - 51 freq insurance (3) - 18 freq hinnerance (3) - 1 freq ignoramus (3) - 1 freq instance (3) - 158 freq annoyance (3) - 12 freq infancy (4) - 3 freq bromance (4) - 1 freq ordance (4) - 1 freq iggerant (4) - 1 freq insane (4) - 8 freq assonance (4) - 1 freq resonance (4) - 5 freq |
ignorance (0) - 34 freq iggerance (3) - 2 freq ignorant (3) - 37 freq ignoran (3) - 2 freq ignorin' (4) - 1 freq ignoring (4) - 2 freq ignorn (4) - 1 freq ignorin (4) - 35 freq ignoramus (5) - 1 freq annoyance (5) - 12 freq hinnerance (5) - 1 freq greeance (5) - 18 freq ignurnt (5) - 1 freq eegnorant (5) - 1 freq hindrance (5) - 5 freq ignore (5) - 59 freq insurance (5) - 18 freq innocence (5) - 18 freq entrance (5) - 51 freq grange (6) - 4 freq utterance (6) - 4 freq penance (6) - 2 freq ignoret (6) - 4 freq confrence (6) - 1 freq hinderance (6) - 1 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 - IKNRNS ignorance - 34 freq |
IGNORANCE |
| Time to execute Levenshtein function - 0.350322 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.526469 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.027797 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.056049 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.000926 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. |