When Are Tree Structures Necessary for Deep Learning of Representations?
Jiwei Li Affiliation: Computer Science Department, Stanford University, Stanford, CA 94305 Minh-Thang Luong Affiliation: Computer Science Department, Stanford University, Stanford, CA 94305 Dan Jurafsky Affiliation: Computer Science Department, Stanford University, Stanford, CA 94305 Eduard Hovy Affiliation: Language Technology Institute, Carnegie Mellon University, Pittsburgh, PA
Abstract
Recursive neural models, which use syntactic parse trees to recursively generate representations bottom-up, are a popular architecture. But there have not been rigorous evaluations showing for exactly which tasks this syntax-based method is appropriate. In this paper we benchmark recursive neural models against sequential recurrent neural models (simple recurrent and LSTM models), enforcing apples-to-apples comparison as much as possible. We investigate 4 tasks: (1) sentiment classification at the sentence level and phrase level; (2) matching questions to answer-phrases; (3) discourse parsing; (4) semantic relation extraction (e.g., component-whole between nouns).
原文 arXiv:1503.00185;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1503.00185v5