| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jowered (0) - 1 freq powered (1) - 2 freq towered (1) - 1 freq lowered (1) - 25 freq jeered (2) - 1 freq covered (2) - 124 freq owerend (2) - 1 freq couered (2) - 1 freq pouered (2) - 4 freq touered (2) - 1 freq jowed (2) - 2 freq tobered (2) - 1 freq sobered (2) - 1 freq hovered (2) - 11 freq tooered (2) - 1 freq dovered (2) - 6 freq pokered (2) - 1 freq glowered (2) - 98 freq powdered (2) - 2 freq pooered (2) - 3 freq ushered (3) - 5 freq watered (3) - 6 freq hoovered (3) - 4 freq loitered (3) - 1 freq oxtered (3) - 7 freq |
jowered (0) - 1 freq towered (2) - 1 freq lowered (2) - 25 freq powered (2) - 2 freq jeered (3) - 1 freq jowed (3) - 2 freq swerd (4) - 1 freq coward (4) - 12 freq wared (4) - 9 freq wired (4) - 15 freq jared (4) - 3 freq werd (4) - 1 freq jawed (4) - 4 freq weared (4) - 1 freq jowd (4) - 1 freq lowurd (4) - 1 freq toward (4) - 24 freq sweared (4) - 1 freq weired (4) - 2 freq howard (4) - 4 freq weered (4) - 3 freq sobered (4) - 1 freq tooered (4) - 1 freq dovered (4) - 6 freq pokered (4) - 1 freq |
SoundEx code - J630 jowered - 1 freq jared - 3 freq jeert - 2 freq jeered - 1 freq jreid - 1 freq jordy - 4 freq |
MetaPhone code - JWRT jowered - 1 freq |
JOWERED |
| Time to execute Levenshtein function - 0.302385 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.449189 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.034406 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.044737 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.001635 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. |