| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| taen-like (0) - 3 freq taen-lik (1) - 1 freq tent-like (2) - 1 freq sae-lik (3) - 2 freq kin-like (3) - 1 freq daft-like (3) - 9 freq quaet-like (3) - 2 freq tae-time (3) - 1 freq saelike (3) - 3 freq rael-life (3) - 1 freq tramp-like (3) - 1 freq bien-lyke (3) - 1 freq wean-like (3) - 1 freq bienlike (3) - 2 freq rat-like (3) - 1 freq thing-like (3) - 1 freq caum-like (3) - 1 freq waeklike (3) - 1 freq warm-like (3) - 1 freq waa-like (3) - 1 freq saw-like (3) - 1 freq cat-like (3) - 1 freq saut-like (3) - 1 freq maze-like (3) - 1 freq saft-like (3) - 1 freq |
taen-like (0) - 3 freq taen-lik (1) - 1 freq tent-like (3) - 1 freq wean-like (4) - 1 freq kin-like (4) - 1 freq bien-lyke (4) - 1 freq waa-like (5) - 1 freq maze-like (5) - 1 freq cat-like (5) - 1 freq saw-like (5) - 1 freq canny-like (5) - 1 freq tentie-like (5) - 1 freq sun-lik (5) - 1 freq bairn-like (5) - 1 freq taen-in (5) - 1 freq fatnalike (5) - 1 freq meek-like (5) - 1 freq saut-like (5) - 1 freq bienlike (5) - 2 freq sae-lik (5) - 2 freq rat-like (5) - 1 freq quaet-like (5) - 2 freq thing-like (5) - 1 freq caum-like (5) - 1 freq ettlin-like (6) - 1 freq |
SoundEx code - T542 tunnels - 11 freq tuneless - 2 freq timeliest - 1 freq timeless - 5 freq time-less - 1 freq tummles - 2 freq taenails - 2 freq taen-like - 3 freq tunnel's - 1 freq then-always - 1 freq teenless - 1 freq toonmils - 1 freq taen-lik - 1 freq tonnels - 1 freq |
MetaPhone code - TNLK taen-like - 3 freq dounluik - 1 freq taen-lik - 1 freq doonlock - 1 freq |
TAEN-LIKE |
| Time to execute Levenshtein function - 0.253992 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.467099 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.029311 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.038561 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. |