| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| treisur (0) - 17 freq traisur (1) - 3 freq treesur (1) - 1 freq treisure (1) - 19 freq treisurs (1) - 7 freq treisurin (2) - 1 freq pleisur (2) - 33 freq treasuir (2) - 1 freq traisurs (2) - 1 freq meisur (2) - 18 freq treisured (2) - 3 freq leisur (2) - 4 freq treesure (2) - 2 freq traisure (2) - 1 freq treasure (2) - 40 freq treis (2) - 9 freq treisures (2) - 1 freq treasury (2) - 3 freq treysure (2) - 4 freq cretur (3) - 1 freq treibute (3) - 1 freq pleisurs (3) - 1 freq breist (3) - 69 freq tress (3) - 4 freq reised (3) - 1 freq |
treisur (0) - 17 freq treesur (1) - 1 freq treisure (1) - 19 freq traisur (1) - 3 freq traisure (2) - 1 freq treasury (2) - 3 freq treysure (2) - 4 freq treesure (2) - 2 freq treasure (2) - 40 freq treasuir (2) - 1 freq treisurs (2) - 7 freq treisures (3) - 1 freq traesir (3) - 2 freq treis (3) - 9 freq trooser (3) - 10 freq treisurin (3) - 1 freq treisured (3) - 3 freq traisurs (3) - 1 freq traisured (4) - 2 freq treesures (4) - 1 freq triste (4) - 1 freq raiser (4) - 2 freq trateur (4) - 1 freq preser (4) - 1 freq treason (4) - 14 freq |
SoundEx code - T626 treesure - 2 freq trigger - 13 freq treisur - 17 freq treisurs - 7 freq traisure - 1 freq troosers - 77 freq trousers - 12 freq traicherous - 2 freq three-quaarters - 2 freq trees're - 1 freq treesur - 1 freq troqueer - 2 freq tarrycroys - 1 freq three-score - 3 freq treisured - 3 freq treasure - 40 freq trickerie - 1 freq 'treacherie - 1 freq treacherse - 1 freq treacherie - 4 freq treasured - 10 freq treachery - 3 freq triggers - 1 freq treisure - 19 freq tresors - 1 freq three-quarters - 4 freq trigger-pu'in - 1 freq treacherous - 4 freq trooser - 10 freq traisured - 2 freq treysures - 4 freq treysure - 4 freq three-coorse - 1 freq treasures - 4 freq thresher - 2 freq treasury - 3 freq torchirt - 1 freq trizzure - 5 freq threequarters - 1 freq traisur - 3 freq traisurs - 1 freq trackers - 1 freq treacherously - 1 freq tyre-scaurs - 2 freq three-quarter - 3 freq trickery - 1 freq trookers - 2 freq traisure- - 1 freq treisures - 1 freq treasurer - 4 freq 'treacherous - 1 freq thrie-score-an-ten - 1 freq traesir - 2 freq troker - 1 freq €œtreasure - 1 freq threshart - 4 freq treisurable - 2 freq trokerie - 1 freq triggered - 2 freq treisurin - 1 freq treesures - 1 freq treasuir - 1 freq treezhird - 1 freq trooker - 2 freq thearchers - 1 freq trees-are - 1 freq terzer - 1 freq trucker - 1 freq troqueerprimary - 1 freq torkirra - 1 freq threecheersfurdaguizerjarl - 1 freq |
MetaPhone code - TRSR treesure - 2 freq dresser - 23 freq treisur - 17 freq traisure - 1 freq trees're - 1 freq treesur - 1 freq treasure - 40 freq treisure - 19 freq trooser - 10 freq treysure - 4 freq treasury - 3 freq trizzure - 5 freq traisur - 3 freq traisure- - 1 freq traesir - 2 freq €œtreasure - 1 freq treasuir - 1 freq trees-are - 1 freq terzer - 1 freq |
TREISUR |
| Time to execute Levenshtein function - 0.227088 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.424891 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.029188 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.039277 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.000943 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. |