| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tulip-röts (0) - 1 freq tulip-roots (2) - 4 freq tulip-ruits (2) - 1 freq half-böts (5) - 1 freq culprits (5) - 2 freq tulips (5) - 3 freq turn-oots (6) - 1 freq kulirt (6) - 1 freq truipers (6) - 1 freq tap-hats (6) - 1 freq tree-roots (6) - 1 freq buik-leets (6) - 1 freq tap-root (6) - 1 freq röts (6) - 2 freq heliport (6) - 2 freq bolivarists (6) - 1 freq tuim-wames (6) - 2 freq tip-toes (6) - 1 freq teleport (6) - 1 freq thumbprints (6) - 1 freq flip-flops (6) - 3 freq €œlie-toats (6) - 1 freq tairgets (6) - 1 freq tsipras (6) - 1 freq supports (6) - 21 freq |
tulip-röts (0) - 1 freq tulip-ruits (4) - 1 freq tulip-roots (4) - 4 freq half-böts (8) - 1 freq culprits (9) - 2 freq röts (10) - 2 freq tree-roots (10) - 1 freq tip-toes (10) - 1 freq teleport (10) - 1 freq kail-runts (10) - 1 freq tap-root (10) - 1 freq tap-hats (10) - 1 freq tulips (10) - 3 freq triplets (11) - 3 freq fuitprints (11) - 1 freq tuil-bass (11) - 1 freq futprints (11) - 1 freq lip-read (11) - 1 freq blueprints (11) - 1 freq trötil (11) - 1 freq culprit (11) - 4 freq tippets (11) - 1 freq tail-lights (11) - 1 freq tairts (11) - 5 freq tippertaes (11) - 1 freq |
SoundEx code - T416 tulip-roots - 4 freq twelve-year-old - 1 freq tulip-ruits - 1 freq twelve-year-aulds - 1 freq tulip-röts - 1 freq tullyford - 1 freq twelvr - 1 freq tilfers - 1 freq toolbar - 1 freq teleport - 1 freq telfer - 2 freq twalbore - 1 freq tailfer - 1 freq |
MetaPhone code - TLPRTS tulip-roots - 4 freq tulip-ruits - 1 freq tulip-röts - 1 freq |
TULIP-RÖTS |
| Time to execute Levenshtein function - 0.284446 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.449940 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.033339 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.048945 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.001177 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. |