| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wallpaperin (0) - 2 freq wallpaper (2) - 5 freq walpaper (3) - 1 freq paperin (4) - 2 freq wallopers (4) - 2 freq wawpaper (4) - 6 freq swallaein (4) - 5 freq walloper (4) - 6 freq clapperin (4) - 1 freq clipperin (4) - 2 freq lipperin (4) - 8 freq wallopin (4) - 16 freq walterin (4) - 3 freq lapperin (4) - 1 freq callerin (4) - 1 freq follaein (5) - 171 freq waakenin (5) - 2 freq ballerina (5) - 2 freq allanerly (5) - 1 freq hallaeen (5) - 12 freq gallerie (5) - 1 freq fallaen (5) - 6 freq walloped (5) - 7 freq sandpaper (5) - 3 freq waterin (5) - 7 freq |
wallpaperin (0) - 2 freq wallpaper (3) - 5 freq walpaper (5) - 1 freq clapperin (6) - 1 freq clipperin (6) - 2 freq walloper (6) - 6 freq lipperin (6) - 8 freq lapperin (6) - 1 freq wallopers (6) - 2 freq wallopin (6) - 16 freq wellpark (7) - 1 freq willpower (7) - 2 freq willpooer (7) - 1 freq lipperan (7) - 2 freq slipperine (7) - 2 freq walterin (7) - 3 freq wawpaper (7) - 6 freq callerin (7) - 1 freq paperin (7) - 2 freq swallaein (8) - 5 freq gollerin (8) - 6 freq balluderon (8) - 3 freq bullerin (8) - 1 freq collapsin (8) - 6 freq tapperon (8) - 1 freq |
SoundEx code - W411 wallpaper - 5 freq walpaper - 1 freq wallpaperin - 2 freq |
MetaPhone code - WLPPRN wallpaperin - 2 freq |
WALLPAPERIN paper - 526 freq papers - 137 freq paperin - 2 freq papering - freq newspaper - 63 freq newspapers - 38 freq newspapermen - 3 freq paperback - 25 freq paperbacker - 1 freq paperwork - 7 freq paperwirk - 2 freq wawpaper - 6 freq wallpaper - 5 freq wallpaperin - 2 freq papershop - 3 freq paper- - 2 freq waste-paper - 2 freq paper-thin - 1 freq sandpaper - 3 freq |
| Time to execute Levenshtein function - 0.229141 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.406362 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.028135 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.037584 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.001275 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. |