| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanchancy (0) - 18 freq wanchance (1) - 1 freq wanchany (1) - 1 freq oonchancy (2) - 3 freq unchancy (2) - 18 freq wanchancie (2) - 4 freq mischancy (3) - 4 freq wanchauncie (3) - 2 freq penchance (3) - 1 freq watchan (3) - 20 freq vacancy (3) - 2 freq naechance (3) - 1 freq onchance (3) - 1 freq chancy (3) - 6 freq wantan (4) - 4 freq raechan (4) - 1 freq wachman (4) - 1 freq manahan's (4) - 3 freq rauchan (4) - 1 freq clancy (4) - 24 freq watchn (4) - 1 freq mischance (4) - 1 freq wangrace (4) - 1 freq washan (4) - 3 freq watchin (4) - 386 freq |
wanchancy (0) - 18 freq wanchance (1) - 1 freq wanchancie (2) - 4 freq wanchany (2) - 1 freq wanchauncie (3) - 2 freq oonchancy (3) - 3 freq unchancy (3) - 18 freq penchance (4) - 1 freq naechance (4) - 1 freq onchance (4) - 1 freq winchin' (5) - 1 freq wenchin (5) - 1 freq winchin (5) - 15 freq unchancie (5) - 6 freq oonchancie (5) - 1 freq watchan (5) - 20 freq mischancy (5) - 4 freq chancy (5) - 6 freq meschance (6) - 1 freq pinchan (6) - 1 freq watching (6) - 79 freq penchant (6) - 3 freq vacancy (6) - 2 freq chance (6) - 530 freq watchen (6) - 7 freq |
SoundEx code - W525 whingin - 4 freq winkin - 16 freq winsome - 5 freq winchin - 15 freq wenchin - 1 freq wanchancy - 18 freq wankin - 4 freq wheengin - 3 freq wanchauncie - 2 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.185729 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.339608 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.027332 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.037063 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.000779 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. |