consider using turbowarp to make it faster: https://turbowarp.org/1352524612 normal version: https://turbowarp.org/1352506756 okay so to use this first you use the normal version https://scratch.mit.edu/projects/1352506756/ then you do the thing where you copy the result which looks something like this: HELLO, HELLOS, HELLOES, HELLOED, HELLOING, CELLO, HELLS, HALLO, HOLLO, JELLO, HULLO, HELIO then you put it into this one and for each item in the result list, it's the most common letter in that position. so if you read the first letter in each list item you get the prediction on what the word used to produce that output was
