As discussed in Section 3.1, λ-expressions are represented as packed λ-meaning forests.
in this work, we make use of a bottom-up dynamic programming chart-parsing algorithm that works directly on translating forest nodes into target natural language words.