| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| selkirk (0) - 10 freq selkies (2) - 14 freq falkirk (2) - 19 freq selkie (2) - 17 freq sellar (3) - 15 freq seabird (3) - 8 freq netwirk (3) - 2 freq merkir (3) - 1 freq stairk (3) - 4 freq elbick (3) - 3 freq selling (3) - 10 freq saelik (3) - 1 freq sellie (3) - 2 freq sellars (3) - 1 freq selfish (3) - 22 freq sellers (3) - 2 freq seeker (3) - 2 freq sulkit (3) - 3 freq seleck (3) - 2 freq seekin' (3) - 9 freq seller (3) - 11 freq silkies (3) - 2 freq spairk (3) - 8 freq seekin (3) - 100 freq elkie (3) - 1 freq |
selkirk (0) - 10 freq falkirk (3) - 19 freq ashkirk (4) - 2 freq selkie (4) - 17 freq selkies (4) - 14 freq kirk (5) - 528 freq skirp (5) - 5 freq silkie (5) - 3 freq fawkirk (5) - 15 freq snirk (5) - 1 freq lirk (5) - 5 freq smirk (5) - 61 freq sulkily (5) - 3 freq slaik (5) - 1 freq saltire (5) - 43 freq selkee (5) - 1 freq shirk (5) - 2 freq skirr (5) - 1 freq slairt (5) - 1 freq selkse (5) - 1 freq falkirk' (5) - 1 freq sklaik (5) - 2 freq dunkirk (5) - 3 freq €˜kirk (5) - 2 freq slokk (5) - 1 freq |
SoundEx code - S426 sluggard' - 5 freq slaigert - 1 freq sel-ashuirance - 1 freq selkirk - 10 freq slessor - 4 freq silksrin'r - 1 freq shalls'r - 1 freq shilcorn - 2 freq slicer - 1 freq sluggard - 1 freq solsgirth - 1 freq slagger - 2 freq 'sheilagreen' - 1 freq saul-searchan - 1 freq shell-grittit - 1 freq slaigerin - 2 freq slogie-riddles - 2 freq selkirkshire - 1 freq siliguri - 1 freq sowel-searchin - 2 freq sel-assertin - 1 freq slaugherhoose - 1 freq schoolsreopen - 1 freq sluggerotoole - 4 freq skillsÂ’r - 1 freq slugger - 1 freq slashertrash - 1 freq selkirkalereds - 2 freq schoolsgrowingfood - 1 freq |
MetaPhone code - SLKRK selkirk - 10 freq |
SELKIRK |
| Time to execute Levenshtein function - 0.318803 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.795262 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.074964 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.039165 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.000833 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. |