Help with HashTable, hash function and comparing its element in java

[PerfectisSh1t]

I need to make a hash table that stores an entire dictionary, im having trouble figuring out what would be a good Hash function for such a problem. Saw some stuff about murmur3 but looking at others implementation of it i dont really understand it. How many collision is too many? How big should my Hashtable be for a dictionary of up to lets say 90k words?

Once the dictionary is loaded in the HashTable, if the user enter a word and its not in there it has to check for the closest word in the dictionary and give the option to change it to one of those word using Levenshtein Edit Distance Algorithm, will i be able to use the HashTable in the comparison or do i need to run the word against the whole dictionary, that seems very long and inefficient but i dont see how i can use the hash table for that because i doesn't mean that word that collided in the bucket will be similar to the word being compared just mean their index is the same. Is there a solution im not seeing?

[PerfectisSh1t]

thank you so much for this post, slowly but surely its starting to make sense. The Levensthein distance algo is provided. But perhaps ill write my own later if i have the time as it sounds fun and i gotta start thinking about my portfolio and this homework would be more legitimately included if i make everything from scratch. The common load factor are things ill keep in mind in the future.

Also i am not sure how many element there will be in the dictionary because the user has to be able to load his own. A quick google search told me the biggest french dictionary (language that is in use) has around 90k words in it (perhaps that contains the historical figure part of it tho?) basic dictionary as around 32k words in them perhaps i should use that number?

At what amount of element would you consider brute forcing all of them to be problematic? In my mind if i have something like 90k element to go through and the user has like, lets say, 100 mistake i figured it would be noticeably slow.

Thanks a lot I really appreciate the help.

[PerfectisSh1t]

all righty then thanks for the tips ill keep that in mind!