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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bach, E.: Discontinuous constituents in generalized categorial grammars. North East Linguistics Society (NELS 11), 1â12 (1981)
Becker, T., Rambow, O., Niv, M.: The Derivational Generative Power of Formal Systems or Scrambling is Beyond LCFRS (Technical Report 92â38). Institute For Research in Cognitive Science, University of Pennsylvania (1992)
Chalup, S., Blair, A.D.: Hill climbing in recurrent neural networks for learning the a n b n c n language. In: Proceedings of the Sixth International Conference on Neural Information Processing, pp. 508â513 (1999)
Clark, A., Costa FlorĂȘncio, C., Watkins, C., Serayet, M.: Planar languages and learnability. In: International Colloquium on Grammatical Inference (ICGI), Tokyo (to appear, 2006)
Gentner, T.Q., Fenn, K.M., Margoliash, D., Nusbaum, H.C.: Recursive syntactic pattern learning by songbirds. Nature 440, 1204â1207 (2006)
Kearns, M., Valiant, G.: Cryptographic limitations on learning boolean formulae and finite automata. In: 21st annual ACM symposium on Theory of computation, pp. 433â444. ACM Press, New York (1989)
Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., Watkins, C.: Text classification using string kernels. JMLRÂ 2, 419â444 (2002)
Parikh, R.J.: On context-free languages. Journal of the ACMÂ 13, 570â581 (1966)
Radzinski, D.: Chinese number-names, tree adjoining languages, and mild context-sensitivity. Comput. Linguist. 17, 277â299 (1991)
Salomaa, A.: On languages defined by numerical parameters (Technical Report 663). Turku Centre for Computer Science (2005)
Schölkopf, B., Smola, A.K. M.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10 (1998)
Shawe-Taylor, J., Christianini, N.: Kernel methods for pattern analysis. Cambridge University Press, Cambridge (2004)
Shieber, S.M.: Evidence against the context-freeness of natural language. Linguistics and Philosophy 8, 333â343 (1985)
Starkie, B., Coste, F., van Zaanen, M.: The Omphalos context-free grammar learning competition. In: International Colloquium on Grammatical Inference, Athens, Greece, pp. 16â27 (2004)
Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th annual meeting on Association for Computational Linguistics, pp. 104â111. Association for Computational Linguistics, Morristown (1987)
Watkins, C.: Dynamic alignment kernels. In: Smola, A.J., Bartlette, P.L., Schölkopf, B., Schuurmans, D. (eds.) Advances in large margin classifiers, pp. 39â50. MIT Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clark, A., FlorĂȘncio, C.C., Watkins, C. (2006). Languages as Hyperplanes: Grammatical Inference with String Kernels. In: FĂŒrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds) Machine Learning: ECML 2006. ECML 2006. Lecture Notes in Computer Science(), vol 4212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11871842_13
Download citation
DOI: https://doi.org/10.1007/11871842_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45375-8
Online ISBN: 978-3-540-46056-5
eBook Packages: Computer ScienceComputer Science (R0)