SPPF

SPPF - shared packed parse forest.

Concept introduced by Masaru Tomita in “Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems”. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1985

See:

• Lark parser: SPPF ↗
• Masaru Tomita. 1987. An efficient augmented-context-free parsing algorithm. ↗ Comput. Linguist. 13, 1–2 (January-June 1987), 31–46.
• Sylvie Billot and Bernard Lang. 1989. The Structure of Shared Forests in Ambiguous Parsing ↗. In 27th Annual Meeting of the Association for Computational Linguistics, pages 143–151, Vancouver, British Columbia, Canada. Association for Computational Linguistics
• Lang, B. 1991. Towards a Uniform Formal Framework for Parsing. ↗ In: Tomita, M. (eds) Current Issues in Parsing Technology. The Springer International Series in Engineering and Computer Science, vol 126. Springer, Boston, MA.
• Parse forest disambiguation, 2014 ↗, van der Sanden, L.J.