| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| white-faced (0) - 8 freq whitefaced (1) - 1 freq fite-faced (2) - 1 freq white-wamed (2) - 2 freq white-haired (3) - 1 freq white-eened (3) - 1 freq white-tiled (3) - 1 freq wart-faced (3) - 2 freq white-washed (3) - 2 freq fitefaced (3) - 1 freq shame-faced (3) - 2 freq white-harled (3) - 2 freq ridd-faced (4) - 2 freq bare-faced (4) - 4 freq white-ies (4) - 1 freq blae-faced (4) - 2 freq white-breid (4) - 1 freq din-faced (4) - 1 freq rid-faced (4) - 4 freq whyte-haired (4) - 1 freq sham-faced (4) - 1 freq wire-baned (4) - 1 freq reid-faced (4) - 3 freq grim-faced (4) - 2 freq poe-faced (4) - 3 freq |
white-faced (0) - 8 freq whitefaced (2) - 1 freq white-wamed (4) - 2 freq fite-faced (4) - 1 freq wart-faced (4) - 2 freq shame-faced (5) - 2 freq white-tiled (5) - 1 freq white-eened (5) - 1 freq white-haired (5) - 1 freq whyte-haired (6) - 1 freq sham-faced (6) - 1 freq white-looped (6) - 1 freq white-breid (6) - 1 freq white-cley (6) - 1 freq whitefield (6) - 2 freq white-harled (6) - 2 freq white-washed (6) - 2 freq fitefaced (6) - 1 freq 'shit-face' (7) - 2 freq blae-faced (7) - 2 freq lyart-faced (7) - 1 freq white-gloved (7) - 1 freq fair-faced (7) - 3 freq white-lugged (7) - 1 freq whiteboard (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 - WTFST white-faced - 8 freq whitefaced - 1 freq |
WHITE-FACED |
| Time to execute Levenshtein function - 0.659000 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.840754 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.076032 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.084508 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.001127 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. |