Abstract
We describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.
Cite
CITATION STYLE
APA
Alonso, M. A., Cabrero, D., de la Clergerie, E., & Vilares, M. (1999). Tabular algorithms for TAG parsing. In 9th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1999 (pp. 150–157). Association for Computational Linguistics (ACL). https://doi.org/10.3115/977035.977056
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free