| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inwards (0) - 7 freq inwairds (1) - 1 freq innards (1) - 4 freq onwards (1) - 19 freq inward (1) - 7 freq atwards (2) - 3 freq ainward (2) - 4 freq awards (2) - 35 freq onward (2) - 5 freq upwards (2) - 11 freq tawards (2) - 7 freq cowards (2) - 5 freq innarts (2) - 1 freq edwards (2) - 5 freq inwart (2) - 1 freq inwardly (2) - 1 freq towards (2) - 161 freq onwarts (2) - 1 freq i'words (2) - 2 freq tiwards (2) - 3 freq inhauds (2) - 3 freq an'ards (2) - 1 freq wards (2) - 30 freq fitwards (2) - 1 freq rewards (2) - 6 freq |
inwards (0) - 7 freq inwairds (1) - 1 freq onwards (1) - 19 freq inward (2) - 7 freq innards (2) - 4 freq i'words (3) - 2 freq towards (3) - 161 freq inwardly (3) - 1 freq tiwards (3) - 3 freq rewards (3) - 6 freq edwards (3) - 5 freq wards (3) - 30 freq an'ards (3) - 1 freq onwarts (3) - 1 freq onward (3) - 5 freq awards (3) - 35 freq atwards (3) - 3 freq upwards (3) - 11 freq ainward (3) - 4 freq cowards (3) - 5 freq tawards (3) - 7 freq waards (4) - 1 freq unawares (4) - 5 freq upwords (4) - 1 freq oanward (4) - 1 freq |
SoundEx code - I563 innerdaeks - 1 freq innarts - 1 freq immortal - 19 freq inherited - 8 freq immortals - 2 freq inheritit - 3 freq inheritance - 11 freq inheritin - 2 freq inheritaunce - 1 freq inherit - 7 freq innards - 4 freq immortality - 5 freq inward - 7 freq inwardly - 1 freq inheritors - 1 freq inherieted - 1 freq i'north - 1 freq inheritence - 2 freq inwards - 7 freq immortalitie - 1 freq inroads - 4 freq immortalised - 1 freq inarticulate - 1 freq inwairds - 1 freq inert - 3 freq inordinate - 1 freq inwartly - 1 freq inwart - 1 freq inertia - 1 freq iainheard - 1 freq iainrwhite - 1 freq |
MetaPhone code - INWRTS inwards - 7 freq inwairds - 1 freq |
INWARDS |
| Time to execute Levenshtein function - 0.173190 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.326089 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.026991 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.036749 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.000875 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. |