PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Planar Languages and Learnability
Alexander Clark, Christophe Costa Florencio, Chris Watkins and Mariette Serayet
In: International Colloquium on Grammatical Inference, 20-22 September 2006, Tokyo.


Strings can be mapped into Hilbert spaces using feature maps such as the Parikh map. Languages can then be defined as the pre-image 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 dependencies in Swiss German, that established the non-context-freeness of natural language, are learnable using a standard kernel. We demonstrate the polynomial-time identifiability in the limit of these classes, and discuss some language theoretic properties of these classes, and their relationship to the choice of kernel/feature map.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Natural Language Processing
Theory & Algorithms
ID Code:2166
Deposited By:Alexander Clark
Deposited On:09 August 2006