| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waikest (0) - 1 freq waikent (1) - 2 freq waekest (1) - 2 freq waiknes (2) - 1 freq waitet (2) - 20 freq waives (2) - 1 freq wairmest (2) - 2 freq jaiket (2) - 105 freq waket (2) - 1 freq waiker (2) - 5 freq whitest (2) - 1 freq wakent (2) - 5 freq fairest (2) - 7 freq waaket (2) - 1 freq darkest (2) - 16 freq waukent (2) - 48 freq laikes (2) - 1 freq wanrest (2) - 1 freq waakent (2) - 6 freq swaitest (2) - 1 freq dairkest (2) - 3 freq waiks (2) - 2 freq wakket (2) - 1 freq wisest (2) - 2 freq wakes (2) - 14 freq |
waikest (0) - 1 freq waekest (1) - 2 freq weakest (2) - 4 freq waikent (2) - 2 freq waiks (3) - 2 freq waakent (3) - 6 freq waukent (3) - 48 freq wakket (3) - 1 freq widest (3) - 3 freq waekent (3) - 1 freq waist (3) - 45 freq waaket (3) - 1 freq wisest (3) - 2 freq wakes (3) - 14 freq wakent (3) - 5 freq waket (3) - 1 freq wakkit (4) - 2 freq akst (4) - 12 freq warst (4) - 72 freq wanst (4) - 32 freq waakint (4) - 2 freq weeest (4) - 2 freq wycest (4) - 1 freq wee'est (4) - 2 freq wikkit (4) - 5 freq |
SoundEx code - W223 wisest - 2 freq waikest - 1 freq weakest - 4 freq washstand - 1 freq whisky-wheesht - 1 freq waekest - 2 freq wycest - 1 freq wickacademyfc - 24 freq wikistooshie - 1 freq |
MetaPhone code - WKST waikest - 1 freq waxit - 2 freq waxed - 3 freq weakest - 4 freq wauxt - 1 freq waxt - 2 freq waekest - 2 freq 'waxed - 1 freq |
WAIKEST |
| Time to execute Levenshtein function - 0.241039 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.396252 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.027978 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.046412 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.001019 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. |