3 ms·
There was recently a Google result here[1] where they were able to summarise a paragraph into one sentence. It looked pretty convincing. How does your "excrucia
by lrem 10y ago
There was recently a Google result here[1] where they were able to summarise a paragraph into one sentence. It looked pretty convincing. How does your "excruciatingly impossible" stand when confronted with that? Were the paragraphs in that result particularly easy to summarise? Does the problem's difficulty grow super-linearly with length of the text? Is there something else in the way?
[1]: https://news.ycombinator.com/item?id=12353955 https://news.ycombinator.com/item?id=12353955
- daveguy 10y agoI would love to see that on some actual text (rather than published "samples"). I expect the more text it has to deal with the more unintelligible the result.
- lrem 10y agoThat'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).