| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wance-aer (0) - 1 freq wanceower (2) - 1 freq wannerer (3) - 1 freq wanderer (3) - 5 freq wancee (3) - 1 freq wanae (4) - 1 freq wyne-derk (4) - 1 freq wrangdaer (4) - 4 freq cancelled (4) - 17 freq vancouver (4) - 1 freq wanderan (4) - 2 freq waapeper (4) - 1 freq wanced (4) - 3 freq dancean (4) - 3 freq wance (4) - 328 freq wander (4) - 41 freq cancer (4) - 43 freq wannered (4) - 3 freq wannae (4) - 6 freq ancestor (4) - 16 freq banesair (4) - 1 freq onceover (4) - 1 freq waether (4) - 3 freq wuncher (4) - 1 freq wanderans (4) - 1 freq |
wance-aer (0) - 1 freq wanceower (3) - 1 freq wuncher (5) - 1 freq wancee (5) - 1 freq wannerer (5) - 1 freq wanderer (5) - 5 freq wanner (6) - 18 freq mancouver (6) - 1 freq wanker (6) - 17 freq wan-eyed (6) - 1 freq wanchany (6) - 1 freq sanctuar (6) - 5 freq wankier (6) - 1 freq fancier (6) - 3 freq wann'er (6) - 1 freq watcher (6) - 1 freq wance't (6) - 3 freq wee-er (6) - 29 freq waanderer (6) - 2 freq dancer (6) - 31 freq wa-t-er (6) - 2 freq sanchar (6) - 1 freq concealer (6) - 2 freq wander (6) - 41 freq wance (6) - 328 freq |
SoundEx code - W526 wance-aer - 1 freq wangrace - 1 freq winscreen - 1 freq wine-christ - 1 freq wanker - 17 freq wankers' - 1 freq wankers - 5 freq wuncher - 1 freq wanceower - 1 freq winger - 3 freq wanscrievit - 1 freq wham-sae-e'er - 1 freq wheengers - 1 freq €œwanker - 1 freq wankier - 1 freq wancertainities - 1 freq wancertainties - 1 freq wingers - 1 freq winkers - 1 freq |
MetaPhone code - WNSR wance-aer - 1 freq |
WANCE-AER |
| Time to execute Levenshtein function - 0.217442 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.398635 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.027748 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.044255 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.001111 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. |