Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
woodpigeon (0) - 1 freq pigeon (4) - 37 freq woodbines (4) - 1 freq woopin (4) - 1 freq woodbine (4) - 1 freq wooden (4) - 37 freq woodie (4) - 1 freq 'pigeon (4) - 1 freq good-goin (5) - 1 freq loopin (5) - 3 freq poopin (5) - 1 freq condition (5) - 36 freq woodwick (5) - 1 freq wooziness (5) - 1 freq doonpittan (5) - 1 freq condeition (5) - 3 freq lowpin-on (5) - 1 freq woolies (5) - 2 freq joodgin (5) - 1 freq whoopin (5) - 5 freq hodgson (5) - 2 freq windpipe (5) - 3 freq goodies (5) - 6 freq opinion (5) - 70 freq oppinen (5) - 1 freq |
woodpigeon (0) - 1 freq 'pigeon (6) - 1 freq wooden (6) - 37 freq woodbine (6) - 1 freq pigeon (6) - 37 freq woopin (6) - 1 freq joodgin (7) - 1 freq waidgin (7) - 1 freq whoopin (7) - 5 freq woodsman (7) - 1 freq wadgin (7) - 4 freq roadsign (7) - 1 freq widpile (7) - 1 freq woodburn (7) - 3 freq dudgeon (7) - 1 freq woodie (7) - 1 freq woodbines (7) - 1 freq good-goin (7) - 1 freq wedgin (7) - 1 freq dungeon (7) - 7 freq upgeen (8) - 1 freq wigan (8) - 1 freq widbine (8) - 1 freq dragon (8) - 38 freq wogan (8) - 1 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 - WTPJN woodpigeon - 1 freq |
WOODPIGEON |
Time to execute Levenshtein function - 0.232279 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.439204 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.032500 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.041635 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.001096 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. |