Paper: u-TBL Lite: A Small Extendible Transformation-Based Learner

ACL ID E99-1047
Title u-TBL Lite: A Small Extendible Transformation-Based Learner
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1999
Authors

This short paper presents a 'light' version of the #-TBL system a genera/, logically transparent, flexible and efficient transformation-based learner presented in (Lager, 1999). It turns out that a transformation-based learner, complete with a compiler for templates, can be implemented in less than one page of Prolog code. 2 #-TBL Rules &= Representations The point of departure for TBL is a tagged initialstate corpus and a correctly tagged training corpus. pus. Assuming the part-of-speech tagging task, corpus data can be represented by means of three kinds of clauses: wd(P,W) is true iff the word W is at position P in the corpus tag(P,A) is true iff the word at position P in the corpus is tagged A tag(A,B,P) is true iff the word at P is tagged A and the correct tag for the word at P is B A...