2020/01/23 by Valentin D. Richard, Richard, Valentin D.
Computer Science · #Natural Language Processing Techniques #Semantic Web and Ontologies #Topic Modeling
paper · pdf · doi:10.48550/arxiv.2002.00725
Lambek Grammars (LG) are a computational modelling of natural language, based\non non-commutative compositional types. It has been widely studied, especially\nfor languages where the syntax plays a major role (like English). The goal of\nthis internship report is to demonstrate that every Lambek Grammar can be, not\nentirely but efficiently, expressed in Abstract Categorial Grammars (ACG). The\nlatter is a novel modelling based on higher-order signature homomorphisms\n(using \λ-calculus), aiming at uniting the currently used models. The\nmain idea is to transform the type rewriting system of LGs into that of\nContext-Free Grammars (CFG) by erasing introduction and elimination rules and\ngenerating enough axioms so that the cut rule suffices. This iterative approach\npreserves the derivations and enables us to stop the possible infinite\ngenerative process at any step. Although the underlying algorithm was not fully\nimplemented, this proof provides another argument in favour of the relevance of\nACGs in Natural Language Processing.\n