| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ahizdlfv (0) - 1 freq aizelt (4) - 1 freq hiddlin (4) - 4 freq hiddlet (4) - 1 freq hiddle (4) - 10 freq ahil (4) - 1 freq hiddled (4) - 6 freq aidled (4) - 1 freq ahied (4) - 1 freq ahind (4) - 11 freq ahill (4) - 1 freq aidle (4) - 1 freq whizzled (4) - 3 freq shid'v (4) - 1 freq whizzly (4) - 1 freq ahid (4) - 2 freq thirdly (4) - 1 freq aizle (4) - 1 freq hizself (4) - 1 freq hizzle (4) - 3 freq childlik (4) - 1 freq hiddlie (4) - 5 freq hidlin (4) - 1 freq aizles (4) - 1 freq girdles (5) - 1 freq |
ahizdlfv (0) - 1 freq hizself (6) - 1 freq hizzle (7) - 3 freq hiddlie (7) - 5 freq hiddled (7) - 6 freq hidlin (7) - 1 freq hiddlet (7) - 1 freq hiddle (7) - 10 freq hiddlin (7) - 4 freq hazll (8) - 1 freq handlin (8) - 1 freq huddles (8) - 1 freq hoddlin (8) - 1 freq handle (8) - 36 freq heidlan (8) - 1 freq handles (8) - 4 freq herdly (8) - 18 freq ihndls (8) - 1 freq hoddle (8) - 1 freq heedfu (8) - 1 freq hordly (8) - 1 freq huddled (8) - 20 freq hazels (8) - 2 freq himself (8) - 99 freq hxdav (8) - 1 freq |
SoundEx code - A234 actually - 377 freq actual - 109 freq acutely - 2 freq actuality - 3 freq acttualy - 1 freq 'actually - 2 freq actuallie - 3 freq actaually - 1 freq aestlins - 2 freq aistlins - 1 freq aistlin - 1 freq achedule - 1 freq acutally - 1 freq aictully - 1 freq ahizdlfv - 1 freq |
MetaPhone code - AHSTLFF ahizdlfv - 1 freq |
AHIZDLFV |
| Time to execute Levenshtein function - 0.310595 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.589513 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.029441 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.077261 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.000889 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. |