1100
5 parallel universes ahead (lemmy.world)
submitted 2 years ago by to c/memes@lemmy.ml
162 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 2 points 2 years ago (1 child)

Getting several examples of every letter combination gets very hard very fast. Just lowercase, to get 5 examples of the letters before and after each letter is nearly 100k examples. You'd probably be better off doing some machine leaning shenanigans to simplify the process from training data.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 3 points 2 years ago* (last edited 2 years ago)

    I didn't say every letter combination. I said the ones you need. Letter combos that do not connect to each other aren't needed. Still though, you're right that machine learning is needed... the good news is it's already been done before, and the code is open source. StuffMadeHere on youtube already built a fully functional prototype that impressed if maybe didn't fool forgery experts. https://youtu.be/cQO2XTP7QDw

  • permalink
  • fedilink
  • source
  • parent