| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| warmly (0) - 4 freq wardly (1) - 1 freq warily (1) - 3 freq warmed (2) - 16 freq warty (2) - 1 freq amly (2) - 1 freq wryly (2) - 1 freq waikly (2) - 3 freq rarely (2) - 43 freq warsle (2) - 24 freq haemly (2) - 1 freq hardly (2) - 209 freq waurily (2) - 1 freq warmit (2) - 2 freq eardly (2) - 1 freq darkly (2) - 2 freq wally (2) - 47 freq sarely (2) - 1 freq wrily (2) - 1 freq warman (2) - 2 freq wawly (2) - 1 freq wary (2) - 11 freq harly (2) - 13 freq warmin (2) - 30 freq waly (2) - 27 freq |
warmly (0) - 4 freq warmlie (2) - 3 freq wardly (2) - 1 freq warily (2) - 3 freq warmer (3) - 25 freq warms (3) - 8 freq wearily (3) - 1 freq wormy (3) - 1 freq warmin (3) - 30 freq firmly (3) - 41 freq warm (3) - 355 freq wammle (3) - 2 freq warmt (3) - 2 freq warle (3) - 1 freq warman (3) - 2 freq waridly (3) - 1 freq wrily (3) - 1 freq wryly (3) - 1 freq warsle (3) - 24 freq warll (3) - 1 freq waurily (3) - 1 freq warmit (3) - 2 freq warmed (3) - 16 freq wardle (3) - 11 freq warl (3) - 164 freq |
SoundEx code - W654 warmlie - 3 freq wirm-like - 1 freq warmly - 4 freq wormholes - 4 freq wormhole - 11 freq wormhole's - 1 freq warm-like - 1 freq €˜wormhole - 1 freq wormholed - 1 freq weareonholiday - 1 freq |
MetaPhone code - WRML warmlie - 3 freq warmly - 4 freq |
WARMLY |
| Time to execute Levenshtein function - 0.232322 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.380099 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.027733 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.037557 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.000859 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. |