| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| widpeckers (0) - 1 freq widpecker (1) - 2 freq wuidpeckers (1) - 1 freq widdpecker (2) - 1 freq wickers (3) - 1 freq woodpecker (3) - 1 freq deckers (3) - 2 freq dockers (4) - 12 freq widders (4) - 2 freq wheekers (4) - 1 freq pecker (4) - 1 freq pickers (4) - 1 freq heckers (4) - 1 freq spickers (4) - 15 freq packers (4) - 1 freq decker (4) - 12 freq feckers (4) - 7 freq lickers (4) - 2 freq respecters (4) - 1 freq whisperers (4) - 1 freq winkers (4) - 1 freq kickers (4) - 1 freq speakers (4) - 223 freq speikers (4) - 46 freq nickers (4) - 1 freq |
widpeckers (0) - 1 freq wuidpeckers (1) - 1 freq widpecker (2) - 2 freq woodpecker (4) - 1 freq widdpecker (4) - 1 freq deckers (5) - 2 freq wickers (5) - 1 freq pickers (6) - 1 freq spickers (6) - 15 freq packers (6) - 1 freq dockers (6) - 12 freq wipers (7) - 4 freq speakers (7) - 223 freq wikkers (7) - 1 freq speikers (7) - 46 freq hijackers (7) - 1 freq wicker (7) - 2 freq wirkers (7) - 20 freq kickers (7) - 1 freq ickers (7) - 1 freq wiskers (7) - 1 freq nickers (7) - 1 freq heckers (7) - 1 freq wheekers (7) - 1 freq widders (7) - 2 freq |
SoundEx code - W312 widdpecker - 1 freq weetabix - 2 freq wuidpeckers - 1 freq white-faced - 8 freq whitefaced - 1 freq whit-the-fuck - 1 freq widpecker - 2 freq widpeckers - 1 freq wdpscsyhi - 1 freq woodpigeon - 1 freq whatthefuck - 1 freq whattheffacts - 1 freq woodpecker - 1 freq |
MetaPhone code - WTPKRS wuidpeckers - 1 freq widpeckers - 1 freq |
WIDPECKERS |
| Time to execute Levenshtein function - 0.598503 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.980668 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.030481 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.077092 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.000872 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. |