ACGtk: A Toolkit for Developing and Running Abstract Categorial Grammars

被引:0
|
作者
Guillaume, Maxime [1 ,2 ]
Pogodalla, Sylvain [1 ]
Tourneur, Vincent [1 ]
机构
[1] Univ Lorraine, LORIA, Inria, CNRS, F-54000 Nancy, France
[2] YSEOP, Lyon, France
关键词
Abstract Categorial Grammars; Natural Language Processing; OCaml; Datalog;
D O I
10.1007/978-981-97-2300-3_2
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The Abstract categorial grammars (ACGs) is an expressive grammatical framework whose formal properties have been extensively studied. While it can provide its own account, as a grammar, of linguistic phenomena, it is known to encode several grammatical formalisms, including context-free grammars, but also mildly context-sensitive formalisms such as tree-adjoining grammars or m-linear context-free rewriting systems for which parsing is polynomial. The ACG toolkit we present provides a compiler, acgc, that checks and turns ACGs into representations that are suitable for testing and parsing, used in the acg interpreter. We illustrate these functionalities and discuss implementation features, in particular the Datalog reduction on which parsing is based, and the magic set rewriting techniques that can further be applied.
引用
收藏
页码:13 / 30
页数:18
相关论文
共 50 条
  • [41] Optimal unification and learning algorithms for categorial grammars
    Dziemidowicz, B
    FUNDAMENTA INFORMATICAE, 2002, 49 (04) : 313 - 324
  • [42] Learning Combinatory Categorial Grammars for Plan Recognition
    Geib, Christopher W.
    Kantharaju, Pavan
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3007 - 3014
  • [43] Combinatory categorial grammars as generators of weighted forests
    Maletti, Andreas
    Schiffer, Lena Katharina
    INFORMATION AND COMPUTATION, 2023, 294
  • [44] Learning reversible categorial grammars from structures
    Besombes, J
    Marion, JY
    INTELLIGENT INFORMATION PROCESSING AND WEB MINING, 2004, : 181 - 190
  • [45] Polynomial algorithm for the membership problem with categorial grammars
    ENS de Cachan, Cachan, France
    Theor Comput Sci, 1-2 (207-221):
  • [46] When categorial grammars meet regular grammatical inference
    Tellier, I
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, PROCEEDINGS, 2005, 3492 : 301 - 316
  • [47] ABSTRACT ATTRIBUTE GRAMMARS
    VOOGLAID, AO
    MERISTE, MB
    PROGRAMMING AND COMPUTER SOFTWARE, 1982, 8 (05) : 242 - 251
  • [48] ABSTRACT FAMILY OF LANGUAGES OF CATEGORIAL TYPE
    GALLEGO, MSD
    ANNALES DE LA SOCIETE SCIENTIFIQUE DE BRUXELLES SERIES 1-SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1978, 92 (04): : 249 - 262
  • [49] The tree-generative capacity of combinatory categorial grammars
    Kuhlmann, Marco
    Maletti, Andreas
    Schiffer, Lena Katharina
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 124 : 214 - 233
  • [50] PHRASE STRUCTURE LANGUAGES GENERATED BY CATEGORIAL GRAMMARS WITH PRODUCT
    KANDULSKI, M
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1988, 34 (04): : 373 - 383