.png){kind=icon}
Return
Languages as hyperplanes: grammatical inference with string kernels
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-010-5218-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Using string kernels, languages can be represented as hyperplanes in a high dimensional feature space. We discuss the language-theoretic properties of this formalism with particular reference to the implicit feature maps defined by string kernels, considering the expressive power of the formalism, its closure properties and its relationship to other formalisms. 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 that it is possible to efficiently learn these using kernel PCA. We experimentally demonstrate the effectiveness of this approach on some standard examples of context-sensitive languages using small synthetic data sets.
Keywords:
Kernel methods
Grammatical inference
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
.png){kind=icon}
ShareSave
Potentiation by treatment with reserpine of α2-adrenoceptor-mediated contractions of rat tail artery
PREAI
ShareSaveShareSaveShareSaveShareSave
View more