| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unbonnie (0) - 1 freq bonnie (2) - 811 freq unbounce (2) - 1 freq uncannie (2) - 14 freq €˜bonnie (2) - 2 freq 'bonnie (2) - 2 freq €œbonnie (2) - 1 freq unsonsie (2) - 1 freq johonnie (3) - 1 freq unbooncin (3) - 1 freq onnie (3) - 7 freq undone (3) - 4 freq bannie (3) - 1 freq boannie (3) - 59 freq €œronnie (3) - 3 freq boanie (3) - 2 freq unboonced (3) - 1 freq unboadied (3) - 1 freq €œjonnie (3) - 1 freq unionig (3) - 1 freq gcbinnie (3) - 2 freq bonie (3) - 13 freq boonie (3) - 2 freq unborn (3) - 7 freq ronnie (3) - 223 freq |
unbonnie (0) - 1 freq 'bonnie (3) - 2 freq uncannie (3) - 14 freq bonnie (3) - 811 freq unbounce (3) - 1 freq unbound (4) - 2 freq bannie (4) - 1 freq boannie (4) - 59 freq unborn (4) - 7 freq €œbonnie (4) - 1 freq €˜bonnie (4) - 2 freq unsonsie (4) - 1 freq nannie (4) - 4 freq unbooncin (4) - 1 freq nonin (5) - 1 freq uncanny (5) - 9 freq antonine (5) - 2 freq bonxie (5) - 8 freq bondie (5) - 3 freq 'bonnie' (5) - 2 freq unbenown (5) - 1 freq nbocnu (5) - 1 freq binne (5) - 1 freq binnae (5) - 3 freq unenin (5) - 1 freq |
SoundEx code - U515 unfunny - 2 freq unfankelt - 2 freq unfamiliar - 10 freq unfankle - 9 freq un-fanklin - 1 freq uneven - 5 freq uneventful - 1 freq unbenown - 1 freq unopened - 4 freq unmovan - 1 freq univentful - 1 freq unavenged - 1 freq unbonnie - 1 freq unboonced - 1 freq unbooncin - 1 freq un-findin - 1 freq un-faansindrie - 1 freq unfankilt - 1 freq unhovin - 1 freq unmovin - 1 freq unbuoyant - 1 freq unfeenished - 2 freq unfankles - 1 freq unifyin - 1 freq 'uneven' - 1 freq unfeinisht - 2 freq unpunished - 1 freq unfeenisht - 1 freq unbound - 2 freq unhappinesses - 1 freq unfanklin - 1 freq unifying - 1 freq unfameeliar - 1 freq unfameeliarity - 1 freq umvioahmg - 1 freq unfounded - 1 freq unbounce - 1 freq unfinalised - 1 freq unfamilar - 1 freq unbounders - 1 freq unfinished - 2 freq |
MetaPhone code - UNBN unbonnie - 1 freq |
UNBONNIE bonnie - 811 freq bonny - 501 freq bonniest - 48 freq bonnier - 24 freq bonnie's - 6 freq bonnily - 11 freq bonniness - 2 freq bonnie' - freq bonniely - 1 freq unbonnie - 1 freq |
| Time to execute Levenshtein function - 0.381933 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.976010 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.028270 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.097391 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.001194 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. |