| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erpoo (0) - 1 freq srpo (2) - 1 freq groo (2) - 4 freq poo (2) - 18 freq broo (2) - 164 freq eynoo (2) - 3 freq eros (2) - 16 freq error (2) - 16 freq proo (2) - 3 freq errol (2) - 2 freq 'roo (2) - 1 freq cerfoo (2) - 1 freq enoo (2) - 8 freq droo (2) - 1 freq ervo (2) - 2 freq roo (2) - 79 freq expo (2) - 1 freq e'noo (2) - 2 freq froo (2) - 4 freq meroo (2) - 1 freq eanoo (2) - 3 freq troo (2) - 51 freq ergo (2) - 1 freq irpdo (2) - 1 freq eenoo (2) - 57 freq |
erpoo (0) - 1 freq ervo (3) - 2 freq rp (3) - 8 freq roo (3) - 79 freq expo (3) - 1 freq irpdo (3) - 1 freq ergo (3) - 1 freq arp (3) - 1 freq europ (3) - 2 freq srpo (3) - 1 freq rop (3) - 6 freq poo (3) - 18 freq irp (3) - 2 freq eros (3) - 16 freq rior (4) - 1 freq nrp (4) - 1 freq erm (4) - 70 freq rof (4) - 3 freq ern (4) - 14 freq roog (4) - 3 freq rype (4) - 5 freq rico (4) - 2 freq rope (4) - 118 freq roon (4) - 1633 freq irip (4) - 1 freq |
SoundEx code - E610 europe - 170 freq europe' - 3 freq europa - 7 freq euraip - 27 freq ervo - 2 freq 'europe - 1 freq eerf - 1 freq europ - 2 freq euripe - 1 freq erf - 2 freq erpoo - 1 freq |
MetaPhone code - ERP europe - 170 freq europe' - 3 freq europa - 7 freq euraip - 27 freq 'europe - 1 freq europ - 2 freq euripe - 1 freq erpoo - 1 freq |
ERPOO |
| Time to execute Levenshtein function - 0.212544 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.366706 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.028128 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.038009 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.000922 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. |