| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rental (0) - 9 freq dental (1) - 7 freq rentals (1) - 2 freq ental (1) - 1 freq mental (1) - 125 freq renay (2) - 1 freq petal (2) - 11 freq mintal (2) - 1 freq rents (2) - 11 freq entae (2) - 43 freq oriental (2) - 1 freq recital (2) - 1 freq mentul (2) - 2 freq rantan (2) - 1 freq central (2) - 130 freq reveal (2) - 21 freq rendall (2) - 2 freq pentar (2) - 1 freq rinnal (2) - 1 freq renton (2) - 4 freq renewal (2) - 4 freq rentit (2) - 6 freq retail (2) - 7 freq 'dental (2) - 1 freq sentral (2) - 1 freq |
rental (0) - 9 freq oriental (2) - 1 freq dental (2) - 7 freq mental (2) - 125 freq rentals (2) - 2 freq ental (2) - 1 freq rentit (3) - 6 freq renewal (3) - 4 freq retail (3) - 7 freq rinnal (3) - 1 freq renton (3) - 4 freq frontal (3) - 1 freq rented (3) - 5 freq genital (3) - 1 freq entel (3) - 3 freq parental (3) - 4 freq rentin (3) - 2 freq lentil (3) - 5 freq rents (3) - 11 freq mintal (3) - 1 freq recital (3) - 1 freq entail (3) - 3 freq mentul (3) - 2 freq rent (3) - 48 freq rantan (3) - 1 freq |
SoundEx code - R534 rental - 9 freq roondhole - 1 freq rantletree - 3 freq roundelay - 1 freq rendall - 2 freq run-deil - 1 freq roundalays - 1 freq randall - 7 freq randolph - 1 freq remotely - 3 freq ryanheatly - 1 freq rentals - 2 freq randlestoon - 2 freq |
MetaPhone code - RNTL rental - 9 freq roundelay - 1 freq rendall - 2 freq run-deil - 1 freq randall - 7 freq |
RENTAL |
| Time to execute Levenshtein function - 0.492275 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.890790 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.027207 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.071553 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.000908 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. |