Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
whittericks (0) - 3 freq whitterick (1) - 7 freq whittrick (2) - 1 freq whutricks (3) - 1 freq witterins (3) - 1 freq chitterie (4) - 1 freq chitterin' (4) - 1 freq hysterics (4) - 2 freq watterwirks (4) - 2 freq chittering (4) - 2 freq whittered (4) - 1 freq whitriggs (4) - 1 freq whitreck (4) - 1 freq pairtricks (4) - 1 freq waitters (4) - 4 freq white-ies (4) - 1 freq witterin (4) - 3 freq chitterin (4) - 44 freq wittering (4) - 1 freq bitticks (4) - 2 freq chitters (4) - 7 freq hitter's (4) - 1 freq whitehills (4) - 2 freq limericks (4) - 1 freq paitricks (4) - 7 freq |
whittericks (0) - 3 freq whitterick (2) - 7 freq whittrick (3) - 1 freq whutricks (4) - 1 freq whitreck (6) - 1 freq witterins (6) - 1 freq whutrick (6) - 2 freq paitricks (7) - 7 freq bitticks (7) - 2 freq chitters (7) - 7 freq whiterats (7) - 2 freq worttrochs (7) - 1 freq shitters (7) - 3 freq etterick (7) - 1 freq hitters (7) - 1 freq watterins (7) - 1 freq hitter's (7) - 1 freq whitriggs (7) - 1 freq whittered (7) - 1 freq hysterics (7) - 2 freq pairtricks (7) - 1 freq watterwirks (7) - 2 freq huttercups (7) - 1 freq attracks (7) - 1 freq waitters (7) - 4 freq |
SoundEx code - W362 watter-craw's - 1 freq watter-craw - 4 freq watters - 86 freq widd-wark - 1 freq waters - 18 freq watter's - 27 freq 'waiters - 1 freq widworkin - 2 freq whitterick - 7 freq water's - 4 freq widdershins - 10 freq witries - 2 freq wather's - 2 freq wattergaw - 9 freq weather's - 24 freq watter''s - 2 freq wiederschauen - 1 freq whitreck - 1 freq watter-side - 2 freq waether's - 2 freq watergaw - 12 freq waterside - 3 freq wutries - 1 freq wither's - 1 freq w'athers - 2 freq w'ather's - 2 freq weathers - 3 freq wattries - 2 freq wattirs - 3 freq wuidwark - 2 freq whautr's - 4 freq waiters - 8 freq watercolour - 2 freq watter-jug - 3 freq withers - 5 freq wattérs - 4 freq whutricks - 1 freq whutrick - 2 freq waitress - 8 freq waiter's - 1 freq waitresses - 2 freq waaters - 4 freq waithercock' - 1 freq watersheds - 1 freq wattèr's - 1 freq waterstone's - 6 freq waiters's - 1 freq waders - 4 freq waitressing - 1 freq wattercress - 2 freq wattir's - 1 freq whittericks - 3 freq watergaws - 2 freq wattercolours - 1 freq wateries - 1 freq widdirs - 1 freq water-supply - 1 freq watterside - 5 freq watergrace - 1 freq wedder-cocks - 1 freq water-gangs - 1 freq wadder's - 2 freq watergaw-kiltit - 1 freq watter-cairtie - 1 freq wattersports - 1 freq whittrick - 1 freq withershins - 5 freq watter-joug - 2 freq wathers - 1 freq waatir's - 1 freq wattir-syde - 2 freq wattir-gaws - 1 freq widwork - 1 freq waithers - 1 freq wather-wise - 1 freq widders - 2 freq waittergate - 13 freq waitter-gate - 2 freq waitergate - 2 freq waitters - 4 freq waiter-shed - 1 freq whitriggs - 1 freq wattergaws - 1 freq weather-hackit - 1 freq wattergates - 1 freq waterstones - 4 freq wetherspoons - 1 freq waitrose - 3 freq waitros - 1 freq whodares - 2 freq watershed - 1 freq widdwark - 1 freq weatherchannel - 1 freq weathercee - 1 freq |
MetaPhone code - WTRKS whutricks - 1 freq whittericks - 3 freq watergaws - 2 freq wattir-gaws - 1 freq whitriggs - 1 freq wattergaws - 1 freq |
WHITTERICKS |
Time to execute Levenshtein function - 0.256471 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.418756 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.028269 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.037848 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.001064 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. |