| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| toughest (0) - 4 freq roughest (1) - 3 freq tougher (2) - 3 freq touches (2) - 21 freq toughness (2) - 1 freq tought (2) - 3 freq bought (3) - 80 freq poshest (3) - 2 freq pouthert (3) - 1 freq bougies (3) - 1 freq couches (3) - 2 freq doughnut (3) - 7 freq triggest (3) - 1 freq roughed (3) - 1 freq roughcast (3) - 2 freq touzelt (3) - 1 freq nought (3) - 20 freq toght (3) - 1 freq rought (3) - 1 freq hughes (3) - 5 freq touched (3) - 75 freq dourest (3) - 3 freq youngest (3) - 34 freq soughed (3) - 1 freq ought (3) - 11 freq |
toughest (0) - 4 freq roughest (2) - 3 freq tought (3) - 3 freq tighes (4) - 1 freq toght (4) - 1 freq taught (4) - 66 freq highest (4) - 20 freq heighest (4) - 2 freq laighest (4) - 1 freq touches (4) - 21 freq toughness (4) - 1 freq tougher (4) - 3 freq bought (5) - 80 freq thought (5) - 490 freq tough (5) - 38 freq doughnut (5) - 7 freq coughs (5) - 6 freq dought (5) - 1 freq tourist (5) - 48 freq toucht (5) - 13 freq fouthiest (5) - 1 freq troughs (5) - 4 freq foggiest (5) - 8 freq aghast (5) - 3 freq tight (5) - 71 freq |
SoundEx code - T223 toughest - 4 freq thickest - 1 freq touchstone - 1 freq thecoastguy - 6 freq thecastlehunter - 3 freq thisistimdean - 1 freq thecoastwalker - 1 freq twosistersonebody - 1 freq txkeyxqdq - 1 freq theawaysection - 1 freq thecastleguy - 1 freq |
MetaPhone code - TFST devisit - 4 freq deficit - 10 freq toughest - 4 freq diffused - 2 freq devised - 1 freq tvosewd - 1 freq |
TOUGHEST |
| Time to execute Levenshtein function - 0.213876 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.335284 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.027511 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.037116 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.000846 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. |