| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanchancy (0) - 18 freq wanchance (1) - 1 freq wanchany (1) - 1 freq oonchancy (2) - 3 freq wanchancie (2) - 4 freq unchancy (2) - 18 freq penchance (3) - 1 freq naechance (3) - 1 freq wanchauncie (3) - 2 freq chancy (3) - 6 freq vacancy (3) - 2 freq mischancy (3) - 4 freq watchan (3) - 20 freq onchance (3) - 1 freq wenchin (4) - 1 freq chance (4) - 548 freq watchen (4) - 7 freq hanchin (4) - 1 freq clancy (4) - 24 freq achan (4) - 2 freq anthony (4) - 12 freq constancy (4) - 4 freq wanhap (4) - 1 freq bacchanal (4) - 1 freq winchin (4) - 16 freq |
wanchancy (0) - 18 freq wanchance (1) - 1 freq wanchancie (2) - 4 freq wanchany (2) - 1 freq unchancy (3) - 18 freq oonchancy (3) - 3 freq wanchauncie (3) - 2 freq onchance (4) - 1 freq penchance (4) - 1 freq naechance (4) - 1 freq oonchancie (5) - 1 freq winchin' (5) - 1 freq unchancie (5) - 6 freq winchin (5) - 16 freq wenchin (5) - 1 freq chancy (5) - 6 freq mischancy (5) - 4 freq watchan (5) - 20 freq enchant (6) - 2 freq penchant (6) - 3 freq watchin' (6) - 8 freq lenchan (6) - 1 freq watchin (6) - 395 freq winchman (6) - 1 freq enhance (6) - 15 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 - WNXNS wanchancy - 18 freq wanchauncie - 2 freq wanchance - 1 freq wanchancie - 4 freq |
WANCHANCY |
| Time to execute Levenshtein function - 0.213755 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.449346 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.037322 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.038772 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.000976 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. |