| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lyart-faced (0) - 1 freq wart-faced (2) - 2 freq lang-faced (3) - 4 freq toarn-faced (3) - 1 freq bare-faced (3) - 4 freq twae-faced (4) - 1 freq sham-faced (4) - 1 freq blae-faced (4) - 2 freq yatt-races (4) - 1 freq baa-faced (4) - 1 freq langfaced (4) - 1 freq shame-faced (4) - 2 freq baw-faced (4) - 1 freq fair-faced (4) - 3 freq torn-faced (4) - 4 freq far-famed (4) - 1 freq stern-faced (4) - 1 freq barefaced (4) - 2 freq soor-faced (4) - 4 freq twa-faced (4) - 3 freq bold-faced (5) - 1 freq fishy-faced (5) - 2 freq artifacts (5) - 2 freq fite-faced (5) - 1 freq roun-faced (5) - 1 freq |
lyart-faced (0) - 1 freq wart-faced (3) - 2 freq toarn-faced (5) - 1 freq bare-faced (5) - 4 freq lang-faced (5) - 4 freq soor-faced (6) - 4 freq torn-faced (6) - 4 freq fair-faced (6) - 3 freq white-faced (7) - 8 freq twa-faced (7) - 3 freq fite-faced (7) - 1 freq frug-faced (7) - 1 freq hairt-feared (7) - 3 freq grim-faced (7) - 2 freq green-faced (7) - 1 freq reed-faced (7) - 6 freq roun-faced (7) - 1 freq stern-faced (7) - 1 freq rid-faced (7) - 4 freq barefaced (7) - 2 freq blae-faced (7) - 2 freq sham-faced (7) - 1 freq twae-faced (7) - 1 freq langfaced (7) - 1 freq baa-faced (7) - 1 freq |
SoundEx code - L631 lyart-faced - 1 freq lairdofdarkness - 1 freq |
MetaPhone code - LYRTFST lyart-faced - 1 freq |
LYART-FACED |
| Time to execute Levenshtein function - 0.220690 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.367322 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.027576 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.041067 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.000999 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. |