Datasets:

harshildarji
/

Reber-Grammar

Modalities:

Formats:

Size:

ArXiv:

Libraries:

License:

Dataset card Viewer Files Files and versions Community

harshildarji commited on 17 days ago

Commit

ba16f7e

•

1 Parent(s): 432c749

Update README.md

Files changed (1) hide show

README.md +1 -1

README.md CHANGED Viewed

@@ -4,7 +4,7 @@ license: cc0-1.0
 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](https://dl.acm.org/doi/10.1162/neco.1997.9.8.1735), the authors use embedded Reber grammar due to its short time lags.
-[Here](https://drive.google.com/file/d/1ZFcCZsmC_2zMGuDG4X8GHYxKDpErfb4a/view) 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](https://www.kaggle.com/harshildarji/about-reber).**

 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](https://dl.acm.org/doi/10.1162/neco.1997.9.8.1735), the authors use embedded Reber grammar due to its short time lags.
+[Here](https://huggingface.co/datasets/harshildarji/Reber-Grammar/blob/main/dataset.pdf) 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](https://www.kaggle.com/harshildarji/about-reber).**