A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Strings can be mapped into Hilbert spaces using feature maps such as the Parikh map. Languages can then be defined as the preimage of hyperplanes in the feature space, rather than using grammars or automata. These are the planar languages. In this paper we show that using techniques from kernel-based learning, we can represent and efficiently learn, from positive data alone, various linguistically interesting context-sensitive languages. In particular we show that the cross-serial dependenciesdoi:10.1007/11872436_13 fatcat:6mwwtt2monht5crwbzduo46dwu