Rational Recurrences

  title={Rational Recurrences},
  author={Hao Peng and Roy Schwartz and Sam Thomson and Noah A. Smith},
Despite the tremendous empirical success of neural models in natural language processing, many of them lack the strong intuitions that accompany classical machine learning approaches. Recently, connections have been shown between convolutional neural networks (CNNs) and weighted finite state automata (WFSAs), leading to new interpretations and insights. In this work, we show that some recurrent neural networks also share this connection to WFSAs. We characterize this connection formally… CONTINUE READING
This paper has been referenced on Twitter 69 times. VIEW TWEETS


Publications referenced by this paper.

Similar Papers

Loading similar papers…