| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tutorial (0) - 2 freq tutorials (1) - 3 freq manorial (3) - 1 freq buirial (3) - 4 freq sartorial (3) - 2 freq utopias (3) - 1 freq burial (3) - 12 freq tutor (3) - 8 freq tutors' (3) - 1 freq trial (3) - 82 freq equatorial (3) - 2 freq utopian (3) - 4 freq utopia (3) - 1 freq astoria (3) - 1 freq memorial (3) - 37 freq tutors (3) - 6 freq material (3) - 86 freq totonia (3) - 1 freq thrial (3) - 1 freq editorial (3) - 26 freq tuttan (4) - 1 freq retiral (4) - 5 freq suttil (4) - 1 freq eternal (4) - 29 freq nettrill (4) - 1 freq |
tutorial (0) - 2 freq tutorials (2) - 3 freq equatorial (4) - 2 freq tutors (4) - 6 freq editorial (4) - 26 freq trial (4) - 82 freq material (4) - 86 freq thrial (4) - 1 freq tutor (4) - 8 freq literal (5) - 7 freq tetris (5) - 1 freq total (5) - 98 freq pitril (5) - 7 freq natral (5) - 6 freq natural (5) - 90 freq neteral (5) - 1 freq lateral (5) - 3 freq neutral (5) - 17 freq traal (5) - 1 freq guttural (5) - 4 freq tutors' (5) - 1 freq manorial (5) - 1 freq tutree (5) - 1 freq astoria (5) - 1 freq memorial (5) - 37 freq |
SoundEx code - T364 tutorials - 3 freq tatterwallop - 1 freq tither'll - 1 freq tatterwallopie - 1 freq teeterlogic - 2 freq tatterwalloppy - 1 freq that-relativisation - 2 freq tutorial - 2 freq thederrywalls - 1 freq |
MetaPhone code - TTRL tutorial - 2 freq |
TUTORIAL |
| Time to execute Levenshtein function - 0.230327 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.401328 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.039109 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.046747 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.000855 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. |