Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Discriminative Neural Sentence Modeling by Tree-Based Convolution (1504.01106v5)

Published 5 Apr 2015 in cs.CL, cs.LG, and cs.NE

Abstract: This paper proposes a tree-based convolutional neural network (TBCNN) for discriminative sentence modeling. Our models leverage either constituency trees or dependency trees of sentences. The tree-based convolution process extracts sentences' structural features, and these features are aggregated by max pooling. Such architecture allows short propagation paths between the output layer and underlying feature detectors, which enables effective structural feature learning and extraction. We evaluate our models on two tasks: sentiment analysis and question classification. In both experiments, TBCNN outperforms previous state-of-the-art results, including existing neural networks and dedicated feature/rule engineering. We also make efforts to visualize the tree-based convolution process, shedding light on how our models work.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Lili Mou (79 papers)
  2. Hao Peng (291 papers)
  3. Ge Li (213 papers)
  4. Yan Xu (258 papers)
  5. Lu Zhang (373 papers)
  6. Zhi Jin (160 papers)
Citations (8)