| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanchancie (0) - 4 freq wanchance (1) - 1 freq wanchauncie (1) - 2 freq unchancie (2) - 6 freq wanchancy (2) - 18 freq oonchancie (2) - 1 freq chancie (3) - 2 freq naechance (3) - 1 freq wanchany (3) - 1 freq onchance (3) - 1 freq penchance (3) - 1 freq mischancie (3) - 1 freq watchie (4) - 1 freq uncannie (4) - 14 freq janeannie (4) - 1 freq inchantit (4) - 2 freq enchantit (4) - 1 freq watchan (4) - 20 freq nancie (4) - 3 freq enhance (4) - 15 freq meschance (4) - 1 freq tenancie (4) - 2 freq perchance (4) - 3 freq manance (4) - 2 freq chance (4) - 530 freq |
wanchancie (0) - 4 freq wanchauncie (1) - 2 freq wanchance (1) - 1 freq wanchancy (2) - 18 freq oonchancie (3) - 1 freq unchancie (3) - 6 freq penchance (4) - 1 freq wanchany (4) - 1 freq onchance (4) - 1 freq naechance (4) - 1 freq oonchancy (5) - 3 freq unchancy (5) - 18 freq chancie (5) - 2 freq mischancie (5) - 1 freq chance (6) - 530 freq perchance (6) - 3 freq mischance (6) - 1 freq meschance (6) - 1 freq wenchin (6) - 1 freq winchin (6) - 15 freq winchin' (6) - 1 freq watchan (6) - 20 freq enhance (6) - 15 freq mischancy (7) - 4 freq tenancie (7) - 2 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 |
WANCHANCIE |
| Time to execute Levenshtein function - 0.240175 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.437803 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.029548 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.037887 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.000861 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. |