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: | Ivan Katanic, Strahil Ristov, Martin Rosenzweig |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9154361/ |
Similar Items
-
Optimal Parsing for dictionary text compression
by: Langiu, Alessio
Published: (2012) -
Lake Symbols for Island Parsing
by: Chiba, S., et al.
Published: (2021) -
Approximate String Matching with Compressed Indexes
by: Pedro Morales, et al.
Published: (2009-09-01) -
Implementation of Tamias to Check Production Rules for Parsing Expression Grammar
by: Tetsuro Katayama, et al.
Published: (2019-09-01) -
Parsing the Dictionary of Modern Literary Russian Language with the Method of SCD Configurations. The Lexicographic Modeling
by: Neculai Curteanu, et al.
Published: (2012-05-01)