| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arab (0) - 4 freq arabs (1) - 4 freq arb (1) - 4 freq ara (1) - 1 freq aran (1) - 5 freq rab (1) - 172 freq alab (1) - 1 freq crab (1) - 32 freq drab (1) - 7 freq arabi (1) - 1 freq 'rab (1) - 2 freq grab (1) - 114 freq aab (1) - 3 freq apb (2) - 1 freq tab (2) - 7 freq farar (2) - 1 freq arp (2) - 1 freq aib (2) - 2 freq wrat (2) - 14 freq cara (2) - 3 freq aga (2) - 8 freq dram (2) - 115 freq agae (2) - 2 freq ard (2) - 4 freq nab (2) - 10 freq |
arab (0) - 4 freq arabi (1) - 1 freq rab (1) - 172 freq arb (1) - 4 freq rob (2) - 73 freq aab (2) - 3 freq arabia (2) - 3 freq orb (2) - 2 freq rb (2) - 8 freq grab (2) - 114 freq rub (2) - 51 freq rib (2) - 8 freq ara (2) - 1 freq 'rab (2) - 2 freq alab (2) - 1 freq crab (2) - 32 freq drab (2) - 7 freq aran (2) - 5 freq arabs (2) - 4 freq arky (3) - 1 freq reeb (3) - 1 freq craib (3) - 5 freq gab (3) - 32 freq -ab (3) - 1 freq jrb (3) - 3 freq |
SoundEx code - A610 arrive - 52 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.454756 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.617615 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.029098 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.079983 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.001290 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. |