| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lukewarm (0) - 3 freq luewarm (1) - 1 freq lukewaarm (1) - 1 freq lukewatt (2) - 1 freq aukward (3) - 1 freq sunwarm (3) - 1 freq lungworm (3) - 1 freq lykewake (3) - 1 freq lew-warm (3) - 1 freq seward (4) - 2 freq literar (4) - 3 freq skywart (4) - 1 freq wuidwark (4) - 2 freq leear (4) - 16 freq ukela (4) - 4 freq lukeyhear (4) - 1 freq ackwart (4) - 6 freq lubbard (4) - 2 freq skewer (4) - 5 freq likesae (4) - 4 freq akward (4) - 3 freq forearm (4) - 1 freq luked (4) - 14 freq reward (4) - 47 freq literary (4) - 63 freq |
lukewarm (0) - 3 freq lukewaarm (1) - 1 freq luewarm (2) - 1 freq lukewatt (4) - 1 freq lew-warm (5) - 1 freq lykewake (5) - 1 freq lungworm (5) - 1 freq buikworm (5) - 1 freq sunwarm (5) - 1 freq aukward (5) - 1 freq lykewise (6) - 1 freq swarm (6) - 2 freq kawar (6) - 1 freq likewise (6) - 44 freq likewyse (6) - 3 freq likener (6) - 1 freq awkwart (6) - 1 freq likewice (6) - 2 freq tapewirm (6) - 1 freq launward (6) - 1 freq linkwark (6) - 1 freq aakward (6) - 7 freq bakward (6) - 2 freq lee-wark (6) - 1 freq bookworm (6) - 1 freq |
SoundEx code - L265 lukewarm - 3 freq lug-rings - 1 freq lukewaarm - 1 freq laserium - 1 freq lucerne - 1 freq laggeran - 3 freq lug-waarmers - 1 freq luxuriant - 2 freq lacrima - 1 freq loughran - 1 freq lwzhrm - 1 freq |
MetaPhone code - LKWRM lukewarm - 3 freq lukewaarm - 1 freq |
LUKEWARM |
| Time to execute Levenshtein function - 0.198618 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.359922 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.028192 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.037176 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.000921 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. |