Hacker News Reader

Machine learning is not magic -- no algorithm, machine learning or otherwise, will be able to treat an arbitrary-length sequence in constant time.

The actual problem is also more complex than fixed word widths due to hyphenation and justification - from what I recall, Knuth's paper (IIRC there's two and the second one is the one to read) on TeX's layout gives a good overview of the problem and an algorithm that's still state of the art. I think the Typst people might have a blog post about their modern take on it, but I'm not sure.

See https://docs.google.com/document/d/1jJFD8nAUuiUX6ArFZQqQo8yT...

Could it be linear time? I thought larger inputs take longer for models to process. I suppose it depends on the length of each line and the number of lines.

It can't be linear time. At best it would be log(n) but that would require storing all the possible inputs in a lookup table.