| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twa-leidit (0) - 15 freq twa-leid (2) - 9 freq wan-leidit (2) - 1 freq twa-laftit (3) - 1 freq tow-heidit (3) - 1 freq twa-handit (3) - 1 freq ae-leidit (3) - 1 freq baa-heidit (3) - 1 freq dug-heidit (4) - 2 freq rid-heidit (4) - 2 freq big-heidit (4) - 3 freq twa-leiditness (4) - 2 freq pleidit (4) - 3 freq tuim-heidit (4) - 4 freq threidit (4) - 4 freq cleidit (4) - 2 freq wa-heids (4) - 1 freq hie-heidit (4) - 1 freq tallentit (4) - 1 freq talentit (4) - 6 freq ill-leirit (4) - 1 freq twaluggit (4) - 1 freq twa-fit (4) - 1 freq pig-heidit (4) - 1 freq bawheidit (4) - 1 freq |
twa-leidit (0) - 15 freq twa-leid (3) - 9 freq tow-heidit (4) - 1 freq wan-leidit (4) - 1 freq twa-handit (5) - 1 freq ae-leidit (5) - 1 freq twa-laftit (5) - 1 freq tea-blaudit (6) - 1 freq twa-fit (6) - 1 freq three-leidit (6) - 2 freq waldit (6) - 1 freq twa-pairt (6) - 1 freq tuim-heidit (6) - 4 freq twa-haundit (6) - 3 freq baa-heidit (6) - 1 freq twarterit (7) - 1 freq dug-heidit (7) - 2 freq rid-heidit (7) - 2 freq threidit (7) - 4 freq het-heidit (7) - 1 freq bee-heidit (7) - 1 freq twa-taed (7) - 2 freq twalt (7) - 2 freq twaalt (7) - 1 freq twa-yaird (7) - 1 freq |
SoundEx code - T433 tiltit - 7 freq tilted - 5 freq twa-leidit - 15 freq tiltet - 1 freq tltit - 1 freq twa-leiditness - 2 freq |
MetaPhone code - TWLTT twa-leidit - 15 freq |
TWA-LEIDIT |
| Time to execute Levenshtein function - 0.210975 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.353609 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.027842 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.037595 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.000951 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. |