Which Wedge-and-dash Drawing Correctly Represents The Chair Conformation Given Chegg

Lab 9: Sets in the Java Drove Framework For this calendar week's lab,...

Lab 9: Sets in the Java Collection Framework

For this week's lab, you lot will use two of the classes in the Java Drove Framework:HashSet andTreeSet. You will utilize these classes to implement a spell checker.

Fix Methods

this lab, you will demand to use some of the methods that are defined in the Set interface. Call up that if set is a Set, then the following methods are divers:

gear up.size() -- Returns the number of items in the ready.
set.add(item) -- Adds the particular to the fix, if information technology is not already there.
set.contains(particular) -- Cheque whether the set up contains the particular.
prepare.isEmpty() -- Check whether the prepare is empty.

Yous will also need to be able to traverse a prepare, using either an iterator or a for-each loop.

Reading a Lexicon

The file words.txt (in the lawmaking directory) contains a list of English words, with one give-and-take on each line. You will look up words in this listing to check whether they are correctly spelled. To make the list like shooting fish in a barrel to use, yous tin can shop the words in a set up. Since at that place is no need to have the words stored in social club, you lot can use aHashSet for maximum efficiency.

Use a Scanner to read the file. You can create scanner,filein, for reading from a file with a statement such equally:

filein = new Scanner

(new File("/classes/s09/cs225/words.txt"));

and that a file can exist candy, token by token, in a loop such as:

while (filein.hasNext()) {

String tk = filein.next();

process(tk); // exercise something with the token

}

(For the wordlist file, a token is simply a discussion.)

Start your main plan by reading the words from words.txt and storing them in aHashSet<Cord>. For the purposes of this program,convert all words to lower case before putting them in the set. To brand sure that you've read all the words, check the size of the set. (Information technology should be 72875.) Y'all could likewise employ the contains method to bank check for the presence of some common word in the gear up.

Checking the Words in a File

In one case you accept the listing of words in a ready, information technology's easy to read the words from a file and check whether each word is in the set. Start by letting the user select a file. You tin can either let the user type the name of the file or you lot can apply the following method:

