Parsing and Generation Based on Typed Lambda Calculus and Datalog

作为一种统一的方法来解析和生成，主要研究者以前开发了一种方法，减少识别问题的语法生成的查询评估的数据库中的查询条件。这适用于限制于“几乎线性”的非线性项的非线性项上的“上下文无关”文法。这种方法已被扩展到的情况下，输入不仅仅是一个单一的的双稳态项，但一组双稳态项表示的“确定性”的数据库。这使得减少的问题“产生交叉”的数据。

As a uniform approach to parsing and generation, the principal investigator had previously developed a method of reducing the recognition problem for grammars generating lambda-terms to query evaluation in Datalog. This applies to "context-free" grammars on lambda-terms restricted to "almost linear" lambda-terms. This method has been extended to the case where the input is not just a single lambda-term, but a set of lambda-terms represented by a "deterministic" database. This allows the reduction of the problem of "generation as intersection" to Datalog.