Pinho, M. S. [UNESP]Finamore, W. A. [UNESP]2022-04-282022-04-282001-01-01Data Compression Conference Proceedings, p. 513-.1068-0314http://hdl.handle.net/11449/219246A simple sequential algorithm that can compute a lower bound to the number of phrases produced by the optimal parsing procedure was developed and tested. Results were compared to the number of phrases produced by two versions of the LZ78: LZW and the algorithm ll-LZ78. Results show that the lower bound is close to the number of phrases of those versions.513engTrabalho apresentado em evento2-s2.0-0035007208