| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urrs (0) - 1 freq errs (1) - 1 freq ur's (1) - 1 freq gurrs (1) - 1 freq urns (1) - 2 freq furrs (1) - 1 freq urss (1) - 1 freq urr (1) - 40 freq burrs (1) - 2 freq purrs (1) - 3 freq urbs (1) - 1 freq urrr (1) - 1 freq terrs (2) - 1 freq ehrs (2) - 2 freq ards (2) - 14 freq uk's (2) - 3 freq ur (2) - 604 freq serrs (2) - 5 freq eras (2) - 2 freq gras (2) - 5 freq urdu (2) - 17 freq ulls (2) - 1 freq curers (2) - 1 freq burss (2) - 1 freq gris (2) - 1 freq |
urrs (0) - 1 freq errs (1) - 1 freq urrr (2) - 1 freq urbs (2) - 1 freq arras (2) - 24 freq rrus (2) - 1 freq purrs (2) - 3 freq orras (2) - 1 freq airrs (2) - 2 freq gurrs (2) - 1 freq burrs (2) - 2 freq furrs (2) - 1 freq urns (2) - 2 freq ur's (2) - 1 freq urr (2) - 40 freq urss (2) - 1 freq lars (3) - 1 freq fres (3) - 1 freq rts (3) - 1 freq furs (3) - 6 freq arra (3) - 32 freq ours (3) - 16 freq jurors (3) - 24 freq torrs (3) - 2 freq kerrs (3) - 9 freq |
SoundEx code - U620 urge - 27 freq uruguy - 1 freq urrh's - 1 freq urss - 1 freq uarke - 1 freq uerk - 1 freq uork - 1 freq urgh - 2 freq urrs - 1 freq urwise - 1 freq €˜urgh - 2 freq €˜urs - 1 freq ur's - 1 freq €˜ur's - 3 freq 'ur's - 1 freq urx - 1 freq uorhxya - 1 freq |
MetaPhone code - URS urrh's - 1 freq urss - 1 freq urrs - 1 freq €˜urs - 1 freq ur's - 1 freq €˜ur's - 3 freq 'ur's - 1 freq |
URRS |
| Time to execute Levenshtein function - 0.209716 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.370490 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.030899 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.036799 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.000875 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. |