harshildarji/Reber-Grammar

A Reber sequence is a grammar string made of finite states, in simple words, formed by using a confined set of characters. In the research paper that proposed the LSTM, the authors use embedded Reber grammar due to its short time lags.

Here is the chapter from my Master's thesis that briefly explains the dataset, and also includes various plots about its statistics.

Data visualiations available at about_reber.

Master's thesis: Investigating Sparsity in Recurrent Neural Networks

@article{darji2024investigating,
  title={Investigating Sparsity in Recurrent Neural Networks},
  author={Darji, Harshil},
  journal={arXiv preprint arXiv:2407.20601},
  year={2024}
}