Publications
Talk · International Workshop/Conference on Parsing Technologies · October 1, 2001
Bidirectional Automata for Tree Adjoining Grammars
Miguel Á. Alonso, Víctor J. Díaz, Manuel Vilares Ferro
Abstract
We de ne a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in polynomial time. This new model of automata provides a modular way of describing bidirectional parsing strategies for TAG, separating the description of a strategy from its execution.
semigroups and automata theoryNatural Language Processing TechniquesSyntax, Semantics, Linguistic Variationtree adjoining grammarsparsing strategiesautomata models
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
