Learning Directly from Grammar Compressed Text
By: Researcher
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
Please contact us in case of a broken link from here
| Authors | Takanori Maehara, Yoichi Sasaki, Kosuke Akimoto |
| Journal/Conference Name | arXiv preprint |
| Paper Category | Artificial Intelligence |
| Paper Abstract | Neural networks using numerous text data have been successfully applied to a variety of tasks. While massive text data is usually compressed using techniques such as grammar compression, almost all of the previous machine learning methods assume already decompressed sequence data as their input. In this paper, we propose a method to directly apply neural sequence models to text data compressed with grammar compression algorithms without decompression. To encode the unique symbols that appear in compression rules, we introduce composer modules to incrementally encode the symbols into vector representations. Through experiments on real datasets, we empirically showed that the proposal model can achieve both memory and computational efficiency while maintaining moderate performance. |
| Date of publication | 2020 |
| Code Programming Language | Python |
| Comment |
Copyright Researcher 2022