Publications
Talk · International Conference on Implementation and application of automata · July 3, 2002
Bidirectional push down automata
Miguel Á. Alonso, Víctor J. Díaz, Jesús Vilares
Abstract
c ○ Springer-Verlag Abstract. We define a new model of automata for the description of bidirectional parsing strategies for context-free grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of defining bidirectional parsers, separating the description of a strategy from its execution. 1
semigroups and automata theoryNatural Language Processing TechniquesAlgorithms and Data Compressioncontext-free grammarsparsing strategiestabulation
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
