| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uterine (0) - 1 freq eterne (2) - 2 freq urine (2) - 2 freq sterile (2) - 3 freq uttering (2) - 1 freq utterin (2) - 3 freq trine (2) - 2 freq strive (3) - 8 freq alterin (3) - 2 freq tiring (3) - 1 freq teries (3) - 1 freq remine (3) - 2 freq steering (3) - 2 freq sternt (3) - 1 freq puerile (3) - 1 freq strind (3) - 1 freq twine (3) - 21 freq butherin' (3) - 1 freq thine (3) - 15 freq eerins (3) - 6 freq tierin (3) - 2 freq dorine (3) - 2 freq peerin (3) - 34 freq tine (3) - 4 freq butterin (3) - 2 freq |
uterine (0) - 1 freq trine (2) - 2 freq eterne (2) - 2 freq teirin (3) - 6 freq teerin (3) - 5 freq tern (3) - 1 freq tryne (3) - 5 freq turne (3) - 1 freq tarin (3) - 1 freq tyrone (3) - 6 freq tierin (3) - 2 freq tirin (3) - 4 freq urine (3) - 2 freq utterin (3) - 3 freq tearin (3) - 12 freq trone (3) - 6 freq trainie (4) - 3 freq storin (4) - 1 freq tyrian (4) - 1 freq steirin (4) - 16 freq trie (4) - 2 freq tooerin (4) - 1 freq ukraine (4) - 10 freq hyterin (4) - 3 freq lerne (4) - 1 freq |
SoundEx code - U365 uterine - 1 freq uttering - 1 freq utterance - 4 freq utterances - 2 freq utteran - 1 freq utterin - 3 freq u-turns - 1 freq u-turn - 1 freq |
MetaPhone code - UTRN uterine - 1 freq utteran - 1 freq utterin - 3 freq u-turn - 1 freq |
UTERINE |
| Time to execute Levenshtein function - 0.412948 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.614707 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.070443 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.097847 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.001271 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. |