| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tavern (0) - 16 freq cavern (1) - 4 freq taverns (1) - 9 freq taivern (1) - 14 freq taen (2) - 1001 freq avert (2) - 1 freq taeen (2) - 1 freq haver (2) - 6 freq tvery (2) - 2 freq favert (2) - 1 freq wavers (2) - 1 freq taers (2) - 19 freq taivers (2) - 3 freq bayern (2) - 9 freq raver (2) - 4 freq thern (2) - 1 freq travers (2) - 4 freq ahern (2) - 1 freq davert (2) - 1 freq caven (2) - 1 freq taiver (2) - 2 freq taser (2) - 3 freq cavers (2) - 6 freq wavery (2) - 1 freq ta'en (2) - 36 freq |
tavern (0) - 16 freq taivern (1) - 14 freq cavern (2) - 4 freq taverns (2) - 9 freq taiver (3) - 2 freq taivert (3) - 2 freq raivern (3) - 1 freq taurn (3) - 1 freq waverin (3) - 1 freq govern (3) - 3 freq tern (3) - 1 freq thern (3) - 1 freq waveran (3) - 1 freq haverin (3) - 25 freq tvery (3) - 2 freq tver (3) - 3 freq taperin (3) - 1 freq taivers (3) - 3 freq tae'n (4) - 1 freq toarn (4) - 1 freq naver (4) - 3 freq tirn (4) - 35 freq tierin (4) - 2 freq taviani (4) - 2 freq coveran (4) - 2 freq |
SoundEx code - T165 touberin - 1 freq tavern - 16 freq tavern's - 1 freq taivern - 14 freq twa-fur-wan - 1 freq tabernacle - 4 freq taverns - 9 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 - TFRN doverin - 15 freq devoorin - 2 freq tavern - 16 freq differen - 1 freq deveron - 1 freq taivern - 14 freq devourin - 6 freq differin - 6 freq differiny - 1 freq deifferin - 1 freq doavrin - 1 freq differin' - 1 freq differn - 1 freq diffren - 1 freq differin - 1 freq |
TAVERN |
| Time to execute Levenshtein function - 0.197089 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.363675 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.027817 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.037910 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.000924 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. |