Text Summarization as Tree Transduction by Top-Down TreeLSTM

September 24, 2018 Β· Declared Dead Β· πŸ› IEEE Symposium Series on Computational Intelligence

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Davide Bacciu, Antonio Bruno arXiv ID 1809.09096 Category cs.IR: Information Retrieval Cross-listed cs.LG, cs.NE, stat.ML Citations 4 Venue IEEE Symposium Series on Computational Intelligence Last Checked 4 months ago
Abstract
Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by this, we introduce a deep neural model for learning structure-to-substructure tree transductions by extending the standard Long Short-Term Memory, considering the parent-child relationships in the structural recursion. The proposed model can achieve state of the art performance on sentence compression benchmarks, both in terms of accuracy and compression rate.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted