| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| efterwurds (0) - 1 freq efterwards (1) - 17 freq efterwirds (1) - 3 freq efterwarts (2) - 1 freq efterward (2) - 9 freq eftirwards (2) - 2 freq efterword (2) - 2 freq afterwards (2) - 15 freq eftirwirds (2) - 1 freq efternuins (3) - 3 freq efternunes (3) - 1 freq aifterwards (3) - 3 freq efterwart (3) - 1 freq afterward (3) - 4 freq eftirwarts (3) - 2 freq efterburn (3) - 1 freq waterworks (4) - 3 freq efterninns (4) - 1 freq efternuin's (4) - 1 freq stewards (4) - 4 freq efterairt (4) - 1 freq efters (4) - 1 freq forwirds (4) - 1 freq efternune (4) - 4 freq furwirds (4) - 1 freq |
efterwurds (0) - 1 freq efterwirds (1) - 3 freq efterwards (1) - 17 freq eftirwirds (2) - 1 freq eftirwards (2) - 2 freq afterwards (2) - 15 freq aifterwards (3) - 3 freq efterword (3) - 2 freq efterwarts (3) - 1 freq efterward (3) - 9 freq afterward (4) - 4 freq eftirwarts (4) - 2 freq forwirds (5) - 1 freq forwards (5) - 5 freq furwirds (5) - 1 freq efterwart (5) - 1 freq fitwards (6) - 1 freq stewards (6) - 4 freq ferwerd (6) - 1 freq efterburn (6) - 1 freq efternunes (6) - 1 freq efternuins (6) - 3 freq waterworks (6) - 3 freq taewards (7) - 186 freq outwards (7) - 1 freq |
SoundEx code - E136 efter - 3150 freq efternoon - 58 freq efterhint - 1 freq efternuin - 60 freq eftir - 500 freq efternin - 12 freq efterwards - 17 freq efterwirds - 3 freq efter-time - 3 freq efterhand - 1 freq efter-dinner - 1 freq efterhin - 11 freq efterthocht - 6 freq efternuins - 3 freq efterneen - 69 freq efterhaun - 22 freq efter- - 1 freq efterhaund - 4 freq efterairt - 1 freq efter-shave - 1 freq efter't - 4 freq efterins - 1 freq eftirnuins - 2 freq eftirnuin - 2 freq eftirwards - 2 freq eftercast - 5 freq eftermath - 6 freq efterthowt - 2 freq efterward - 9 freq eftirstang - 1 freq eifter - 3 freq efterkin - 1 freq efterlife - 2 freq efteraw - 17 freq efterthoat - 1 freq efternune - 4 freq efternoons - 9 freq eftér - 16 freq eftirmath - 1 freq 'efter - 5 freq eftirnane's - 1 freq eftèr - 91 freq eftèrnuin - 1 freq eftirshave - 1 freq epidaurian - 1 freq eftyr - 1 freq eftirwirds - 1 freq efternön - 2 freq efiter - 1 freq eftirthocht - 2 freq eftirnoon - 5 freq eftèr-laureate - 1 freq eftèr-schuil - 1 freq eftirwarts - 2 freq eftirins - 3 freq eftirlins - 3 freq eftirneun - 1 freq eftershave - 2 freq eftirnune - 6 freq efternüne - 1 freq eftur - 1 freq efterburn - 1 freq efternane - 3 freq efterninns - 1 freq efterninn - 2 freq efter'll - 1 freq eftirnön - 1 freq efterhins - 9 freq efterneens - 1 freq efterword - 2 freq efternuin's - 1 freq €œefter - 5 freq efter-schuil - 1 freq efterstang - 1 freq efters - 1 freq eftir-cum - 1 freq efternunes - 1 freq eftercome - 1 freq efter-perfect - 1 freq efterwarts - 1 freq €˜efter - 1 freq efter-in-aa - 1 freq efterwurds - 1 freq efterwart - 1 freq efternain - 1 freq €œeftir - 1 freq €™efter - 1 freq eftrneen - 1 freq eftirnün - 1 freq |
MetaPhone code - EFTRWRTS efterwards - 17 freq efterwirds - 3 freq eftirwards - 2 freq eftirwirds - 1 freq eftirwarts - 2 freq efterwarts - 1 freq efterwurds - 1 freq |
EFTERWURDS |
| Time to execute Levenshtein function - 0.194425 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.541535 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.027420 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.037266 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.034002 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. |