| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| selkirk (0) - 10 freq selkie (2) - 17 freq falkirk (2) - 19 freq selkies (2) - 14 freq skirl (3) - 47 freq selfies (3) - 9 freq sellin (3) - 70 freq skirr (3) - 1 freq mckirk (3) - 1 freq sellars (3) - 1 freq seick (3) - 7 freq seekin' (3) - 9 freq dunkirk (3) - 3 freq sulkin (3) - 5 freq spairk (3) - 8 freq skirp (3) - 5 freq seawird (3) - 1 freq slick (3) - 10 freq seeking (3) - 6 freq seink (3) - 1 freq selfie (3) - 11 freq seller (3) - 11 freq seabird (3) - 8 freq melki (3) - 4 freq seekers (3) - 9 freq |
selkirk (0) - 10 freq falkirk (3) - 19 freq ashkirk (4) - 2 freq selkie (4) - 17 freq selkies (4) - 14 freq kirk (5) - 530 freq selkse (5) - 1 freq selkee (5) - 1 freq silvir (5) - 1 freq sellers (5) - 2 freq stairk (5) - 4 freq slokk (5) - 1 freq sellar (5) - 15 freq skirt (5) - 56 freq sulkit (5) - 3 freq shirk (5) - 2 freq silkie (5) - 3 freq smirk (5) - 63 freq lirk (5) - 5 freq serk (5) - 3 freq solkits (5) - 3 freq slairt (5) - 1 freq seleck (5) - 2 freq selleck (5) - 1 freq sulkily (5) - 3 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 skillsr - 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.200718 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.376582 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.027926 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.037797 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.000867 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. |