This is the HyperWebster. It's a dictionary that, in theory, contains every possible word that can be formed using normal English letters. Basically, it contains every word that's ever been created, or ever will be created. In order to navigate this dictionary, use the Up or Down arrow keys (to scroll up or down, obviously) and the space bar (to enter commands). GOTO {word that you want to jump to} JUMP {number of words that you want to jump past. Can be a negative value} AUTO {number of words you want to jump past per tick. Can also be a negative value} DAILY Important: Don't actually put the curly braces. Also, nothing in this project is case-sensitive. It just looks cooler to type in all caps. Using large values in the JUMP command will take longer. I suggest nothing bigger than 100,000 at a time. Ex: GOTO Arbiter Warps to a word of your choosing. The word will be displayed in the middle of the screen (fifth item). Ex: JUMP 420 Skips a given number of words. Ex: AUTO 1 Basically auto-scrolling. Ex: DAILY Shows the daily word at the top of the screen.
Here's some info on how this project works and what the HyperWebster actually is: - This dictionary is procedurally generated, which essentially means that only the word at the top of the list is the one who's data is currently being stored. This is great, because now the only way to reach Scratch's list cap would be to type the command "GOTO " followed by 200,000 Zs. I did this, and all it does is loop back around to 200,000 As. But how exactly does this project generate every word? Well, it all comes down to addition, subtraction, and A1Z26. Remember how I said that only the top word's data is being stored? When I say "data" I mean a sequence of values that are each 1-26. Each value corresponds to a letter of the alphabet. When you press the down or up arrows, the computer just adds or subtract 1 from the current sequence, or combination (as it's called in the project). Very simple, yet very efficient. - But what's the HyperWebster? The hyperwebster (or HyperWebster) is a theoretical list of all possible combinations of the twenty-six English letters. In the true version, each word is infinitely long. The interesting part is that if you were to erase any number of the first letters in any word, it would still contain all words, which ties into the Banach-Tarski paradox. However, such a thing is impossible. Infinity is a mathematical concept, not an actual factor in the universe. The closest we have to infinity is exponential sequences, which is exactly what this project is. If it makes you feel better, just imagine an infinite number of letters in front of each word. Fun Stuff: This project only uses 3 variables and 3 lists. There are more 7-letter words than people on Earth. Try looking for your username! You'll have to remove all numbers and symbols first, though. If you want, I'll add a note next to a word of your choosing. Only 1 per user, though. If you remove everything that isn't a letter, this dictionary also contains every English document. If you cover the first letter, then every group of words also contains the previous group! This is where the HyperWebster ties into the Banach-Tarski paradox. Yes, this contains all curse words.
