| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arbuthnot (0) - 1 freq arbuthnots (1) - 1 freq a'thoot (4) - 1 freq adjutant (4) - 1 freq argument (4) - 80 freq authort (4) - 2 freq aathoot (4) - 1 freq author (4) - 37 freq ambushit (4) - 1 freq garbutt (4) - 1 freq athoot (4) - 319 freq ruth (5) - 145 freq throuchoot (5) - 1 freq trauchlet (5) - 1 freq amputatit (5) - 3 freq burnet (5) - 2 freq broucht (5) - 14 freq abeen't (5) - 1 freq abstract (5) - 16 freq altho' (5) - 2 freq aught (5) - 4 freq burn't (5) - 1 freq buther (5) - 11 freq frunt (5) - 21 freq ambush (5) - 5 freq |
arbuthnot (0) - 1 freq arbuthnots (2) - 1 freq bothert (7) - 37 freq bathert (7) - 11 freq debutante (7) - 1 freq orbitan (7) - 2 freq unbathert (7) - 1 freq aritenite (7) - 1 freq yarbent (7) - 2 freq orbitin (7) - 1 freq bithert (7) - 2 freq earth-nut (7) - 1 freq garbutt (7) - 1 freq aathoot (7) - 1 freq argument (7) - 80 freq authort (7) - 2 freq athoot (7) - 319 freq adjutant (7) - 1 freq ambushit (7) - 1 freq a'thoot (7) - 1 freq arbehd (8) - 1 freq abaht (8) - 2 freq urqu-hart (8) - 1 freq bethenec (8) - 1 freq ruthy (8) - 2 freq |
SoundEx code - A613 arrived - 140 freq arrivit - 7 freq arbitration - 4 freq arbitrary - 4 freq arbiter - 2 freq arbiters - 1 freq arbitraetors - 1 freq arbeit - 1 freq arbitrar - 1 freq arbuthnot - 1 freq airpot - 1 freq arbuthnots - 1 freq arrivd - 1 freq arbehd - 1 freq |
MetaPhone code - ARB0NT arbuthnot - 1 freq |
ARBUTHNOT |
| Time to execute Levenshtein function - 0.288583 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.536406 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.072627 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.087963 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.000878 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. |