Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
twa-fur-wan (0) - 1 freq twinty-wan (5) - 3 freq twa-pun (5) - 1 freq watter-wal (5) - 1 freq twenty-wan (5) - 5 freq twa-fal (5) - 1 freq twa-twa (5) - 1 freq twa-fower (5) - 1 freq swallowan (6) - 1 freq throwan (6) - 4 freq labour-men (6) - 1 freq waash-han (6) - 1 freq faur-awa (6) - 8 freq taurn (6) - 1 freq warnan (6) - 1 freq clamouran (6) - 1 freq tra-la-la (6) - 8 freq taakin-an (6) - 1 freq two-man (6) - 1 freq faur-away (6) - 1 freq baurman (6) - 5 freq swanswan (6) - 1 freq wanderan (6) - 2 freq tartan (6) - 92 freq tae-an (6) - 2 freq |
twa-fur-wan (0) - 1 freq twa-fower (8) - 1 freq twinty-wan (8) - 3 freq twenty-wan (8) - 5 freq twa-fal (9) - 1 freq twa-twa (9) - 1 freq twa-pun (9) - 1 freq watter-wal (9) - 1 freq twal-nuin (10) - 1 freq a-flowin (10) - 1 freq twa-verb (10) - 2 freq tae--an (10) - 1 freq free-for-aw (10) - 1 freq twantie-ane (10) - 2 freq whaur-in (10) - 1 freq twa-tree (10) - 1 freq twintywan (10) - 1 freq twa-horse (10) - 1 freq far-han (10) - 2 freq twa-foot (10) - 1 freq watter-waal (10) - 1 freq twaa-year-aul (10) - 2 freq hauf-won (10) - 1 freq wafer-thin (10) - 1 freq faur-ben (10) - 1 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 - TWFRWN twa-fur-wan - 1 freq |
TWA-FUR-WAN |
Time to execute Levenshtein function - 0.218780 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.397350 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.027030 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.037633 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.000916 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. |