| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| taverns (0) - 9 freq tavern (1) - 16 freq tavern's (1) - 1 freq caverns (1) - 4 freq tarns (2) - 1 freq takers (2) - 2 freq travers (2) - 4 freq wavers (2) - 1 freq taves (2) - 4 freq savers (2) - 1 freq ravens (2) - 5 freq taivern (2) - 14 freq laerns (2) - 4 freq taivers (2) - 3 freq taers (2) - 19 freq baerns (2) - 1 freq havers (2) - 35 freq tasers (2) - 1 freq cavern (2) - 4 freq saveens (2) - 1 freq averts (2) - 1 freq terns (2) - 2 freq cavers (2) - 6 freq havens (2) - 1 freq cameras (3) - 10 freq |
taverns (0) - 9 freq caverns (2) - 4 freq tavern's (2) - 1 freq tavern (2) - 16 freq taivern (3) - 14 freq tarns (3) - 1 freq taivers (3) - 3 freq terns (3) - 2 freq turns (4) - 354 freq cavers (4) - 6 freq havens (4) - 1 freq ternos (4) - 1 freq thorns (4) - 20 freq taeburns (4) - 1 freq trens (4) - 1 freq tirns (4) - 4 freq tavernier (4) - 1 freq thoarns (4) - 6 freq haiverins (4) - 2 freq averts (4) - 1 freq taves (4) - 4 freq wavers (4) - 1 freq savers (4) - 1 freq taers (4) - 19 freq laerns (4) - 4 freq |
SoundEx code - T165 touberin - 1 freq tavern - 16 freq tavern's - 1 freq taivern - 14 freq twa-fur-wan - 1 freq taverns - 9 freq tabernacle - 3 freq tapewirm - 1 freq tipperin - 2 freq twa-pronged - 1 freq tap-brainch - 1 freq taperin - 1 freq tobarandualchais - 1 freq taeburns - 1 freq tippermuir - 1 freq theferryinn - 1 freq tavernier - 1 freq tapperon - 1 freq tippermuirbooks - 62 freq thefearmerchant - 1 freq thebrainofspock - 1 freq theformerd - 1 freq tfrm - 1 freq |
MetaPhone code - TFRNS difference - 142 freq tavern's - 1 freq diff'rence - 2 freq diffrence - 10 freq differince - 3 freq taverns - 9 freq dïffrence - 2 freq deiference - 1 freq deference - 4 freq deeference - 1 freq differance - 2 freq |
TAVERNS |
| Time to execute Levenshtein function - 0.312070 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.597192 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.067320 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.037812 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.000839 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. |