| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| langelt (0) - 1 freq lang'lt (1) - 1 freq langest (1) - 20 freq jangelt (1) - 1 freq tangelt (1) - 2 freq langl't (2) - 2 freq mangilt (2) - 2 freq tanglt (2) - 1 freq angel (2) - 113 freq hanselt (2) - 3 freq waggelt (2) - 1 freq landet (2) - 5 freq hankelt (2) - 1 freq cancelt (2) - 3 freq langer' (2) - 1 freq largest (2) - 4 freq singelt (2) - 1 freq lang'll (2) - 1 freq landels (2) - 1 freq langer (2) - 223 freq cantelt (2) - 1 freq lang-telt (2) - 1 freq labelt (2) - 2 freq lanely (2) - 31 freq lang'ls (2) - 2 freq |
langelt (0) - 1 freq tangelt (2) - 2 freq jangelt (2) - 1 freq lang'lt (2) - 1 freq langest (2) - 20 freq dangult (3) - 1 freq langt (3) - 2 freq lingert (3) - 2 freq singelt (3) - 1 freq loangest (3) - 1 freq longest (3) - 4 freq mangilt (3) - 2 freq tanglt (3) - 1 freq langl't (3) - 2 freq angert (4) - 16 freq landet (4) - 5 freq langed (4) - 12 freq angels (4) - 64 freq largely (4) - 6 freq angel (4) - 113 freq angelo (4) - 1 freq fanglit (4) - 1 freq tanglit (4) - 1 freq manglit (4) - 3 freq tanglet (4) - 1 freq |
SoundEx code - L524 langholm - 7 freq lainsel - 2 freq loincloth - 1 freq lang-luggit - 3 freq lang-shillit - 1 freq lincluden - 8 freq linklater - 2 freq lang-lippit - 1 freq lang-loast - 1 freq lang-lost - 1 freq langl't - 2 freq lang'ls - 2 freq lang'lt - 1 freq lang-legged - 1 freq lang-legs - 1 freq lang'l - 1 freq lingel-backit - 1 freq longley - 2 freq lang-lestin - 1 freq lang'll - 1 freq lang-liggit - 1 freq lincoln - 3 freq langlegs - 3 freq lang-lugged - 2 freq lang-lown - 1 freq lang-lastin - 1 freq langlie-itis - 1 freq lang-lie-itis - 2 freq long-lost - 1 freq langelt - 1 freq leanneglenxox - 3 freq liammcilvanney - 4 freq liamgallagher - 1 freq limekilns - 1 freq langlumreek - 1 freq llinoselinowen - 1 freq lmjlm - 1 freq laingcollection - 1 freq |
MetaPhone code - LNJLT langelt - 1 freq |
LANGELT |
| Time to execute Levenshtein function - 0.198309 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.388237 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.029470 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.040586 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. |