@article {10.3844/jcssp.2007.9.13,
article_type = {journal},
title = {Packed Forest Chart Parser},
author = {Haoliang, Qi and Sheng, Li and Muyun, Yang and Tiejun, Zhao},
volume = {3},
number = {1},
year = {2007},
month = {Jan},
pages = {9-13},
doi = {10.3844/jcssp.2007.9.13},
url = {https://thescipub.com/abstract/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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}