| Ferro, L., Vilain, M., & Yeh, A. (1999). Learning transformation rules to find grammatical relations. Computational Natural Language Learning: A workshop at the 9th Conf. of the European Chapter of the Association for Computational Linguistics . |
....relations (GRs) These modules usually rely on stochastic methods 1 Note that we do not know how often, since this is one of the goals for constructing a treebank including predicateargument structures. Brants et al. 1997) and or machine learning techniques (Buchholz et al. 1999) (Ferro et al. 1999). A common characteristics of all the approaches is to keep low the number of GR labels (around a dozen) this satisfies some trade off between the accuracy of the syntactic description and the tractability of the assignment task. The solution proposed in this paper is to realize this trade off ....
Ferro L., Vilain M., Yeh A.: Learning Transformation Rules to find Grammatical Relations. Workshop on Computational Natural Language Learning (GNLL-99) (1999), 43-52.
No context found.
Ferro, L., Vilain, M., & Yeh, A. (1999). Learning Transformation Rules to Find Grammatical Relations. In Proceedings of the 1999 Workshop on Computational Natural Language Learning (CoNLL-99). Bergen, Norway.
No context found.
Ferro, L., Vilain, M., & Yeh, A. (1999). Learning transformation rules to find grammatical relations. Computational Natural Language Learning: A workshop at the 9th Conf. of the European Chapter of the Association for Computational Linguistics .
No context found.
Lisa Ferro, Marc Vilain, and Alexander Yeh. Learning transformation rules to find grammatical relations. In Computational Natural Language Learning, pages 43--52. ACL, June 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC