| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saboteurs (0) - 2 freq labsters (3) - 9 freq labours (3) - 5 freq wabsters (3) - 10 freq scooters (3) - 2 freq amateurs (3) - 10 freq savours (3) - 1 freq saunters (3) - 3 freq shooters (3) - 2 freq wasters (4) - 6 freq scoter (4) - 1 freq moters (4) - 1 freq rachters (4) - 1 freq dooters (4) - 2 freq sates (4) - 9 freq baters (4) - 2 freq labourers (4) - 4 freq maitters (4) - 115 freq habitus (4) - 1 freq staurs (4) - 3 freq sottars (4) - 3 freq satyrs (4) - 3 freq raconteur (4) - 2 freq footers (4) - 3 freq tasters (4) - 1 freq |
saboteurs (0) - 2 freq saunters (4) - 3 freq shooters (4) - 2 freq scooters (4) - 2 freq styters (5) - 1 freq scaiters (5) - 1 freq sesters (5) - 3 freq satyrs (5) - 3 freq steers (5) - 11 freq slaiters (5) - 1 freq slaters (5) - 8 freq sottars (5) - 3 freq robotars (5) - 1 freq skyters (5) - 1 freq sters (5) - 1 freq seisters (5) - 1 freq systers (5) - 1 freq sobers (5) - 1 freq baiters (5) - 2 freq stours (5) - 3 freq savours (5) - 1 freq shiters (5) - 1 freq biters (5) - 2 freq amateurs (5) - 10 freq wabsters (5) - 10 freq |
SoundEx code - S136 safter - 10 freq spider's - 1 freq spider - 30 freq speeder - 16 freq softer - 4 freq spitters - 2 freq spitter - 1 freq speeders - 7 freq shifter - 1 freq spatrils - 1 freq sceptre - 2 freq spiders' - 1 freq subterranean - 3 freq skifters - 2 freq skifter - 4 freq saft-haerted - 1 freq spider-leg - 1 freq spiders - 6 freq speederlike - 1 freq speedery - 2 freq sputtered - 1 freq speeder's - 1 freq speider - 1 freq saft-hertit - 1 freq speeders' - 1 freq speedir - 2 freq subtract - 1 freq saftware - 6 freq spidery - 1 freq spatters - 4 freq spattered - 3 freq saboteurs - 2 freq saftweir - 1 freq spaterson - 6 freq 'spider' - 2 freq 'spiders' - 1 freq 'speddart' - 2 freq spiderlegs - 1 freq subtraction - 1 freq shafttours - 1 freq |
MetaPhone code - SBTRS saboteurs - 2 freq |
SABOTEURS |
| Time to execute Levenshtein function - 0.229469 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.460083 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.034678 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.038025 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.000978 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. |