| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wnquanjar (0) - 1 freq quanta (4) - 1 freq squander (4) - 4 freq quanter (4) - 4 freq wutnman (5) - 1 freq waelar (5) - 1 freq whaar (5) - 180 freq wundas (5) - 1 freq cunnar (5) - 1 freq quaak (5) - 3 freq waatar (5) - 1 freq nuances (5) - 3 freq wattar (5) - 2 freq waaatar (5) - 1 freq quatary (5) - 1 freq quaeter (5) - 1 freq wuznae (5) - 2 freq commandar (5) - 1 freq quater (5) - 5 freq anundir (5) - 1 freq qantas (5) - 1 freq squar (5) - 7 freq wunder (5) - 26 freq quhar (5) - 24 freq squalor (5) - 2 freq |
wnquanjar (0) - 1 freq wunnur (7) - 1 freq wunner (7) - 282 freq quanter (7) - 4 freq squander (7) - 4 freq wanner (7) - 18 freq anunder (8) - 44 freq waandir (8) - 1 freq wnar (8) - 1 freq whanur (8) - 1 freq wunna (8) - 10 freq an'under (8) - 3 freq wunter (8) - 28 freq wunnae (8) - 13 freq wunnér (8) - 2 freq endanger (8) - 1 freq uncaner (8) - 2 freq quandry (8) - 1 freq waander (8) - 5 freq anunner (8) - 1 freq wantan (8) - 4 freq wunnèr (8) - 1 freq winner (8) - 143 freq gunnar (8) - 6 freq nanr (8) - 1 freq |
SoundEx code - W525 whingin - 4 freq winkin - 16 freq winsome - 5 freq winchin - 16 freq wenchin - 1 freq wanchancy - 18 freq wankin - 4 freq wheengin - 3 freq wanchauncie - 2 freq wincin - 1 freq whingein - 5 freq wink-wink - 1 freq wineskins - 3 freq wunsum - 1 freq wineskïns - 1 freq wine-skins - 1 freq weengan - 1 freq wameskin - 1 freq wanchance - 1 freq wanchancie - 4 freq winchin' - 1 freq whinkin - 1 freq winsnae - 1 freq wanchany - 1 freq winging - 1 freq whinging - 1 freq winqm - 1 freq winchman - 1 freq wnzum - 1 freq wnusmqrptt - 1 freq wnquanjar - 1 freq |
MetaPhone code - NKNJR wnquanjar - 1 freq |
WNQUANJAR |
| Time to execute Levenshtein function - 0.319936 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.602958 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.061148 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.041165 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.000978 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. |