Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
thirlstane (0) - 1 freq thirlestane (1) - 3 freq airnstane (3) - 1 freq rhinestane (3) - 1 freq thainstane (3) - 1 freq athelstane (3) - 1 freq hailstane (3) - 1 freq hertstane (3) - 1 freq lairstane (3) - 3 freq thairlane (3) - 4 freq thirty-ane (3) - 3 freq millstane (3) - 2 freq thrip-stane (3) - 1 freq thrustle (4) - 1 freq thirlin (4) - 7 freq brie-stane (4) - 1 freq throstle (4) - 2 freq thistle (4) - 48 freq thirldad (4) - 3 freq door-stane (4) - 1 freq crib-stane (4) - 2 freq limestane (4) - 1 freq thirl't (4) - 1 freq tiltan (4) - 1 freq whitane (4) - 1 freq |
thirlstane (0) - 1 freq thirlestane (1) - 3 freq athelstane (4) - 1 freq thristin (5) - 2 freq thrip-stane (5) - 1 freq thairlane (5) - 4 freq hertstane (5) - 1 freq thrustin (5) - 5 freq hailstane (5) - 1 freq thainstane (5) - 1 freq christan (6) - 1 freq threshan (6) - 1 freq thirstier (6) - 1 freq hailstone (6) - 1 freq tristan (6) - 15 freq christine (6) - 16 freq philistine (6) - 3 freq thirls (6) - 5 freq thorstein (6) - 26 freq thirlt (6) - 36 freq thirsty (6) - 13 freq charlatan (6) - 3 freq thirlit (6) - 8 freq thirl't (6) - 1 freq millstane (6) - 2 freq |
SoundEx code - T642 three-leggit - 2 freq threeleggit - 2 freq trial's - 14 freq trials - 18 freq thirls - 5 freq trellis - 1 freq trails - 13 freq tirlis - 1 freq 'troilus - 1 freq tirls - 4 freq tirelessly - 1 freq threi-legged - 2 freq three-legget - 1 freq threelegget - 1 freq thrills - 6 freq tarelgin - 2 freq trolleys - 4 freq treeless - 3 freq trawls - 2 freq three-leiged - 2 freq twirls - 1 freq trills - 2 freq thirlstane - 1 freq trollach - 1 freq thirlestane - 3 freq trölligarth - 1 freq trollies - 1 freq thorow-lik - 1 freq trolls - 6 freq tireless - 1 freq trilogy - 2 freq trials- - 1 freq turlygod - 4 freq trail's - 1 freq |
MetaPhone code - 0RLSTN thirlstane - 1 freq thirlestane - 3 freq |
THIRLSTANE |
Time to execute Levenshtein function - 0.247252 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.393918 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.028768 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.038854 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.000797 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. |