In this assignment, you will write a program that performs spell checking on input strings

taken from the user. At start, your program should take a txt file as the command$-$line argument:

a file containing the dictionary.

Your program should read the dictionary, and build a Trie$-$based index for it$,$ as we

discussed in the class. Then it will wait input strings from user. For each input string given, it

performs a search for the string on the trie. If it is misspelled, the program should print

"misspelled?" and then suggest three alternatives $($or less than three if there are not enough

prefix matching words$),$ with the longest matching prefixes. Otherwise, it prints "correct word".

Your implementation should work in constant time $($or linear time with respect to

number of characters of the string given as input$).$

INPUT FORMAT

Your program should read the

given dictionary.txt file with the

format:

OUTPUT FORMAT

Sample run of the program using the dictionary file given on the

left: Remarks

The main function in assignment should take $1$ command line argument, the

name of dictionary file. Then it should wait for a string input from the user.

You can test your implementation on the given sample dictionary file or using

some part of it$.$ Also, you can test on different files to be sure that your

program also works for different dictionaries.

Your implementation will be tested on different dictionaries having

thousands or more words. Your implementation should work in constant

time $($or linear time with respect to number of characters of the string given$),$

otherwise you will get no credits.

For this assignment, you ARE ALLOWED to use the codes given in our

textbook and$/$or our lecture slides. You ARE NOT ALLOWED to use any codes

from somewhere else $($e$.$g$.,$ from the internet, other textbooks, other slides

$...).$ You ARE NOT ALLOWED to use external libraries including our textbook.n this assignment, you will write a program that performs spell checking on input strings

taken from the user. At start, your program should take a txt file as the command$-$line argument:

a file containing the dictionary.

Your program should read the dictionary, and build a Trie$-$based index for it$,$ as we

discussed in the class. Then it will wait input strings from user. For each input string given, it

performs a search for the string on the trie. If it is misspelled, the program should print

$$misspelled$?$ and then suggest three alternatives $($or less than three if there are not enough

prefix matching words$),$ with the longest matching prefixes. Otherwise, it prints $$correct word$.$

Your implementation should work in constant time $($or linear time with respect to

number of characters of the string given as input$).$

INPUT FORMAT

Your program should read the

given dictionary.txt file with the

format:

ABACUS

ABANDON

ABANDONED

ABBREVIATE

ABILITY

ABLE

ABOUND

ABOUT

ABOVE

ABRACADABRA

ABSENCE

ABSENT

$...$

OUTPUT FORMAT

Sample run of the program using the dictionary file given on the

left:

input $->$ java spellcheck.java dictionary.txt

input $->$ able

output $->$ correct word

input $->$ abo

output $->$ misspelled? abound, about, above

input $->$ absenn

output $->$ misspelled? absence$,$ absent$,$ abacus

Remarks

$$ The main function in assignment should take $1$ command line argument, the

name of dictionary file. Then it should wait for a string input from the user.

$$ You can test your implementation on the given sample dictionary file or using

some part of it$.$ Also, you can test on different files to be sure that your

program also works for different dictionaries.

$$ Your implementation will be tested on different dictionaries having

thousands or more words. Your implementation should work in constant

time $($or linear time with respect to number of characters of the string given$),$

otherwise you will get no credits.

$$ For this assignment, you ARE ALLOWED to use the codes given in our

textbook and$/$or our lecture slides. You ARE NOT ALLOWED to use any codes

from somewhere else $($e$.$g$.,$ from the internet, other textbooks, other slides

$...).$ You ARE NOT ALLOWED to use external libraries including our textbook.