That's intuitive. What isn't is how much harder it becomes with longer text. Imagine there is an abstract measure of "smartness" of your algorithm (that would i

That's intuitive. What isn't is how much harder it becomes with longer text. Imagine there is an abstract measure of "smartness" of your algorithm (that would intuitively have some relations to your model size, teaching sample size and so on). My question could be worded as "what is the asymptotic smartness complexity of the summarisation problem?" Btw, I'm not aware of existence of such a measure, which I take as a signal it's infeasible to formulate (or I'm just ignorant).