Article · May 1, 2000
Practical aspects in compiling tabular TAG parsers
Miguel Á. Alonso, Djamé Seddah, Éric Villemonte de la Clergerie
Abstract
This paper describes the extension of the system DyALog to compile tabular parsers from Feature Tree Adjoining Grammars. The compilation process uses intermediary 2-stack automata to encode various parsing strategies and a dynamic programming interpretation to break automata derivations into tabulable fragments. 1. Introduction This paper describes the extension of the system DyALog in order to produce tabular parsers for Tree Adjoining Grammars [TAGs] and focuses on some practical aspects encountered during the process. By tabulation, we mean that traces of (sub)computations, called items, are tabulated in order to provide computation sharing and loop detection (as done in Chart Parsers). The system DyALog 1 handles logic programs and grammars (DCG). It has two main components, namely an abstract machine that implements a generic fix-point algorithm with subsumption checking on objects, and a bootstrapped compiler. The compilation process first compiles a grammar into a Push-Down ...
More by Miguel Alonso
- Public Sentiment Analysis and Topic Modeling Regarding COVID-19’s Three Waves of Total Lockdown: A Case Study on Movement Control Order in MalaysiaKSII Transactions on Internet and Information Systems · 2022 · Citations: 11
- Construction and Evaluation of Sentiment Datasets for Low-Resource Languages: The Case of UzbekLecture notes in computer science · 2022 · Citations: 42
- Sentiment Analysis for Fake News DetectionElectronics · 2021 · Citations: 270
- On the Use of Parsing for Named Entity RecognitionApplied Sciences · 2021 · Citations: 24
