| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| untangle (0) - 1 freq unfankle (2) - 9 freq entangled (2) - 3 freq tangle (2) - 6 freq tangue (3) - 1 freq stanle (3) - 1 freq untentie (3) - 2 freq mangle (3) - 4 freq intangible (3) - 3 freq triangle (3) - 8 freq unable (3) - 19 freq tanglet (3) - 1 freq intantly (3) - 1 freq tengle (3) - 1 freq strangle (3) - 3 freq jangle (3) - 5 freq tanglt (3) - 1 freq pentangles (3) - 1 freq unstable (3) - 1 freq untungult (3) - 1 freq unfankles (3) - 1 freq untaigelt (3) - 3 freq tanle (3) - 1 freq tangles (3) - 3 freq untae (3) - 13 freq |
untangle (0) - 1 freq entangled (3) - 3 freq tangle (3) - 6 freq intangible (4) - 3 freq intantly (4) - 1 freq tengle (4) - 1 freq unfankle (4) - 9 freq untungult (4) - 1 freq tingle (4) - 5 freq tangles (5) - 3 freq angle (5) - 22 freq fangle (5) - 1 freq rectangle (5) - 2 freq bangle (5) - 1 freq tangled (5) - 10 freq hauntingly (5) - 1 freq intently (5) - 10 freq stange (5) - 1 freq rangle (5) - 2 freq cangle (5) - 2 freq tanle (5) - 1 freq tangie (5) - 1 freq taigle (5) - 10 freq stanle (5) - 1 freq tanglet (5) - 1 freq |
SoundEx code - U535 untimeous - 1 freq undaein - 2 freq undeimous - 8 freq unwittin - 1 freq undeemous - 23 freq undauntit - 2 freq unatendid - 1 freq untungult - 1 freq unattended - 2 freq undeniable - 2 freq untimely - 5 freq undaen - 1 freq untangle - 1 freq undone - 4 freq unthinkable - 3 freq uneaten - 1 freq untentie - 2 freq undeun - 1 freq undeeman - 2 freq unidentified - 1 freq untenty - 1 freq undoan - 2 freq undon - 1 freq untentit - 1 freq unwittinly - 1 freq undain - 1 freq undauntoned - 1 freq undemous - 6 freq unduin - 1 freq undoin - 1 freq undemotic - 1 freq undemocratic - 2 freq untamed - 1 freq undantit - 1 freq umteenth - 2 freq unitin - 2 freq unidentifiable - 1 freq |
MetaPhone code - UNTNKL untangle - 1 freq |
UNTANGLE |
| Time to execute Levenshtein function - 0.278208 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.400120 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.028115 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.041147 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.001314 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. |