Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unfankle (0) - 9 freq unfankles (1) - 1 freq unfankilt (2) - 1 freq untangle (2) - 1 freq unfankelt (2) - 2 freq fankle (2) - 45 freq unfanklin (2) - 1 freq wrankle (3) - 1 freq unfairly (3) - 3 freq un-fanklin (3) - 1 freq ankle (3) - 36 freq fankles (3) - 4 freq unbuckle (3) - 3 freq infantile (3) - 1 freq hankle (3) - 1 freq onfankelt (3) - 1 freq fanklie (3) - 1 freq unfauld (3) - 1 freq fankled (3) - 14 freq uncannie (3) - 14 freq fanklet (3) - 1 freq enfante (3) - 1 freq unmankit (3) - 1 freq rankle (3) - 3 freq fanklt (3) - 3 freq |
unfankle (0) - 9 freq unfankles (2) - 1 freq unfanklin (3) - 1 freq unfankelt (3) - 2 freq fankle (3) - 45 freq unfankilt (3) - 1 freq infantile (4) - 1 freq onfankelt (4) - 1 freq fanklie (4) - 1 freq untangle (4) - 1 freq fankil (5) - 2 freq enfante (5) - 1 freq fangle (5) - 1 freq fankled (5) - 14 freq fanklt (5) - 3 freq rankle (5) - 3 freq unmankit (5) - 1 freq fanklet (5) - 1 freq un-fanklin (5) - 1 freq unfairly (5) - 3 freq wrankle (5) - 1 freq fankles (5) - 4 freq ankle (5) - 36 freq hankle (5) - 1 freq unbuckle (5) - 3 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 - UNFNKL unfankle - 9 freq |
UNFANKLE |
Time to execute Levenshtein function - 0.191275 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.352742 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.027239 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.037657 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.000907 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. |