| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| turry-wurry (0) - 1 freq curly-wurly (3) - 1 freq hurly-burly (4) - 3 freq currywurst (4) - 1 freq territury (5) - 1 freq feery-tarry (5) - 1 freq third-world (6) - 1 freq territory (6) - 26 freq terrymaley (6) - 1 freq turnower (6) - 2 freq luvvy-duvvy (6) - 1 freq barrykerr (6) - 1 freq hert-sorry (6) - 2 freq hunky-dory (6) - 3 freq terrour (6) - 1 freq treasury (6) - 3 freq tuimberry (6) - 1 freq territours (6) - 2 freq tirli-wirli (6) - 3 freq turnt-up (6) - 4 freq tay-tray (6) - 1 freq turn-ups (6) - 1 freq treysures (6) - 4 freq treysure (6) - 4 freq tarrycroys (6) - 1 freq |
turry-wurry (0) - 1 freq curly-wurly (6) - 1 freq feery-tarry (8) - 1 freq territury (8) - 1 freq tirli-wirli (8) - 3 freq currywurst (8) - 1 freq hurly-burly (8) - 3 freq darrenmurray (9) - 6 freq territours (9) - 2 freq territour (9) - 4 freq tarrycroys (9) - 1 freq tug-o-war (9) - 1 freq terrour (9) - 1 freq barrykerr (9) - 1 freq turnower (9) - 2 freq territory (9) - 26 freq hert-sorry (9) - 2 freq twa-wird (10) - 1 freq thrie-year (10) - 1 freq terryhowson (10) - 1 freq terrifeart (10) - 2 freq time-worn (10) - 1 freq terrier (10) - 13 freq hairt-warm (10) - 1 freq terror (10) - 40 freq |
SoundEx code - T660 terrier - 13 freq terror - 40 freq there're - 1 freq thare're - 1 freq thare'r - 1 freq trurh - 1 freq truer - 5 freq terrour - 1 freq thrie-year - 1 freq tarrier - 1 freq thrower - 1 freq turry-wurry - 1 freq three-year - 1 freq truiro - 1 freq |
MetaPhone code - TRWR drawer - 132 freq turry-wurry - 1 freq |
TURRY-WURRY |
| Time to execute Levenshtein function - 0.383182 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.841519 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.114411 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.133883 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.001072 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. |