Skip to content

Code written by Sam Ross and Matt Farrugia for the University of Melbourne subject COMP20007, Design of Algorithms. Contains solution for the second assignment, which was to create a spelling corrector that suggests corrections based upon Levenshtein edit-distance and frequency of words within the language.

Notifications You must be signed in to change notification settings

sam-ross2048/spell-corrector

Repository files navigation

Compilation Instructions:

  1. Download all files.
  2. Using the terminal, access directory where files have been saved.
  3. Type 'make' on the command line.
  4. Once compiled successfully, use "./a2 spell words-1M.txt < jabberwocky.txt" to run the program.

Both "words-1M.txt" and "jabberwocky.txt" can be replaced with any text file containing a dictionary or list of words so long as both files have been formatted such that there is one word per line within the files and all the words are lowercase.

Bonus algorithmic analysis of the spell corrector contained in PDF.

About

Code written by Sam Ross and Matt Farrugia for the University of Melbourne subject COMP20007, Design of Algorithms. Contains solution for the second assignment, which was to create a spelling corrector that suggests corrections based upon Levenshtein edit-distance and frequency of words within the language.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published