| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loaksmiths (0) - 1 freq chazsmiths (3) - 1 freq blacksmiths (3) - 1 freq blecksmiths (3) - 1 freq smiths (4) - 3 freq bobsmith (4) - 1 freq wordsmith's (4) - 1 freq blacksmith's (4) - 1 freq loamins (4) - 1 freq naismith (4) - 1 freq sangsmiths (4) - 1 freq blacksmith (4) - 4 freq naysmith (4) - 3 freq lisasmith (4) - 1 freq poakits (4) - 7 freq límits (5) - 1 freq admits (5) - 2 freq loasst (5) - 1 freq longships (5) - 1 freq smith (5) - 113 freq roadsigns (5) - 2 freq lashins (5) - 3 freq loathe (5) - 2 freq hoaspital (5) - 21 freq logarithms (5) - 1 freq |
loaksmiths (0) - 1 freq blacksmiths (5) - 1 freq blecksmiths (5) - 1 freq lisasmith (6) - 1 freq smiths (6) - 3 freq chazsmiths (6) - 1 freq blacksmith (7) - 4 freq alynsmith (7) - 3 freq sangsmiths (7) - 1 freq naysmith (7) - 3 freq naismith (7) - 1 freq bobsmith (7) - 1 freq blacksmith's (7) - 1 freq lokt's (8) - 1 freq lesmit (8) - 1 freq logistics (8) - 3 freq smith- (8) - 1 freq closemouths (8) - 1 freq laithes (8) - 1 freq smitts (8) - 2 freq look-outs (8) - 1 freq classmates (8) - 2 freq lakshmi (8) - 3 freq smithy (8) - 3 freq locusts (8) - 6 freq |
SoundEx code - L253 locomotive - 4 freq legend - 92 freq likent - 2 freq loaksmiths - 1 freq legends - 36 freq lucendo - 1 freq loosened - 3 freq legendary - 15 freq leisn't - 1 freq lisent - 1 freq lowsint - 1 freq leigend - 1 freq leigends - 1 freq legendiry - 1 freq lessened - 1 freq lichened - 2 freq likened - 1 freq lowsened - 2 freq legend'ry - 1 freq lassie-in-waitin - 4 freq lossiemouth - 3 freq lissened - 1 freq locomotive' - 1 freq lokomotywa' - 1 freq lozent - 1 freq lowsent - 2 freq locumtenand - 3 freq lossiemooth - 1 freq lossiemouth-museum - 1 freq likeamadgiraffe - 1 freq legianet - 1 freq lucyhunterb - 5 freq lesmit - 1 freq lyceumtheatre - 1 freq legends-need - 1 freq |
MetaPhone code - LKSM0S loaksmiths - 1 freq |
LOAKSMITHS |
| Time to execute Levenshtein function - 0.226227 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.414648 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.028900 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.045659 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.001210 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. |