A Datalog Recognizer for Almost Affine λ-CFGs

摘要: The recent emergence of linguistic formalisms exclusively based on the simply-typed λ-calculus to represent both syntax and semantics led presentation innovative techniques which apply problems parsing generating natural languages. A common feature these consists in using strong relations between typing properties syntactic structures families λ-terms. Among significant results, an efficient algorithm Datalog programming is presented [Kan07] for context-free grammar almost linear λ-terms, are λ-terms augmented with a restricted form copy. We present extension this method terms deletion allowed.