Portal de Periódicos da CAPES

Algoritmos de análisis para gramáticas de inserción de árboles

2002; Technical University of Valencia; Volume: 29; Issue: 29 Linguagem: Inglês

1135-5948

Vicente Carrillo Montero, Víctor Jesús Díaz Madrigal, Miguel Ángel Alonso Pardo,

Natural Language Processing Techniques

Tree Insertion Grammar (TIG) is a compromise between Context Free Grammar (CFG) and Tree Adjoining Grammar (TAG) that can be parsed in O(n3)- time. In the literature, just two parsers for TIGs have been defined, based on the well-known CYK and Earley algorithms for CFGs. In this paper, we define four new parsers for TIGs: three parsers use a bottom-up strategy and the other one uses a predictive bottom-up strategy.