| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arbitrar (0) - 1 freq arbitrary (1) - 4 freq arbiter (2) - 2 freq arabstar (3) - 3 freq orbital (3) - 3 freq orbitan (3) - 2 freq arbiters (3) - 1 freq artstrad (3) - 2 freq britian (4) - 1 freq obituary (4) - 5 freq frustra (4) - 1 freq critter (4) - 3 freq farrar (4) - 1 freq rattra (4) - 4 freq arsia (4) - 1 freq armstrang (4) - 1 freq articoal (4) - 1 freq raiglar (4) - 15 freq betray (4) - 10 freq auxiliar (4) - 2 freq habitat (4) - 3 freq abittie (4) - 1 freq aretha (4) - 1 freq arabia' (4) - 1 freq registrar (4) - 2 freq |
arbitrar (0) - 1 freq arbitrary (1) - 4 freq arbiter (3) - 2 freq arbiters (4) - 1 freq orbitan (5) - 2 freq arabstar (5) - 3 freq orbital (5) - 3 freq robotars (6) - 1 freq arbitraetors (6) - 1 freq artur (6) - 1 freq baiturr (6) - 1 freq librar (6) - 8 freq embitter (6) - 1 freq arbitration (6) - 4 freq orbit (6) - 10 freq arthur (6) - 38 freq abother (6) - 1 freq rither (6) - 6 freq briar (6) - 1 freq eraitur (6) - 1 freq birr (6) - 24 freq biter (6) - 1 freq rattray (6) - 2 freq contrar (6) - 10 freq unbitter (6) - 1 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 - ARBTRR arbitrary - 4 freq arbitrar - 1 freq |
ARBITRAR |
| Time to execute Levenshtein function - 0.210194 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.387234 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.029237 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.041464 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.001109 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. |