Packed Forest Chart Parser
Qi Haoliang, Li Sheng, Yang Muyun & Zhao Tiejun
Journal of Computer Science, Volume 3, Issue 1, pp. 9–13 · doi.org/10.3844/jcssp.2007.9.13
Abstract
Packed forest chart parser, like the traditional chart parsing algorithm, uses charts to store all the information produced while parsing to avoid redundant works. Its advantage over the traditional chart parser was the packed forest representation. The algorithm not only shares the non-terminal categories as what was done in the shared parse forest, but also shares the leftmost common elements. The number of active edges in packed forest chart parser was decreased, so memory requirement was reduced and parsing was speeded up. The effectiveness of our approach has been evaluated on Chinese parsing. Results show that packed forest chart parser significantly outperforms packed chart parser, with the former 10 times faster than the latter.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2007 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Haoliang, Q., Sheng, L., Muyun, Y. & Tiejun, Z. (2007). Packed Forest Chart Parser. Journal of Computer Science, 3(1), 9–13. https://doi.org/10.3844/jcssp.2007.9.13
- Licence
- © Science Publications
- Issue
- Volume 3, Issue 1
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
