| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eouldna (0) - 1 freq ecouldna (1) - 1 freq couldna (1) - 414 freq wouldna (1) - 10 freq wouldnae (2) - 104 freq woulda (2) - 4 freq couldnae (2) - 623 freq wouldna' (2) - 1 freq shouldna (2) - 32 freq could'na (2) - 1 freq wuldna (2) - 9 freq soudna (2) - 2 freq coundna (2) - 1 freq couldn (2) - 3 freq couldni (2) - 7 freq wouldn (2) - 3 freq wouldnay (2) - 1 freq culdna (2) - 34 freq coulda (2) - 32 freq cooldna (2) - 1 freq coudna (2) - 47 freq ecouldnae (2) - 1 freq wouldnt (2) - 2 freq coulna (2) - 1 freq couldno (2) - 5 freq |
eouldna (0) - 1 freq wouldna (2) - 10 freq couldna (2) - 414 freq ecouldna (2) - 1 freq ecouldnae (3) - 1 freq cooldna (3) - 1 freq wouldnay (3) - 1 freq couldno (3) - 5 freq culdna (3) - 34 freq couldnay (3) - 1 freq eould (3) - 2 freq couldny (3) - 13 freq wouldn (3) - 3 freq woudna (3) - 1 freq coudna (3) - 47 freq wuldna (3) - 9 freq couldni (3) - 7 freq couldnae (3) - 623 freq soudna (3) - 2 freq couldn (3) - 3 freq wouldnae (3) - 104 freq ouldir (4) - 1 freq cudna (4) - 165 freq eauld (4) - 1 freq goulden (4) - 2 freq |
SoundEx code - E435 elation - 3 freq eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eildons - 1 freq eldon - 1 freq eldin - 3 freq |
MetaPhone code - ELTN eildon - 3 freq eouldna - 1 freq eltin - 1 freq elton - 2 freq eldon - 1 freq eldin - 3 freq |
EOULDNA |
| Time to execute Levenshtein function - 0.194472 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.428611 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.028059 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.038730 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.000846 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. |