| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lalors (0) - 1 freq lalor (1) - 8 freq calor (2) - 2 freq labours (2) - 5 freq jalous (2) - 2 freq luxors (2) - 1 freq sailors (2) - 17 freq galore (2) - 23 freq lagos (2) - 2 freq lars (2) - 1 freq layers (2) - 21 freq talons (2) - 5 freq laos (2) - 1 freq lawlords (2) - 1 freq lawers (2) - 8 freq razors (2) - 3 freq lawbors (2) - 1 freq aloes (2) - 1 freq aloos (2) - 4 freq a-ors (2) - 1 freq colors (2) - 1 freq caloris (2) - 2 freq tailors (2) - 7 freq lasers (2) - 2 freq balers (2) - 1 freq |
lalors (0) - 1 freq lalor (2) - 8 freq lasers (3) - 2 freq tailors (3) - 7 freq balers (3) - 1 freq colors (3) - 1 freq caloris (3) - 2 freq lacers (3) - 1 freq allers (3) - 1 freq lagers (3) - 2 freq laters (3) - 12 freq lawers (3) - 8 freq lairs (3) - 15 freq taylors (3) - 1 freq lars (3) - 1 freq sailors (3) - 17 freq labours (3) - 5 freq layers (3) - 21 freq luxors (3) - 1 freq rulers (4) - 8 freq glaurs (4) - 1 freq lowers (4) - 7 freq bilers (4) - 1 freq lavroos (4) - 1 freq ledars (4) - 1 freq |
SoundEx code - L462 lalors - 1 freq |
MetaPhone code - LLRS lalors - 1 freq |
LALORS |
| Time to execute Levenshtein function - 0.290468 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.635173 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.067969 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.078597 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.000867 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. |