«takes as input a sequence of phrase-structure trees and modifies their labels according to a set of rules. ... Its rule notation is flexible enough to emulate head/argument-finding rules»
P. Koehn, F. Och, and D. Marcu. NAACL '03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, page 48--54. Morristown, NJ, Association for Computational Linguistics, Association for Computational Linguistics, (2003)
S. Chen. Proceedings of the 31st Annual Conference of the Association for Computational Linguistics, page 9--16. Columbus, Ohio, Association for Computational Linguistics, Association for Computational Linguistics, (1993)
M. Hearne, S. Ozdowska, and J. Tinsley. Actes de la 15e Conférence Annuelle sur le Traitement Automatique des Langues Naturelles (TALN '08), Avignon, France, ATALA, (2008)
Z. Sheikh, and F. Sánchez-Martínez. Proceedings of the First International Workshop on Free/Open-Source Rule-Based Machine Translation, page 67--74. Alicante, Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos, (2009)