| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ambient (0) - 1 freq ancient (2) - 110 freq absent (2) - 12 freq ambience (2) - 4 freq mient (2) - 3 freq aucient (2) - 1 freq aliens (3) - 5 freq lambin (3) - 19 freq amble (3) - 3 freq aming (3) - 3 freq lambies (3) - 4 freq apent (3) - 29 freq abies (3) - 3 freq ambled (3) - 1 freq yarbent (3) - 2 freq ameest (3) - 1 freq bammiest (3) - 1 freq argiment (3) - 2 freq meint (3) - 6 freq anent (3) - 529 freq abilene (3) - 2 freq imminent (3) - 4 freq mament (3) - 14 freq abeen (3) - 154 freq ascent (3) - 2 freq |
ambient (0) - 1 freq mient (3) - 3 freq ambience (3) - 4 freq amount (4) - 50 freq mairnt (4) - 1 freq yarbent (4) - 2 freq amoont (4) - 44 freq iminent (4) - 1 freq mament (4) - 14 freq miynt (4) - 1 freq bint (4) - 10 freq maiment (4) - 2 freq meint (4) - 6 freq mint (4) - 64 freq aucient (4) - 1 freq absent (4) - 12 freq ancient (4) - 110 freq emerent (4) - 1 freq meent (4) - 22 freq moment (4) - 231 freq bent (4) - 104 freq ment (4) - 18 freq ambitons (5) - 1 freq amin (5) - 1 freq abinn (5) - 5 freq |
SoundEx code - A515 ambient - 1 freq anyfin - 8 freq ambience - 4 freq anyfink - 3 freq amabam - 2 freq amffmz - 1 freq ampandrew - 1 freq amfmon - 1 freq |
MetaPhone code - AMNT amoont - 44 freq amount - 50 freq amanda - 14 freq ambient - 1 freq 'amanda - 1 freq amn't - 1 freq ammonite - 1 freq amend - 3 freq amoontae - 1 freq |
AMBIENT |
| Time to execute Levenshtein function - 0.296584 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.522059 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.074305 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.087134 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.000949 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. |