| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skarv- (0) - 1 freq starve (2) - 5 freq skave (2) - 4 freq skarr (2) - 2 freq skared (2) - 1 freq sharn- (2) - 1 freq skare (2) - 4 freq skarts (2) - 3 freq skart (2) - 2 freq skarfe (2) - 1 freq skarpy (2) - 1 freq scarve (2) - 1 freq sarve (2) - 10 freq skara (2) - 4 freq sairve (3) - 5 freq skirlt (3) - 1 freq shaav (3) - 4 freq skait (3) - 1 freq skirvin (3) - 1 freq skarvald (3) - 2 freq scar'd (3) - 1 freq kqrv (3) - 1 freq karep (3) - 1 freq skyre (3) - 6 freq skauds (3) - 1 freq |
skarv- (0) - 1 freq skarpy (4) - 1 freq skarfe (4) - 1 freq scarve (4) - 1 freq sarve (4) - 10 freq skara (4) - 4 freq skart (4) - 2 freq skirvin (4) - 1 freq starve (4) - 5 freq skarts (4) - 3 freq skarr (4) - 2 freq skave (4) - 4 freq skare (4) - 4 freq sharn- (4) - 1 freq skared (4) - 1 freq skrieve (5) - 5 freq skerl (5) - 1 freq skaired (5) - 6 freq sklave (5) - 2 freq story- (5) - 1 freq skairer (5) - 1 freq starvin (5) - 16 freq skyran (5) - 3 freq starved (5) - 2 freq skera (5) - 1 freq |
SoundEx code - S610 sherp - 96 freq scarf - 44 freq scruff - 10 freq sairve - 5 freq sharp - 90 freq screive-ye - 1 freq screive - 70 freq scrape - 30 freq shairp - 80 freq scrappy - 4 freq skerf - 4 freq syrup - 24 freq scrieve - 168 freq serve - 72 freq survey - 33 freq scrub - 19 freq sereive - 1 freq scarp - 2 freq skirp - 5 freq screeve - 1 freq sheriff - 13 freq scruffy - 6 freq scribe - 7 freq sherpa - 2 freq scrap - 33 freq scraip - 1 freq shayrp - 1 freq scrive - 1 freq sorrafu - 4 freq 'scrieve - 1 freq scrabo - 3 freq swerve - 8 freq serieve - 3 freq skreive - 9 freq sarve - 10 freq scriba - 1 freq scarab - 1 freq scraba - 2 freq skarpy - 1 freq shrub - 2 freq skarfe - 1 freq scerf - 1 freq skröf - 3 freq sjærp - 1 freq scruif - 4 freq scrybe - 2 freq skrieve - 5 freq sair-aff - 3 freq schairp - 1 freq skrifaðu - 1 freq skrifiði - 1 freq sharpe - 10 freq seerip - 1 freq schiref - 2 freq scraep - 1 freq screev - 1 freq sherriff - 2 freq scrubby - 1 freq €œshurrup - 1 freq €œscrieve - 1 freq serbia - 4 freq €˜sah-rah-yay-vo - 1 freq skarv- - 1 freq scrip - 3 freq sherrif - 2 freq €˜scrieve - 1 freq scairf - 1 freq €œscruff - 1 freq srv - 1 freq scrabba - 2 freq scarve - 1 freq scrapy - 1 freq srpo - 1 freq srwpby - 1 freq scurvy - 3 freq seryfa - 2 freq syrupy - 1 freq |
MetaPhone code - SKRF scarf - 44 freq scruff - 10 freq seaography - 6 freq screive - 70 freq skerf - 4 freq scrieve - 168 freq screeve - 1 freq scruffy - 6 freq skreigh - 3 freq scrive - 1 freq 'scrieve - 1 freq skreive - 9 freq skarfe - 1 freq skröf - 3 freq scruif - 4 freq skrieve - 5 freq skrifaðu - 1 freq skrifiði - 1 freq screigh - 2 freq scraigh - 1 freq screev - 1 freq seik-ryfe - 1 freq €œscrieve - 1 freq skarv- - 1 freq €˜scrieve - 1 freq scairf - 1 freq €œscruff - 1 freq scarve - 1 freq scurvy - 3 freq |
SKARV- |
| Time to execute Levenshtein function - 0.249952 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.403527 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.028879 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.038994 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.000885 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. |