| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| launer (0) - 1 freq wauner (1) - 2 freq lauder (1) - 6 freq dauner (1) - 57 freq lairner (2) - 5 freq lawyer (2) - 33 freq ganner (2) - 1 freq warner (2) - 1 freq lner (2) - 1 freq loner (2) - 1 freq wanner (2) - 17 freq launered (2) - 1 freq mainer (2) - 9 freq saucer (2) - 13 freq daunger (2) - 4 freq naurer (2) - 1 freq lumner (2) - 1 freq saufer (2) - 2 freq laun (2) - 76 freq laugher (2) - 1 freq liner (2) - 4 freq lafter (2) - 1 freq wagner (2) - 1 freq glaumer (2) - 1 freq launce (2) - 1 freq |
launer (0) - 1 freq loner (2) - 1 freq lunar (2) - 1 freq wauner (2) - 2 freq lner (2) - 1 freq liner (2) - 4 freq lauder (2) - 6 freq dauner (2) - 57 freq earner (3) - 2 freq laund (3) - 89 freq laubor (3) - 1 freq lager (3) - 38 freq auler (3) - 17 freq laayer (3) - 5 freq daaner (3) - 1 freq louder (3) - 40 freq luver (3) - 8 freq planer (3) - 1 freq learner (3) - 7 freq lounger (3) - 1 freq plainer (3) - 3 freq lane (3) - 240 freq laer (3) - 1 freq laundry (3) - 10 freq launs (3) - 17 freq |
SoundEx code - L560 lammer - 2 freq limmer - 19 freq lamour - 1 freq linner - 2 freq l'amour - 1 freq liner - 4 freq loner - 1 freq launer - 1 freq linear - 3 freq lunar - 1 freq limnar - 1 freq lumner - 1 freq lawnmower - 1 freq lner - 1 freq |
MetaPhone code - LNR linner - 2 freq liner - 4 freq loner - 1 freq launer - 1 freq linear - 3 freq lunar - 1 freq lner - 1 freq |
LAUNER |
| Time to execute Levenshtein function - 0.459298 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.901096 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.094025 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.108376 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.000847 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. |