| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lunar (0) - 1 freq lugar (1) - 4 freq lunan (1) - 1 freq luna (1) - 2 freq luver (2) - 8 freq tuna (2) - 9 freq cupar (2) - 5 freq liner (2) - 4 freq einar (2) - 27 freq lona (2) - 1 freq quhar (2) - 24 freq lunacy (2) - 2 freq lner (2) - 1 freq ladar (2) - 1 freq tuner (2) - 1 freq loner (2) - 1 freq lina (2) - 1 freq lungs (2) - 54 freq lna (2) - 1 freq lucas (2) - 2 freq lear (2) - 107 freq gnar (2) - 1 freq eynar (2) - 34 freq lundy (2) - 1 freq kumar (2) - 1 freq |
lunar (0) - 1 freq liner (2) - 4 freq loner (2) - 1 freq launer (2) - 1 freq linear (2) - 3 freq lner (2) - 1 freq lugar (2) - 4 freq lunan (2) - 1 freq luna (2) - 2 freq sonar (3) - 1 freq laar (3) - 2 freq uner (3) - 2 freq anar (3) - 1 freq nar (3) - 15 freq lunge (3) - 5 freq lunt (3) - 5 freq liar (3) - 24 freq lun (3) - 1 freq limnar (3) - 1 freq wnar (3) - 1 freq lung (3) - 14 freq suner (3) - 3 freq ledar (3) - 1 freq lumner (3) - 1 freq leear (3) - 16 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 |
LUNAR |
| Time to execute Levenshtein function - 0.264389 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.375593 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.029219 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.037361 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.000859 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. |