def process_word(word):
remove = '.!?,"\'()*_:;0123456789'
stripped_word = word.strip(remove)
processed_word = stripped_word.replace("'", "")
return processed_word.lower()
def process_line(line):
line = line.replace("-", " ")
words = line.split()
processed_words = []
for word in words:
processed_word = process_word(word)
if len(processed_word) > 0:
processed_words.append(processed_word)
return processed_words
def process_file(path):
with open(path, "r") as f:
lines = f.readlines()
words = []
for line in lines:
processed_words = process_line(line)
words += processed_words
return words
Def find_unique(words):
Unique = list()
For word in words:
If word not in unique:
Unique.append(word)
return unique
find_frequency()
This function should accept a single parameter named words. This parameter is expected to contain a list of strings representing words. The function should create a dictionary recording the number of times each individual word appears in words. Each dictionary key should be a string representing a word, and each value should be a count representing the number of times that string appeared in words.
1. Create an empty dictionary named freq_dict to store the counts.
2. Loop over the elements of words. If a particular element has already been added to freq_dict as a key then increment the value associated with that key. If the element does not appear as a key in freq_dict, then add it as a key with a value of 1.
The function should return the dictionary freq_dict.
sectsectetur adipisectetur a
sectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, congue
sectetur adipiscing elit. Nam
Unlock access to this and over
10,000 step-by-step explanations
Have an account? Log In
sectetur adipiscing elit. Nam lacinia pulvsectetur adisectetur adipiscing elit. Nam lacisectetur adipisectetur adipiscing elit. Nam lacinia pulvinar tortor nec fa
sectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna. Fusce dui lectus, congue vel laoreet ac, dictum vitae odio. Donec aliquet. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, dapibus a molestie consequat, ultrices ac magna.
sectetur adipiscing elit. Nam lacinisectetur adsectetur adipiscing elit. Nam lacisectetur adisectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibusectetur adipisectetur adipiscing elit. Nam lacinia pulvinar tortor nsectetursectetur adipiscing elit. Nam lacinia pulvinar tort
sectetur adipiscing
sectetur adipiscing elit. Nam lacinia pulvinar tortor nec facilisis. Pellentesque dapibus efficitur laoreet. Nam risus ante, d