| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amorbit (0) - 1 freq orbit (2) - 10 freq morbid (2) - 3 freq abortit (2) - 2 freq absorbit (2) - 4 freq hobbit (3) - 2 freq importit (3) - 2 freq airmit (3) - 4 freq smootit (3) - 2 freq adornin (3) - 1 freq coorit (3) - 2 freq jobbit (3) - 5 freq favorit (3) - 2 freq amost (3) - 1 freq amendit (3) - 2 freq smokit (3) - 6 freq moutit (3) - 1 freq coortit (3) - 5 freq mobil (3) - 1 freq ayerit (3) - 1 freq bobbit (3) - 2 freq wormit (3) - 7 freq adroit (3) - 2 freq moorit (3) - 8 freq airtit (3) - 42 freq |
amorbit (0) - 1 freq morbid (3) - 3 freq orbit (3) - 10 freq merit (4) - 17 freq amrut (4) - 1 freq mirdit (4) - 1 freq robit (4) - 1 freq arbeit (4) - 1 freq monbiot (4) - 1 freq murnit (4) - 1 freq mort (4) - 3 freq marlit (4) - 1 freq moabite (4) - 1 freq marit (4) - 1 freq merkit (4) - 32 freq markit (4) - 18 freq mirkit (4) - 1 freq emergit (4) - 1 freq mournit (4) - 1 freq moorit (4) - 8 freq merrit (4) - 6 freq margit (4) - 32 freq sorbet (4) - 2 freq marrit (4) - 1 freq abortit (4) - 2 freq |
SoundEx code - A561 amorphous - 2 freq amyrobyn - 1 freq amorbit - 1 freq anneroberts - 1 freq |
MetaPhone code - AMRBT amorbit - 1 freq |
AMORBIT |
| Time to execute Levenshtein function - 0.240967 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.401649 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.030763 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.050792 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.001248 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. |