| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onvbody (0) - 1 freq onybody (1) - 416 freq onbody (1) - 1 freq oniebody (2) - 15 freq 'onybody (2) - 1 freq onybodys (2) - 1 freq oanybody (2) - 1 freq onybdy (2) - 9 freq nobody (2) - 48 freq onyboady (2) - 1 freq onybidy (2) - 1 freq onib'dy (2) - 1 freq onybudy (2) - 6 freq anybody (2) - 76 freq anabody (2) - 1 freq oneybudy (3) - 1 freq sombody (3) - 1 freq anybdy (3) - 2 freq onybody's (3) - 3 freq sumbody (3) - 6 freq €œnobody (3) - 2 freq onybud (3) - 1 freq awbody (3) - 264 freq naebody (3) - 637 freq anyboady (3) - 13 freq |
onvbody (0) - 1 freq onybody (2) - 416 freq onbody (2) - 1 freq onyboady (3) - 1 freq onybudy (3) - 6 freq anabody (3) - 1 freq nobody (3) - 48 freq anybody (3) - 76 freq onybidy (3) - 1 freq oniebody (3) - 15 freq onybdy (3) - 9 freq oanybody (3) - 1 freq naebody (4) - 637 freq neebody (4) - 1 freq anyboady (4) - 13 freq anybidy (4) - 1 freq onybud (4) - 1 freq nobudy (4) - 1 freq onybodie (4) - 5 freq nacbody (4) - 6 freq anybdy (4) - 2 freq onybodys (4) - 1 freq 'onybody (4) - 1 freq onib'dy (4) - 1 freq oneybudy (4) - 1 freq |
SoundEx code - O513 onybody - 416 freq oniebody - 15 freq onybdy's - 1 freq onybdy - 9 freq oanybody - 1 freq 'onybody - 1 freq oniebodie - 80 freq onybodie - 5 freq onbody - 1 freq onbody's - 1 freq onybudy - 6 freq oneybudee - 3 freq oneybudy - 1 freq onneybudce - 1 freq oanyboady - 1 freq onybody's - 3 freq oniebuddie - 22 freq onvbody - 1 freq onieboadie - 10 freq omebodie - 1 freq oneibodie - 1 freq 'oniebodie - 2 freq onybody'll - 1 freq oonbidden - 1 freq onybiddy - 8 freq omb'dy - 1 freq onpit - 1 freq onyboady - 1 freq onib'dy - 1 freq €œonybody - 2 freq onybuddy - 8 freq oanybuddy - 1 freq onybidy - 1 freq onefatninjacat - 3 freq onybÂ’dy - 2 freq onybud - 1 freq onybuddies - 1 freq onybodys - 1 freq |
MetaPhone code - ONFBT onvbody - 1 freq |
ONVBODY |
| Time to execute Levenshtein function - 0.194791 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.371589 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.027429 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.036994 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.000791 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. |