| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vaillyiet (0) - 1 freq failyiet (2) - 1 freq vaillie (2) - 1 freq vailyie (2) - 3 freq vailley (3) - 6 freq allyie (3) - 1 freq failyie (3) - 1 freq haillie (3) - 8 freq baillie (3) - 17 freq vallies (3) - 1 freq vailleant (3) - 2 freq baillies (3) - 3 freq aillie (3) - 1 freq vailye (3) - 6 freq railwye (4) - 11 freq applyit (4) - 1 freq gillies (4) - 7 freq feillit (4) - 4 freq fallyin (4) - 1 freq railwyes (4) - 1 freq keillies (4) - 1 freq fillet (4) - 7 freq billet (4) - 1 freq falloet (4) - 2 freq shillie (4) - 1 freq |
vaillyiet (0) - 1 freq vaillie (3) - 1 freq vailleant (4) - 2 freq vailley (4) - 6 freq vallies (4) - 1 freq failyiet (4) - 1 freq vailyie (4) - 3 freq fillit (5) - 2 freq vaultit (5) - 2 freq villee (5) - 1 freq pallet (5) - 3 freq village (5) - 163 freq valles (5) - 1 freq veilit (5) - 1 freq vaill (5) - 7 freq yallit (5) - 1 freq wallit (5) - 1 freq ballet (5) - 4 freq villaij (5) - 1 freq veillane (5) - 2 freq sallet (5) - 1 freq callit (5) - 3 freq killit (5) - 6 freq villain (5) - 3 freq villainy (5) - 1 freq |
SoundEx code - V430 veiled - 3 freq veleta - 1 freq valued - 14 freq 'violate - 1 freq violet - 316 freq valet - 1 freq veilit - 1 freq valid - 26 freq volleyed - 1 freq 'valid - 1 freq 'violet - 1 freq vaillyiet - 1 freq velued - 2 freq velouté - 1 freq vault - 5 freq €˜valid - 1 freq veluet - 1 freq vald - 1 freq voilet - 1 freq |
MetaPhone code - FLYT fleyed - 2 freq folleyed - 2 freq volleyed - 1 freq vaillyiet - 1 freq failyiet - 1 freq flayed - 2 freq |
VAILLYIET |
| Time to execute Levenshtein function - 0.310708 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.600410 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.063436 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.044638 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.000929 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. |