| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| taen-lik (0) - 1 freq taen-like (1) - 3 freq taen-in (2) - 1 freq sae-lik (2) - 2 freq twenklin (3) - 4 freq manlik (3) - 1 freq sac-lik (3) - 1 freq taen-on (3) - 3 freq daft-lik (3) - 2 freq saft-lik (3) - 1 freq then-bit (3) - 1 freq sun-lik (3) - 1 freq teenklin (3) - 1 freq tanglit (3) - 1 freq waenglit (3) - 1 freq thrawn-lik (3) - 1 freq sauntlik (3) - 1 freq tent-like (3) - 1 freq ten-fit (3) - 1 freq saelik (3) - 1 freq nate-lik (3) - 1 freq gah-lik (3) - 1 freq gay-lik (3) - 1 freq burd-lik (4) - 2 freq cannilie (4) - 5 freq |
taen-lik (0) - 1 freq taen-like (1) - 3 freq tent-like (4) - 1 freq sun-lik (4) - 1 freq sae-lik (4) - 2 freq taen-in (4) - 1 freq gah-lik (5) - 1 freq gay-lik (5) - 1 freq nate-lik (5) - 1 freq wean-like (5) - 1 freq bien-lyke (5) - 1 freq ten-week (5) - 1 freq sauntlik (5) - 1 freq kin-like (5) - 1 freq fine-lik (5) - 1 freq ten-fit (5) - 1 freq manlik (5) - 1 freq sac-lik (5) - 1 freq tentie-lik (5) - 2 freq taen-on (5) - 3 freq teenklin (5) - 1 freq tanglit (5) - 1 freq caum-like (6) - 1 freq wanluk (6) - 1 freq quaet-like (6) - 2 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-LIK |
| Time to execute Levenshtein function - 0.204987 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.377787 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.027630 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.037676 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.000898 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. |