Speaker
Affilliation
Royal Holloway, London
Abstract
Using string kernels, languages can be represented as hyperplanes in a high dimensional feature space. We present a new family of grammatical inference algorithms based on this idea. We demonstrate that some mildly context sensitive languages can be represented in this way and it is possible to efficiently learn these using kernel PCA. We present some experiments demonstrating the effectiveness of this approach on some standard examples of context sensitive languages using small synthetic data sets.
[Joint work with Christophe Costa Florencio and Chris Watkins: prize for most Innovative Contribution at ECML 2006]