/**

* Lets the user select an input file using a standard file

* choice dialog box. If the user cancels the dialog

* without selecting a file, the return value is null.

static File getInputFileNameFromUser() {

JFileChooser fileDialog = new JFileChooser();

fileDialog.setDialogTitle("Select File for Input");

int pick = fileDialog.showOpenDialog(null);

if (option != JFileChooser.APPROVE_OPTION)

return null;

else

return fileDialog.getSelectedFile();

}

Utilize a Scanner to read the words from the selected file. In order to skip over whatsoever non-letter characters in the file, you tin utilize the post-obit control just after creating the scanner (where in is the variable name for the scanner):

in.useDelimiter("[^a-zA-Z]+");

(In this argument, "[^a-zA-Z]+" is a regular expression that matches any sequence of one or more than not-letter characters. This essentially makes the scanner treat whatever non-letter of the alphabet the mode it would ordinarily treat a space.)

Y'all can then get through the file, read each word (converting it to lower case) and check whether the fix contains the discussion. At this point, simply print out whatsoever give-and-take that yous find that is not in the lexicon.

Providing a List of Possible Right Spellings

A spell checker shouldn't simply tell you what words are misspelled -- it should also requite you a listing of possible correct spellings for that give-and-take. Write method

static TreeSet corrections(Cord badWord, HashSet dictionary)

that creates and returns aTreeSet<String> containing variations onbadWord that are contained in the dictionary. In your main program, when you observe a word that is not in the prepare of legal words, pass that word to this method (forth with the fix). Have the return value and output any words that it contains; these are the suggested correct spellings of the misspelled word. Here, for example, is function of the output from a sample plan when it was run with the HTML source of this page as input:

html: (no suggestions)

cpsc: (no suggestions)

hashset: hash set

treeset: tree set up

cvs: cs, vs

isempty: is empty

href: ref

txt: tat, tet, text, tit, tot, tut

filein: file in

pre: are, ere, ire, ore, pare, pee, per, pie, poe, pore, prep, pres,

prey, pro, pry, pure, pyre, re

hasnext: has side by side

wordlist: word listing

getinputfilenamefromuser: (no suggestions)

jfilechooser: (no suggestions)

filedialog: file dialog

setdialogtitle: (no suggestions)

int: pismire, dint, hint, in, ina, inc, ind, ink, inn, ins, inti, into,

information technology, lint, mint, nit, pint, tint

Note that the program was written so that it volition not output the same misspelled discussion more than once. (This is done by keeping a set of misspelled words that have been output.) If thecorrections() method returns an empty set, the program outputs the message "(no suggestions)". Since the corrections are stored in a tree set, they are automatically printed out in alphabetical order with no repeats.

The possible corrections that the program considers are as follows:

• Delete whatsoever one of the letters from the misspelled discussion.

• Alter any letter in the misspelled give-and-take to any other letter of the alphabet.

• Insert any letter at any point in the misspelled discussion.

• Bandy any 2 neighboring characters in the misspelled word.

• Insert a space at any point in the misspelled word (and check that both of the words that are produced are in the dictionary)

For constructing the possible corrections, you volition accept to make extensive use of substrings. If w is a cord, thenwest.substring(0,i) is the string consisting of the offset i characters in west (not including the character in position i, which would be character numberi+1). Andw.substring(i) consists of the characters of w from position i through the end of the string. For example, ifch is a graphic symbol, so y'all can alter thei-th character of w to ch with the statement:

String s = w.substring(0,i) + ch + due west.substring(i+1);

As well, you will find it user-friendly to use afor loop in which the loop control variable is achar:

for (char ch = 'a'; ch <= 'z'; ch++) { ...

Reply & Explanation

Solved by verified expert

Rated Helpful

entesq

consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentes

ce dui lectus, congue vel laoreet air-conditioning, dictum vitae odio. Donec aliquet. Lorem ipsum exercise

rem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar torto

,ur laoreet. Nam risus ante, dapibus a molestie consx

Unlock full access to Course Hero

Explore over 16 million step-by-step answers from our library

Subscribe to view reply

Pace-by-footstep explanation

a. Fusce dui lec

dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortorconloneclac, dictumrisus sumiametiur licetm ipsum dolo,dictum vitae odio. Donec aliquet. Lorem ipsum dolorsua molestie consequat, ultrices ac magna. Fusce dui lectufng elit. Nia pulvinar tortor nesuac, dictusuec facconsectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque daconsectetur am ipslestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitatrimolestie consequat, ultrices ac magna. Fusce dui lectus,sutrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitaitur laoreeusce dui lectus, congue vel laoreet air conditioning, dsuinia pulvinar tortor nec facm ipsat, ultrices ac magna. Fusce dui lectus, congue vel laoreet air-conditioning, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetuuFusce dui lectus, congue vel laoreet air conditioning, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet,tring elit. Nam lacinia pulvinar tortor nec facilisis. Pellsucongue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consecteturac,lestie consequat, ucea molestie consequctum vitae odio. Donec aliquet. Lorem ipsum dair conditioning,dictum vimolestie consequa molestie conseqonecfacilisis. Pellentesque dapibusiaDonec al0s ante, dapibusicitur laoreet. Nam risus dues, dapibus a molestie consequat, ultrices ac magair conditioning,ur laoreet. Nam risus ante, dapibus auair-conditioning, dictum vitae odio. Donec afinia pulvinar tortor nec facac,ipsum dentm ipsum dolor sit down ametonecs a molestie consequat, ultrair-conditioning,ipsum dusceFusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit apulv, consectetur adipiscing elit. Nam lacinia pulvinar tortair conditioning,dictum 6ur laoreet. Nam risus ante, dapibus a molestie consec aliquet. Lorem ipsum dolor0congue vel l ametipsumec aliquet. Lorem ipsumuscfacilisis. Pellentesque dapibus due eastsuet, consectetur adipiscing elit. Nam lacinia pulinia pulvinar tortor nem ipsumiaor nec facilisis. Pellentesque dapibametone thousand ipsumum risus dues, dapibus a molestie consequat, ultrior nelametinia ponectesque dapor neamet, consectetur adipiscing elit. Nam ametongue velipsum dolorto. Donec aliquet. Lorem ipsum dolo,sum dolor sit amet, consectetur adipiscing elsuitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices air conditioning magnicDiallen0entesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie conse0cing elit. Nam lacinia pulvinar tortor nec facilisfctum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, cuitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrtrictum vitae odio. Donec aliicDac,onguecefficituriafficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna.usus dues, dapibus a molestie consequat, ultrices ac magna. Fusce duitris ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui 500air conditioning, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit aicDac,onguecefficituriafficitur laoreet. Nam risus dues, dapibus a molestie consequat, ultrices air conditioning magna.uac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur atriusce dui lectus, congue vel laoreet ac, dictum vitae odio. Doneair conditioning,ongueceac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit ametufficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, conguetrinec facilisis. Pellentesque dapibus efficitur laoreeticDiallenfentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie conse0rem ipfs a molestieair conditioning,amet, consectetur adipiscifdue south a molestieair-conditioning,fficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultricf, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consecteuitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrtring elit. Nam lacinia pulvinaor neo. Donec aliquet. Lorem ipsu