| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luve-darg (0) - 1 freq luve-daith (3) - 1 freq luve-bairn (3) - 1 freq lukewaarm (4) - 1 freq lavender (4) - 57 freq luvers (4) - 12 freq life-lang (4) - 3 freq lee-lang (4) - 4 freq luved- (4) - 1 freq love-bug (4) - 1 freq legendary (4) - 15 freq luver (4) - 8 freq lee-wark (4) - 1 freq life-sang (4) - 2 freq live-wire (4) - 1 freq luewarm (4) - 1 freq luve-arras (4) - 1 freq luve-herts (4) - 1 freq luved (4) - 70 freq luve-seik (4) - 4 freq lukewarm (4) - 3 freq lyfe-lang (4) - 1 freq ledars (4) - 1 freq ledar (4) - 1 freq luxemburg (4) - 2 freq |
luve-darg (0) - 1 freq luve-bairn (5) - 1 freq luve-daith (5) - 1 freq live-wire (6) - 1 freq luve-arras (6) - 1 freq love-bug (6) - 1 freq lavender (6) - 57 freq lyfe-lang (7) - 1 freq luved (7) - 70 freq ledars (7) - 1 freq luve-seik (7) - 4 freq luved-ane (7) - 1 freq leverage (7) - 4 freq leeve-doon (7) - 1 freq lap-dug (7) - 1 freq luve-herts (7) - 1 freq ledar (7) - 1 freq luxemburg (7) - 2 freq luved- (7) - 1 freq luvers (7) - 12 freq lee-lang (7) - 4 freq life-lang (7) - 3 freq legendary (7) - 15 freq lee-wark (7) - 1 freq luver (7) - 8 freq |
SoundEx code - L136 loftier - 2 freq luve-darg - 1 freq lavatry - 1 freq lavateria - 1 freq lavatory - 5 freq lavatories - 1 freq leftér - 1 freq life-threids - 1 freq lavatries - 1 freq leftower - 3 freq liftwards - 1 freq liftward - 1 freq lafter - 1 freq life-draain - 1 freq life-watter - 1 freq leftowers - 3 freq left-ower - 1 freq liftwart - 1 freq |
MetaPhone code - LFTRK luve-darg - 1 freq |
LUVE-DARG |
| Time to execute Levenshtein function - 0.237335 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.372946 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.037787 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.049143 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.000940 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. |