| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lumphinnans (0) - 1 freq lumphanan (3) - 1 freq amphibian (5) - 1 freq pumpkins (5) - 2 freq sumhins (5) - 1 freq lothians (5) - 6 freq ruminants (5) - 1 freq dumplins (5) - 8 freq lumpin (5) - 1 freq dumplings (5) - 1 freq spinnan (5) - 3 freq lugphones (5) - 1 freq inchinnan (5) - 1 freq lupins (5) - 4 freq mumphin (5) - 1 freq luminous (5) - 5 freq luminate (5) - 1 freq thinnan (5) - 1 freq humphin (5) - 18 freq sumthin's (5) - 4 freq sumhin's (5) - 1 freq lum-hats (5) - 1 freq compaingens (5) - 3 freq grumphieman (5) - 11 freq luminatus (5) - 1 freq |
lumphinnans (0) - 1 freq lumphanan (5) - 1 freq lugphones (8) - 1 freq compaingens (8) - 3 freq sumhin's (9) - 1 freq humphin (9) - 18 freq luminatus (9) - 1 freq lum-hats (9) - 1 freq shannons (9) - 1 freq companions (9) - 6 freq lithuanians (9) - 1 freq lichtnins (9) - 1 freq symphonies (9) - 4 freq thinnan (9) - 1 freq limnins (9) - 1 freq mennins (9) - 1 freq sumthin's (9) - 4 freq pumpkins (9) - 2 freq phantons (9) - 1 freq dumplins (9) - 8 freq ruminants (9) - 1 freq sumhins (9) - 1 freq lothians (9) - 6 freq lumpin (9) - 1 freq amphibian (9) - 1 freq |
SoundEx code - L515 lampin - 6 freq lambin - 19 freq lanfine - 1 freq lamban - 2 freq lambing - 1 freq limpin - 3 freq lambeen - 3 freq lampan - 1 freq lumpen - 1 freq lumpin - 1 freq €˜lambing - 1 freq lambeens - 2 freq lumphinnans - 1 freq lumphanan - 1 freq lanabanana - 6 freq |
MetaPhone code - LMFNNS lumphinnans - 1 freq |
LUMPHINNANS |
| Time to execute Levenshtein function - 0.255505 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.432238 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.032578 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.040076 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.000883 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. |