| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| voltage (0) - 2 freq cottage (2) - 49 freq vilage (2) - 1 freq foliage (2) - 2 freq pottage (2) - 1 freq village (2) - 163 freq voyage (2) - 14 freq vintage (2) - 9 freq voltaire (2) - 1 freq footage (2) - 13 freq postage (2) - 5 freq hostage (2) - 7 freq vantage (2) - 9 freq collage (2) - 1 freq volatile (3) - 3 freq salvage (3) - 4 freq votre (3) - 1 freq bustage (3) - 1 freq oottae (3) - 1 freq montague (3) - 3 freq sortae (3) - 19 freq folae (3) - 1 freq shortage (3) - 6 freq ootrage (3) - 7 freq vulture (3) - 3 freq |
voltage (0) - 2 freq vintage (3) - 9 freq voltaire (3) - 1 freq vantage (3) - 9 freq village (3) - 163 freq vilage (3) - 1 freq volatile (4) - 3 freq collage (4) - 1 freq vestige (4) - 1 freq veelage (4) - 12 freq volts (4) - 3 freq avantage (4) - 1 freq vulture (4) - 3 freq footage (4) - 13 freq foliage (4) - 2 freq pottage (4) - 1 freq cottage (4) - 49 freq voyage (4) - 14 freq hostage (4) - 7 freq postage (4) - 5 freq foilage (5) - 1 freq i'stage (5) - 1 freq sileage (5) - 1 freq vlog (5) - 1 freq stage (5) - 200 freq |
SoundEx code - V432 volts - 3 freq vaults - 2 freq violet's - 19 freq violets - 16 freq valedictory - 2 freq violets' - 1 freq 'violets - 1 freq voltage - 2 freq valediction - 1 freq vaults' - 1 freq valedeictorie - 1 freq vilots - 1 freq |
MetaPhone code - FLTJ voltage - 2 freq |
VOLTAGE |
| Time to execute Levenshtein function - 0.210287 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.403940 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.028273 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.037581 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.000955 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. |