Posted: September 23rd, 2022

Working with Dictionaries

IT 279
Fall, 2022
Califf
Programming Project 2:
Working with Dictionaries
Due date for Half 1: Monday, September 26, 2022 at 11:55 pm
Due date for Half 2: Wednesday, October 5, 2022 at 11:55 pm
Do not forget that that is a person project. Don’t talk about with your classmates (or
others) and don’t seek for code on the internet. You might be inspired to come back to me for
Help.
Description:
You might be creating a C++ program that does spell checking on a textual content file. This system
will take three command line parameters that are names for:
1) a file with a listing of appropriately spelled phrases
2) a textual content file to verify
three) an output file for the construction of the dictionary (not related to the duty, however
necessary for grading your information construction accuracy).
This system will first construct a dictionary from the thesaurus. Then it should verify the file,
printing details about every misspelled phrase and recommendations for potential corrections
to plain output. Lastly, it should print the dictionary construction to the required output
file.
Format of spelling output
For every misspelled phrase print the phrase and the road it was discovered on adopted by
details about the recommendations discovered, adopted by a clean line. Examples:
saed on line 5
Prompt corrections:
saved
unhappy
remirmand on line 6
No recommendations discovered
Notice that the primary line of the file is line 1, not line zero. We would like this output to be humanpleasant, and most people begin counting at 1, slightly than zero. Use tabs for the indentation
of the urged phrases.
Find out how to generate recommendations
As urged corrections, checklist any phrases within the dictionary which can be obtainable by making use of
any of the next guidelines (one after the other):
1. Add one letter to the phrase (at any place)
2. Take away one letter from the phrase
three. Change adjoining characters
There is a chance to earn additional credit score by thoughtfully increasing the suggestion checklist.
See under.
You’ll be beginning with a partial program, which features a dictionary, applied as
a primary binary search tree and the framework of the particular program spell checking
program.
You’ll be filling within the a part of this system that reads the thesaurus and construct the
dictionary in addition to the half that does the precise spell checking.
Then additionally, you will be modifying the dictionary to be an AVL tree implementation. Notice
that your e-book does have some helpful reference code that will help you get began with the
AVL tree conversion.
For half 1, you’ll submit your program file and your AVL tree implementation, based mostly
on the binary search tree implementation you got. This system you submit should
work with both your Dictionary implementation or the offered Dictionary with NO
adjustments in anyway. If this system doesn’t compile with both Dictionary model, it
will probably be thought-about a compile-time error (computerized F).
For half 2, you’ll create a brand new Dictionary with the very same interface (i.e. the identical
public operate signatures) however applied as a hash desk utilizing double hashing to
deal with collisions. You’ll submit your program with that Dictionary. This system should
nonetheless work with each the unique Dictionary and your hash desk with no modifications. If
your AVL tree had points and you’ve got fastened it for an improved grade, you may additionally
resubmit the AVL model of the Dictionary.
Simplifying Assumptions:
▪ We don’t care about case; convert every part to decrease case when studying from all
recordsdata.
▪ Phrases are strings of letters (a-z). Deal with every part that isn’t a letter as breaking
up phrases. Notice that this implies you might have a number of ”phrases” on a single line in
your thesaurus – each must be entered within the dictionary. It additionally signifies that you
might have duplicates in your thesaurus, which have to be appropriately dealt with.
▪ Every line ends with a newline character.
▪ All recordsdata are in the identical listing as this system.
Beginning and pattern recordsdata:
You can see Dictionary.h, Dictionary.cpp, and startingSpellChecker.cpp in
/dwelling/advert.ilstu.edu/mecalif/it279/Program3. Be sure you learn them rigorously, together with
all feedback and perceive how the code works. You’ll be including code to all of those
recordsdata. You shouldn’t be eradicating something from any recordsdata for half 1. For part2, you’ll
largely substitute the contents of the Dictionary recordsdata, however just remember to don’t modify
the prototypes/headers of the general public strategies, and that you don’t take away or add any
public strategies.
Additionally, you will discover a set of .txt recordsdata. I’ve offered dictionary recordsdata in a number of sizes
alongside with test1.txt, a file with a number of misspellings.
You could have been given a easy take a look at program (test_dictionary.cpp) alongside with appropriate
output for the BST you got in addition to the AVL and hash desk variations you’ll
be creating.
I’ve additionally offered pattern output from the spellchecker program. Notice that the
dictionary construction output can be utilized to find out whether or not you might be producing an accurate
AVL tree. The hash desk model of the dictionary construction output can be utilized to
study your hash desk. Along with the usual output recordsdata, I’ve offered output
from printing the dictionary to ensure that every dictionary with the intention to verify these with
a separate little program. Notice that the output from that won’t fluctuate from one
implementation to a different.
Hash desk particulars:
You’ll use double hashing. The prime numbers that you’ll use on your hash desk
sizes are . The prime numbers on your double hashing will probably be 97, 199, 421,
859, 1723, 3467, 6917, 13883, 27799, 55603, 111217, 222437, 444901, 889829.
Use the hash operate from determine 5.four in your textbook.
Rehash instantly earlier than including an entry that can push the desk above 50% full.
Further Credit score Alternative:
A and B applications might earn a small quantity of additional credit score for enhancing on the
algorithm to generate urged corrections. Requirement for additional credit score:
1) You could point out within the textbox in your ReggieNet submission that you’ve got
finished the additional credit score and you will need to clarify how you might be producing extra
urged phrases and point out which dictionary file to make use of on your pattern
enter/output demonstrating your work.
2) You could have an optionally available four
th command line parameter. If the 4th parameter is
offered (regardless of the contents of it), then your program will generate the
extra recommendations. If there isn’t any 4th command line parameter, this system
should stick with the required recommendations.
three) You could present an enter file and pattern output that demonstrates your
extra recommendations. Please attempt to use pattern enter that does not generate many
recommendations outdoors of your additional credit score modifications. It will Help in assessing
how efficient your additions had been.
four) The additions have to be considerate. An “enchancment” that merely generates a
large variety of recommendations with out regard to whether or not they may make sense
is not going to achieve extra credit score.
Submission necessities:
If you use them, all variations of the dictionary have to be in recordsdata named Dictionary.h
and Dictionary.cpp. Nonetheless, we have to separate them out for submission. So your
AVL tree will probably be submitted as AVL_Dictionary.h and AVL_Dictionary.cpp. Your hash
desk will probably be submitted as Hash_Dictionary.h and Hash_Dictionary.cpp. The grading
course of will rename your recordsdata earlier than compiling.
Do not forget that your program file should work with the unique Dictionary recordsdata as
submitted. Submit a single zip containing solely the supply code recordsdata (no folders, no information
recordsdata, no executables, no take a look at recordsdata, not even any makefiles for this) and your pattern take a look at
and output recordsdata if doing additional credit score.
A validation script will probably be offered that can aid you decide whether or not your
submission zip file is appropriate. It’s your accountability to make it possible for your program
compiles efficiently while you give the validation script your zip file. The validation
script will NOT take a look at your code for you; it should solely be certain your program compiles.
Failure to submit your program in accordance with directions will end in a grade
discount.
Grading Requirements:
Applications will probably be graded in accordance with the offered Program Grading Standards.
Half 1 will probably be 40% of the grade and Half 2 will probably be 60% of the grade. Should you appropriate points
with half 1 when submitting half 2, you’ll obtain half of the distinction between the
authentic grade for half 1 and the grade that a part of program would earn with the
corrections.

Order | Check Discount

Tags: Working with Dictionaries