A Fast Algorithm for the Largest Area First Parsing of Real Strings
The largest area first parsing of a string often leads to the best results in grammar compression for a variety of input data. However, the fastest existing algorithm has Θ(N<sup>2</sup> log N) time complexity, which makes it impractical for real-life applications. We present...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9154361/ |