https://github.com/wwi2196/spell-checker-application
This Java application implements a spell-checker. It maintains a lexicon of words and provides a method to check the spelling of input strings against this lexicon. The program accounts for common misspellings by considering character swaps, insertions, deletions, and replacements.
https://github.com/wwi2196/spell-checker-application
Last synced: 3 months ago
JSON representation
This Java application implements a spell-checker. It maintains a lexicon of words and provides a method to check the spelling of input strings against this lexicon. The program accounts for common misspellings by considering character swaps, insertions, deletions, and replacements.
- Host: GitHub
- URL: https://github.com/wwi2196/spell-checker-application
- Owner: WWI2196
- License: mit
- Created: 2023-04-01T10:24:40.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2024-08-08T11:37:17.000Z (10 months ago)
- Last Synced: 2025-01-29T22:45:02.732Z (5 months ago)
- Language: Java
- Homepage:
- Size: 29.3 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.txt
Awesome Lists containing this project
README
# Spell-Checker Application
## Overview
This part of the assessment involves the implementation of a spell-checker application. The application stores a lexicon of words in a set and implements a method `spellChecker(a)` to perform spell checks on strings against the set of words.
## Functionalities
- `spellChecker(a)`: Checks the spelling of the string `a` against the lexicon `Y`. If `a` is in `Y`, it returns a list containing only `a`. Otherwise, it returns a list of words from `Y` that might be correct spellings of `a`.
## Error Handling
The program accounts for common misspellings by:
- Swapping adjacent characters in a word
- Inserting a single character between two adjacent characters
- Deleting a single character from a word
- Replacing a character in a word with another character