Omaha, Nebraska, USA
Oct. 28, 2007 to Oct. 31, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDMW.2007.82
Planar languages offer an alternative to grammars and automata for representing languages. They are based on hy- perplanes in a feature space associated with a string kernel, which corresponds to a set of linear equalities over features. This makes planar languages inherently learnable, in the sense of being identifiable in the limit from positive data, i.e. learnable in an unsupervised setting, even under strong constraints on the learner's behaviour and on computa- tional resources used.
Christophe Costa Flor?ncio, "Tree Planar Languages", ICDMW, 2007, 2013 IEEE 13th International Conference on Data Mining Workshops, 2013 IEEE 13th International Conference on Data Mining Workshops 2007, pp. 405-410, doi:10.1109/ICDMW.2007.82