Abstract

We present two algorithms that construct a context-free grammar for a given text. The first one is an improvement of Rytter's algorithm that constructs grammars using AVL trees. The second one follows a new approach and constructs grammars using Cartesian trees. Also we compare both algorithms and Rytter's algorithm on various data sets and provide a comparative analysis of the compression ratio achieved by these algorithms and by the LZ77 and LZW algorithms. Bibliography: 15 titles.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.