[Solved]Due April 14 2019 11 59pm Homophone One Two Words Pronounced Alike Myhashmap Interface Fin Q37200924
JAVA Programming
ASAP
Due April 14 2019 11:59pm A homophone is one of two or more words that are pronounced alike but are MyHashMap interface to find the most words that has the same homophones. dictionary downloaded from http://www.speech.cs.cmu.edu/cgi-bin/cmudict different in meaning or spelling; for example, the words “two”, “too”, and “to” Write a Java program that uses the unordered array list implementation of the The file “cmudict.0.7a.txt” in common/DICTIONARIES contains a pronunciation The page also contains a detailed description of the pronunciation dictionary. The file consists of lines of the form ABUNDANT AHO B AHI N D AHO N T The first string is the word, which is followed by one or more phonemes (or phones) that describe the pronunciation of the word. There are 39 phonemes occurring in North American English that are used in the dictionary. The collection of 39 symbols is known as the Arpabet, for the Advanced Research Projects Agency (ARPA), which developed it in the 1970’s in connection with research on speech understanding. Call your program MostHomophones. The output is a first line containing a single integer n, which is the largest number of homophones. The n homophones follow on the next n lines, one word per line. Exercise. Considering only the MyHashMap operations insert, remove, and find, give the worst-case total running time and a sequence of n operations that have that running time if MyHashMap is implemented as: (1) an unordered array list; (2) an unordered linked list; (3) an ordered array list. Call your program MostHomophones. The output is a first line containing a single integer n, which is the largest number of homophones. The n homophones follow on the next n lines, one word per line Exercise Considering only the MyHashMap operations insert, remove, and find, give the worst-case total running time and a sequence of n operations that have that running time if MyHashMap is implemented as: (1) an unordered array list (2) an unordered linked list; (3) an ordered array list. State any assumptions you make on the implementation Submission: 1) You code for the project (40 points) 2) Your analysis of the Big0 in the Exercise part. (10 points) Show transcribed image text Due April 14 2019 11:59pm A homophone is one of two or more words that are pronounced alike but are MyHashMap interface to find the most words that has the same homophones. dictionary downloaded from http://www.speech.cs.cmu.edu/cgi-bin/cmudict different in meaning or spelling; for example, the words “two”, “too”, and “to” Write a Java program that uses the unordered array list implementation of the The file “cmudict.0.7a.txt” in common/DICTIONARIES contains a pronunciation The page also contains a detailed description of the pronunciation dictionary. The file consists of lines of the form ABUNDANT AHO B AHI N D AHO N T The first string is the word, which is followed by one or more phonemes (or phones) that describe the pronunciation of the word. There are 39 phonemes occurring in North American English that are used in the dictionary. The collection of 39 symbols is known as the Arpabet, for the Advanced Research Projects Agency (ARPA), which developed it in the 1970’s in connection with research on speech understanding. Call your program MostHomophones. The output is a first line containing a single integer n, which is the largest number of homophones. The n homophones follow on the next n lines, one word per line. Exercise. Considering only the MyHashMap operations insert, remove, and find, give the worst-case total running time and a sequence of n operations that have that running time if MyHashMap is implemented as: (1) an unordered array list; (2) an unordered linked list; (3) an ordered array list.
Call your program MostHomophones. The output is a first line containing a single integer n, which is the largest number of homophones. The n homophones follow on the next n lines, one word per line Exercise Considering only the MyHashMap operations insert, remove, and find, give the worst-case total running time and a sequence of n operations that have that running time if MyHashMap is implemented as: (1) an unordered array list (2) an unordered linked list; (3) an ordered array list. State any assumptions you make on the implementation Submission: 1) You code for the project (40 points) 2) Your analysis of the Big0 in the Exercise part. (10 points)
Expert Answer
Answer to Due April 14 2019 11:59pm A homophone is one of two or more words that are pronounced alike but are MyHashMap interface … . . .
OR
