Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
subscreivins (0) - 34 freq subscreivers (2) - 1 freq subscreive (3) - 1 freq subscrievin (3) - 1 freq screivins (3) - 12 freq descreivin (4) - 1 freq subscribers (4) - 2 freq screiving (4) - 3 freq screivings (4) - 24 freq 'screivin (4) - 1 freq skreivins (4) - 1 freq screevins (4) - 4 freq screivin (4) - 64 freq co-screivin (4) - 1 freq screivars (5) - 43 freq descrivin (5) - 9 freq screives (5) - 6 freq skreivin (5) - 16 freq sereivin (5) - 2 freq descreivit (5) - 5 freq subscribed (5) - 1 freq scrievins (5) - 19 freq scrivin (5) - 1 freq subscription (5) - 4 freq subscribe (5) - 6 freq |
subscreivins (0) - 34 freq subscreivers (3) - 1 freq subscrievin (4) - 1 freq screivins (5) - 12 freq subscreive (5) - 1 freq subscribers (6) - 2 freq screevins (6) - 4 freq screiving (7) - 3 freq subservient (7) - 1 freq scrivens (7) - 1 freq scrievins (7) - 19 freq co-screivin (7) - 1 freq descreivin (7) - 1 freq screivin (7) - 64 freq 'screivin (7) - 1 freq skreivins (7) - 1 freq screivings (7) - 24 freq descriving (8) - 1 freq screivers (8) - 33 freq sub-curns (8) - 1 freq skreivens (8) - 2 freq scrievens (8) - 1 freq subscribe (8) - 6 freq subservience (8) - 1 freq screevin (8) - 7 freq |
SoundEx code - S126 speaker - 64 freq speiker - 15 freq spikkers - 75 freq savagery - 4 freq spikker - 14 freq speakers - 223 freq spcired - 1 freq spikers - 3 freq subscribe - 6 freq subscription - 4 freq subservience - 1 freq subscribers - 2 freq speikars - 2 freq subscribed - 1 freq spaeker - 20 freq safegairdit - 3 freq speakers' - 1 freq speaker's - 1 freq safeguarded - 1 freq subscrievin - 1 freq spacer - 2 freq spacers - 2 freq spaekers - 39 freq sub-curns - 1 freq saifeguards - 1 freq spakers - 4 freq sub-zero - 1 freq spickers - 15 freq spykarie - 3 freq speikar - 1 freq speikers - 46 freq subscreivins - 34 freq spaekkirs - 1 freq safeguaird - 1 freq safeguard - 1 freq spaeker'll - 1 freq sub-group - 2 freq savagerie - 1 freq spikkars - 1 freq spiker - 1 freq subservient - 1 freq subscreive - 1 freq spicker - 4 freq saufgairds - 1 freq subscreivers - 1 freq speakerphone - 1 freq spaekir - 2 freq spaekirs - 1 freq spaker - 3 freq savage-armstrong - 1 freq safejourney - 1 freq soupcruncher - 2 freq sfqxsxrmoa - 1 freq szvqrelcbo - 1 freq |
MetaPhone code - SBSKRFNS subscreivins - 34 freq |
SUBSCREIVINS scrieve - 166 freq scrieves - 14 freq scriever - 60 freq skrieve - 5 freq skrieved - freq scrieven - 2 freq scrieved - 46 freq scrievin - 161 freq scrievan - 1 freq scrived - 2 freq scrivin - 1 freq screive - 69 freq subscreivins - 34 freq screivars - 43 freq screivar - 27 freq screived - 39 freq screivings - 24 freq e-screive - 13 freq screivers - 33 freq screivins - 12 freq screiver - 8 freq screives - 6 freq descreived - 4 freq screiving - 3 freq descreivit - 5 freq |
Time to execute Levenshtein function - 0.216383 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.394445 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.027731 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.043247 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.001137 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. |