| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wirkies (0) - 1 freq birkies (1) - 1 freq wilkies (1) - 1 freq wirdies (1) - 13 freq wirkins (1) - 7 freq workies (1) - 1 freq wirries (1) - 10 freq wirkin' (2) - 2 freq markies (2) - 1 freq walkies (2) - 8 freq withies (2) - 1 freq airmies (2) - 16 freq wirkeens (2) - 1 freq birsies (2) - 1 freq dirknes (2) - 1 freq sickies (2) - 1 freq dinkies (2) - 1 freq wires (2) - 27 freq wirkers (2) - 19 freq wirks (2) - 49 freq silkies (2) - 2 freq firkins (2) - 2 freq tinkies (2) - 2 freq wirrie (2) - 6 freq yorkies (2) - 1 freq |
wirkies (0) - 1 freq workies (1) - 1 freq birkies (2) - 1 freq wirks (2) - 49 freq wilkies (2) - 1 freq wirries (2) - 10 freq wirdies (2) - 13 freq wirkins (2) - 7 freq wirkin (3) - 159 freq workins (3) - 3 freq porkies (3) - 2 freq wurkirs (3) - 1 freq derkies (3) - 1 freq wordies (3) - 6 freq larkies (3) - 1 freq worries (3) - 62 freq wulkies (3) - 2 freq forkies (3) - 1 freq warkie (3) - 1 freq warkins (3) - 1 freq wurks (3) - 3 freq wirker (3) - 5 freq wirkit (3) - 40 freq wirk's (3) - 1 freq wurries (3) - 2 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 - 49 freq wark''s - 1 freq works - 118 freq wirkies - 1 freq work's - 3 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.232622 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.403181 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.027675 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.038526 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.000840 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. |