论文标题
Traguntun des Grammairecatégoriellesde lambek dans les les lescatégoriellesAbstraites
Traduction des Grammaires Catégorielles de Lambek dans les Grammaires Catégorielles Abstraites
论文作者
论文摘要
Lambek语法（LG）是基于非共同组成类型的自然语言的计算建模。它已经进行了广泛的研究，特别是对于语法扮演着重要角色（例如英语）的语言。这份实习报告的目的是证明，每个Lambek语法都可以完全不完全而有效地在抽象类别语法（ACG）中表达。后者是一种基于高阶签名同态（使用$λ$ -Calculus）的新型建模，旨在团结当前使用的模型。主要的想法是通过擦除介绍和消除规则并生成足够的公理，以使剪切规则足够足够，将LGS的类型重写系统转换为无上下文语法（CFG）。这种迭代方法保留了派生，并使我们能够在任何步骤停止可能的无限生成过程。尽管基本算法尚未完全实施，但该证明提供了另一个有利于ACG在自然语言处理中的相关性的论点。
Lambek Grammars (LG) are a computational modelling of natural language, based on non-commutative compositional types. It has been widely studied, especially for languages where the syntax plays a major role (like English). The goal of this internship report is to demonstrate that every Lambek Grammar can be, not entirely but efficiently, expressed in Abstract Categorial Grammars (ACG). The latter is a novel modelling based on higher-order signature homomorphisms (using $λ$-calculus), aiming at uniting the currently used models. The main idea is to transform the type rewriting system of LGs into that of Context-Free Grammars (CFG) by erasing introduction and elimination rules and generating enough axioms so that the cut rule suffices. This iterative approach preserves the derivations and enables us to stop the possible infinite generative process at any step. Although the underlying algorithm was not fully implemented, this proof provides another argument in favour of the relevance of ACGs in Natural Language Processing.
