| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vulture (0) - 3 freq vultures (1) - 10 freq culture (1) - 442 freq multure (1) - 1 freq cultur (2) - 62 freq venture (2) - 21 freq ciulture (2) - 1 freq 'culture (2) - 1 freq culturs (2) - 3 freq future (2) - 244 freq cultured (2) - 3 freq culure (2) - 1 freq cultures (2) - 26 freq nurture (2) - 5 freq culture' (2) - 3 freq vulgur (2) - 1 freq ultra (3) - 4 freq futurs (3) - 2 freq luxure (3) - 1 freq futures (3) - 8 freq nurtured (3) - 5 freq kulter (3) - 5 freq verdure (3) - 1 freq culture's (3) - 4 freq valour' (3) - 1 freq |
vulture (0) - 3 freq multure (2) - 1 freq culture (2) - 442 freq vultures (2) - 10 freq voltaire (3) - 1 freq vulgur (3) - 1 freq ciulture (3) - 1 freq venture (3) - 21 freq cultur (3) - 62 freq sultry (4) - 24 freq ventur (4) - 6 freq votre (4) - 1 freq voltage (4) - 2 freq saltyre (4) - 4 freq saltire (4) - 43 freq cultuir (4) - 1 freq culter (4) - 1 freq veenture (4) - 1 freq kulter (4) - 5 freq cultra (4) - 1 freq vulgar (4) - 4 freq valour (4) - 1 freq culure (4) - 1 freq cultured (4) - 3 freq culture' (4) - 3 freq |
SoundEx code - V436 vultures - 10 freq vulture - 3 freq voldermort' - 1 freq vultèrs - 1 freq vultures'll - 1 freq voltaire - 1 freq voldermort - 1 freq |
MetaPhone code - FLTR filter - 5 freq flitter - 1 freq vulture - 3 freq flutter - 9 freq flatter - 4 freq fleeter - 1 freq falter - 1 freq fleetery - 1 freq voltaire - 1 freq fluttery - 1 freq flattery - 3 freq folder - 4 freq felder - 1 freq phildr - 4 freq |
VULTURE |
| Time to execute Levenshtein function - 0.222427 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.353402 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.029999 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.039483 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.000881 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. |