3 ms·

I wonder if this could be used to reveal text that is too small or out of focus. Also the example seems to go through one letter at a time, once the pixels bec

• lucgommans 4y ago
  > once the pixels become larger it might be required to cycle through entire words. That's a clever idea for speeding up this process actually. Instead of guessing a-z for every position, only guess valid word completions. If it doesn't end up giving a good score or the human judges it to be nonsensical, it can fall back to a-z guessing for that word. A bit similar to my hangman solver (https://lucgommans.nl/p/hangman-solver/ https://lucgommans.nl/p/hangman-solver/), which looks for the only words still possible with the given letters already known, but simpler because you only need prefix matching. I know you meant it for very strong blurs, and there it is not actually an advantage because you need to go through thousands of words before guessing one (instead of 26×5≃130 guesses, assuming an average word length of ~5), but yeah there you'd have no other choice.