Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pokiest (0) - 1 freq poorest (2) - 9 freq pokes (2) - 22 freq pockies (2) - 1 freq pokit (2) - 7 freq priest (2) - 40 freq fokest (2) - 1 freq pokert (2) - 1 freq porkies (2) - 2 freq pokeit (2) - 1 freq holiest (2) - 2 freq totiest (2) - 1 freq poket (2) - 4 freq posies (2) - 6 freq polist (2) - 4 freq dowiest (2) - 1 freq poxies (2) - 1 freq ponies (2) - 6 freq pokkies (2) - 2 freq fykiest (2) - 2 freq poshest (2) - 2 freq peonies (3) - 1 freq point (3) - 403 freq coist (3) - 4 freq kest (3) - 18 freq |
pokiest (0) - 1 freq pokeit (3) - 1 freq polist (3) - 4 freq fykiest (3) - 2 freq poorest (3) - 9 freq poket (3) - 4 freq pokert (3) - 1 freq fokest (3) - 1 freq pokes (3) - 22 freq pokit (3) - 7 freq priest (3) - 40 freq pikes (4) - 8 freq preist (4) - 3 freq pist (4) - 3 freq peediest (4) - 4 freq poast (4) - 5 freq prest (4) - 1 freq keest (4) - 3 freq paist (4) - 1 freq papist (4) - 3 freq poaket (4) - 14 freq puirest (4) - 3 freq kist (4) - 117 freq pakis (4) - 1 freq unkist (4) - 2 freq |
SoundEx code - P223 pokiest - 1 freq possessed - 16 freq psychiatrist's - 1 freq psychiatric - 6 freq psychiatrically - 1 freq pakkaged - 1 freq 'psychotic - 1 freq psychotic - 3 freq pakistan - 3 freq pakistani - 2 freq psychedelic - 2 freq psychiatry - 1 freq poashoxter - 1 freq psychiatrists - 1 freq poke-saiddil - 1 freq poshest - 2 freq psychiatrist - 1 freq packaged - 2 freq pussycat - 3 freq psychotherapy - 1 freq possesed - 1 freq possesst - 1 freq pish-stained - 2 freq pakaged - 1 freq psychodrama - 1 freq posessed - 1 freq |
MetaPhone code - PKST pokiest - 1 freq pigsty - 2 freq |
POKIEST |
Time to execute Levenshtein function - 0.206159 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.383937 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.028807 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.038704 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.000972 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. |