Constraint Satisfaction Inference : Non-probabilistic Global Inference for Sequence Labelling
Sander Canisius, Antal P. J. van den Bosch, Walter M. P. Daelemans · Research portal (Tilburg University) · 2006
We present a new method for performing sequence labelling based on the idea of using a machine-learning classifier to generate several possible output sequences, and then applying an inference procedure to select the best sequence among those. Most sequence labelling methods following a similar approach require the base classifier to make probabilistic predictions. In contrast, our method can be used with virtually any type of classifier. This is illustrated by implementing a sequence classifier on top of a (nonprobabilistic) memory-based learner. In a series of experiments, this method is shown to outperform two other methods; one naive baseline approach, and another more sophisticated method.