| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waarmer (0) - 6 freq waarmed (1) - 3 freq wairmer (1) - 1 freq warmer (1) - 25 freq waarmt (2) - 3 freq warner (2) - 1 freq charmer (2) - 3 freq warder (2) - 3 freq waander (2) - 5 freq waather (2) - 2 freq waarmest (2) - 1 freq waater (2) - 34 freq waahfer (2) - 1 freq waarms (2) - 1 freq faarer (2) - 6 freq waatter (2) - 2 freq fairmer (2) - 61 freq waarmin (2) - 7 freq warker (2) - 7 freq waarned (2) - 2 freq waarm (2) - 81 freq starmer (2) - 3 freq waarkers (2) - 4 freq faarder (2) - 1 freq warmed (2) - 16 freq |
waarmer (0) - 6 freq wairmer (1) - 1 freq warmer (1) - 25 freq waarmed (2) - 3 freq wearier (3) - 1 freq waarms (3) - 1 freq fairmer (3) - 61 freq warker (3) - 7 freq waarm (3) - 81 freq warmed (3) - 16 freq waarmin (3) - 7 freq farmer (3) - 9 freq waarmt (3) - 3 freq warner (3) - 1 freq warder (3) - 3 freq warmt (4) - 2 freq wirmed (4) - 2 freq dramer (4) - 2 freq wurker (4) - 3 freq warm (4) - 355 freq wirker (4) - 5 freq weirder (4) - 1 freq murmer (4) - 2 freq warmly (4) - 4 freq hermer (4) - 1 freq |
SoundEx code - W656 warmer - 25 freq waarmer - 6 freq wairmer - 1 freq werner - 1 freq warm-hairtit - 1 freq warner - 1 freq |
MetaPhone code - WRMR warmer - 25 freq waarmer - 6 freq wairmer - 1 freq |
WAARMER |
| Time to execute Levenshtein function - 0.201859 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.337030 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.027398 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.038485 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.000783 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. |