Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arab (0) - 4 freq aab (1) - 3 freq arabs (1) - 3 freq crab (1) - 32 freq rab (1) - 169 freq drab (1) - 7 freq 'rab (1) - 2 freq arb (1) - 4 freq alab (1) - 1 freq aran (1) - 5 freq arabi (1) - 1 freq grab (1) - 110 freq ara (1) - 1 freq awae (2) - 22 freq bras (2) - 2 freq sarah (2) - 40 freq wrap (2) - 49 freq trap (2) - 60 freq raz (2) - 1 freq braa (2) - 59 freq frac (2) - 2 freq arra (2) - 31 freq ayar (2) - 1 freq zrae (2) - 1 freq are' (2) - 1 freq |
arab (0) - 4 freq arb (1) - 4 freq arabi (1) - 1 freq rab (1) - 169 freq ara (2) - 1 freq rub (2) - 50 freq rob (2) - 73 freq arabia (2) - 3 freq rb (2) - 8 freq rib (2) - 8 freq grab (2) - 110 freq orb (2) - 2 freq 'rab (2) - 2 freq drab (2) - 7 freq aran (2) - 5 freq crab (2) - 32 freq aab (2) - 3 freq arabs (2) - 3 freq alab (2) - 1 freq array (3) - 16 freq garyb (3) - 2 freq raf (3) - 7 freq area' (3) - 1 freq era (3) - 30 freq aifb (3) - 1 freq |
SoundEx code - A610 arrive - 51 freq awrfie - 2 freq arabia - 3 freq arab - 4 freq arabia' - 1 freq arabi - 1 freq arp - 1 freq ahrb - 1 freq arvie - 1 freq arb - 4 freq arfu - 1 freq |
MetaPhone code - ARB arabia - 3 freq arab - 4 freq arabia' - 1 freq arabi - 1 freq ahrb - 1 freq arb - 4 freq |
ARAB |
Time to execute Levenshtein function - 0.193983 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.346485 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.027927 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.042370 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.000830 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. |