| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| white-eened (0) - 1 freq white-wamed (3) - 2 freq white-tiled (3) - 1 freq white-faced (3) - 8 freq white-washed (4) - 2 freq white-haired (4) - 1 freq wide-e'ed (4) - 1 freq wide-eed (4) - 2 freq white-breid (4) - 1 freq wire-baned (4) - 1 freq whitefaced (4) - 1 freq whitefield (4) - 2 freq wide-eyed (4) - 2 freq whitsaeever (4) - 2 freq whit-ever (4) - 1 freq whittered (4) - 1 freq white-lugged (4) - 1 freq white-looped (4) - 1 freq whitebreid (4) - 1 freq blue-eened (4) - 1 freq whiteen (4) - 7 freq misty-eened (4) - 1 freq white-harled (4) - 2 freq white-ies (4) - 1 freq white-cley (4) - 1 freq |
white-eened (0) - 1 freq white-tiled (5) - 1 freq white-faced (5) - 8 freq white-wamed (5) - 2 freq whitebreid (6) - 1 freq white-looped (6) - 1 freq whiteen (6) - 7 freq white-cley (6) - 1 freq whit-ever (6) - 1 freq white-ies (6) - 1 freq misty-eened (6) - 1 freq whittered (6) - 1 freq white-breid (6) - 1 freq white-haired (6) - 1 freq whitefaced (6) - 1 freq whitefield (6) - 2 freq heiehtened (7) - 1 freq hin-end (7) - 5 freq gate-end (7) - 1 freq whyte-haired (7) - 1 freq white-hot (7) - 1 freq whiteboard (7) - 2 freq whinneyied (7) - 1 freq whitesands (7) - 1 freq hint-end (7) - 2 freq |
SoundEx code - W353 widdie-wands - 1 freq widened - 11 freq waddin-day - 1 freq wudn't - 2 freq widn't - 1 freq wide-moothed - 1 freq white-wamed - 2 freq wittandlye - 1 freq wadn't - 1 freq white-eened - 1 freq wudend - 1 freq wident - 2 freq woodwinters - 2 freq woodwintersinv - 1 freq widnad - 1 freq |
MetaPhone code - WTNT widened - 11 freq waddin-day - 1 freq wudn't - 2 freq widn't - 1 freq wadn't - 1 freq white-eened - 1 freq wudend - 1 freq wident - 2 freq widnad - 1 freq |
WHITE-EENED |
| Time to execute Levenshtein function - 0.240460 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.410832 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.031494 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.045475 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.000988 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. |