Sentence-State LSTM for Text Representation

Code

• github.com/leuchine/S-LSTM
  In papernone★ 0
• github.com/LahiruSen/S-LSTM_Sinhala
  none★ 0

Abstract

Bi-directional LSTMs are a powerful tool for text representation. On the other hand, they have been shown to suffer various limitations due to their sequential nature. We investigate an alternative LSTM structure for encoding text, which consists of a parallel state for each word. Recurrent steps are used to perform local and global information exchange between words simultaneously, rather than incremental reading of a sequence of words. Results on various classification and sequence labelling benchmarks show that the proposed model has strong representation power, giving highly competitive performances compared to stacked BiLSTM models with similar parameter numbers.

Tasks

Benchmark Results

Reproductions