Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoining grammars and that both allow strong lexicalization.
CITATION STYLE
Engelfriet, J., & Maletti, A. (2017). Multiple context-free tree grammars and multi-component tree adjoining grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10472 LNCS, pp. 217–229). Springer Verlag. https://doi.org/10.1007/978-3-662-55751-8_18
Mendeley helps you to discover research relevant for your work.