| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wirkies (0) - 1 freq wirdies (1) - 13 freq birkies (1) - 1 freq wirkins (1) - 7 freq wirries (1) - 10 freq workies (1) - 1 freq wilkies (1) - 1 freq winkie (2) - 3 freq wingies (2) - 1 freq markies (2) - 1 freq tinkies (2) - 2 freq wirkin (2) - 160 freq wires (2) - 27 freq wifies (2) - 57 freq mirkie (2) - 25 freq wilkins (2) - 1 freq wirdie (2) - 17 freq witries (2) - 2 freq birdies (2) - 27 freq birsies (2) - 1 freq wirks (2) - 50 freq wirkeens (2) - 1 freq wurries (2) - 2 freq birkie (2) - 27 freq mirkins (2) - 1 freq |
wirkies (0) - 1 freq workies (1) - 1 freq wirks (2) - 50 freq wirries (2) - 10 freq wilkies (2) - 1 freq wirkins (2) - 7 freq wirdies (2) - 13 freq birkies (2) - 1 freq wirk's (3) - 1 freq forkies (3) - 1 freq works (3) - 121 freq larkies (3) - 1 freq warks (3) - 132 freq derkies (3) - 1 freq walkies (3) - 8 freq workins (3) - 4 freq warkins (3) - 1 freq wulkies (3) - 2 freq wurries (3) - 2 freq wirkers (3) - 20 freq darkies (3) - 2 freq wirkit (3) - 40 freq wurkirs (3) - 1 freq worries (3) - 63 freq wirkin (3) - 160 freq |
SoundEx code - W622 wirkies - 1 freq wirricowes - 1 freq warkhoose - 2 freq worricows - 1 freq wershest - 1 freq wreckage - 4 freq warsaw's - 1 freq wirkwyse - 1 freq workies - 1 freq 'wirawjocktamsonsbairns' - 1 freq waorgujmd - 1 freq wrxag - 1 freq worsest - 1 freq worsestest - 1 freq wrujcizqw - 1 freq wrjygglxem - 1 freq wrgez - 1 freq |
MetaPhone code - WRKS warks - 132 freq wirks - 50 freq wark''s - 1 freq works - 121 freq wirkies - 1 freq work's - 4 freq worricows - 1 freq wark's - 4 freq werrocks - 1 freq wurks - 3 freq waarks - 5 freq warks' - 1 freq wirkwyse - 1 freq workies - 1 freq wirk's - 1 freq |
WIRKIES |
| Time to execute Levenshtein function - 0.230296 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.366117 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.028035 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.038181 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.000951 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. |