| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verandae (0) - 1 freq verandah (1) - 6 freq verandas (1) - 1 freq veranda (1) - 5 freq ver'near (3) - 1 freq demandan (3) - 1 freq vandal (3) - 1 freq ersnae (3) - 3 freq grandas (3) - 3 freq brandie (3) - 2 freq vernal (3) - 3 freq randan (3) - 5 freq 'grandad (3) - 2 freq granda (3) - 274 freq grandie (3) - 1 freq verde (3) - 2 freq grandad (3) - 31 freq meantae (3) - 4 freq 'granda (3) - 2 freq beande (3) - 1 freq randie (3) - 8 freq vernear (3) - 8 freq eandle (3) - 1 freq miranda (3) - 7 freq ver-near (3) - 1 freq |
verandae (0) - 1 freq veranda (1) - 5 freq verandas (2) - 1 freq verandah (2) - 6 freq verde (4) - 2 freq grandie (4) - 1 freq vernear (4) - 8 freq aperande (4) - 1 freq granda (4) - 274 freq grande (4) - 1 freq miranda (4) - 7 freq randie (4) - 8 freq brandie (4) - 2 freq vernal (4) - 3 freq vrang (5) - 8 freq versed (5) - 4 freq bronde (5) - 1 freq visand (5) - 1 freq brandy (5) - 23 freq granada (5) - 3 freq veronica (5) - 3 freq verdi (5) - 1 freq vand (5) - 2 freq rand (5) - 2 freq randy (5) - 15 freq |
SoundEx code - V653 verandah - 6 freq variants - 14 freq veranda - 5 freq variant - 16 freq verandae - 1 freq verandas - 1 freq varindersingh - 2 freq |
MetaPhone code - FRNT frooned - 8 freq verandah - 6 freq front - 733 freq friend - 86 freq freind - 13 freq farrant - 21 freq freend - 153 freq fahrend - 1 freq frowned - 11 freq 'freend' - 1 freq frond - 1 freq ferranti - 2 freq frunt - 21 freq furrent - 2 freq fronty - 6 freq frend - 1 freq veranda - 5 freq 'friend - 1 freq variant - 16 freq verandae - 1 freq 'friend' - 1 freq frint - 1 freq frouned - 2 freq frained - 1 freq €œfreend - 1 freq frontae - 1 freq farrent - 1 freq €˜freend - 1 freq €˜freand - 1 freq frownt - 1 freq ‘friendÂ’ - 1 freq |
VERANDAE |
| Time to execute Levenshtein function - 0.309986 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.585402 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.029485 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.070110 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. |