1 code implementation • 11 Jul 1996 • Walter Daelemans, Jakub Zavrel, Peter Berck, Steven Gillis
In this paper we show that a large-scale application of the memory-based approach is feasible: we obtain a tagging accuracy that is on a par with that of known statistical approaches, and with attractive space and time complexity properties when using {\em IGTree}, a tree-based formalism for indexing and searching huge case bases.}