In this work we propose a model for text processing using string kernels, capable of flexibly representing non-contiguous sequences.
we derive a vectorised version of the string kernel algorithm and their gradients, allowing efficient hyperparameter optimisation as part of a Gaussian Process framework.