| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onfaw (0) - 4 freq onfaws (1) - 2 freq onay (2) - 1 freq ona (2) - 14 freq dounfaw (2) - 5 freq naw (2) - 895 freq knaw (2) - 16 freq ontac (2) - 2 freq anaw (2) - 195 freq offay (2) - 1 freq confab (2) - 4 freq an-aw (2) - 17 freq annaw (2) - 2 freq offae (2) - 1 freq onnay (2) - 1 freq ongan (2) - 2 freq ontae (2) - 343 freq offal (2) - 2 freq onna (2) - 18 freq 'naw (2) - 166 freq befaw (2) - 3 freq inaw (2) - 7 freq snaw (2) - 185 freq pnfw (2) - 1 freq ontak (2) - 33 freq |
onfaw (0) - 4 freq onfaws (2) - 2 freq annaw (3) - 2 freq ootfaw (3) - 1 freq an-aw (3) - 17 freq inaw (3) - 7 freq befaw (3) - 3 freq pnfw (3) - 1 freq faw (3) - 144 freq dounfaw (3) - 5 freq anaw (3) - 195 freq naw (3) - 895 freq niaw (3) - 1 freq now (4) - 721 freq enyow (4) - 2 freq infamy (4) - 5 freq onyhow (4) - 9 freq enow (4) - 5 freq oonfair (4) - 1 freq infur (4) - 1 freq infer (4) - 1 freq unfair (4) - 10 freq onafi (4) - 1 freq onywi (4) - 3 freq inlow (4) - 1 freq |
SoundEx code - O510 onfaw - 4 freq oonhappy - 1 freq oomph - 4 freq oompa - 1 freq onhappie - 1 freq one-aff - 1 freq omb - 3 freq onby - 1 freq onieb - 1 freq onyb - 1 freq onafi - 1 freq ohhomaob - 1 freq |
MetaPhone code - ONF onfaw - 4 freq one-aff - 1 freq oonagh - 3 freq onafi - 1 freq |
ONFAW |
| Time to execute Levenshtein function - 0.162631 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.316738 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.027393 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.038548 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.000833 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. |