Languages as hyperplanes: grammatical inference with string kernels-Reference-Cited by-同舟云学术

Languages as hyperplanes: grammatical inference with string kernels

Published:2010-09-25 Issue:3 Volume:82 Page:351-373
ISSN:0885-6125
Container-title:Machine Learning
language:en
Short-container-title:Mach Learn

Author:

Clark Alexander,Costa Florêncio Christophe,Watkins Chris

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Software

Link

http://link.springer.com/content/pdf/10.1007/s10994-010-5218-3.pdf

Reference48 articles.

1. Asveld, P. R. J. (2006). Generating all permutations by context-free grammars in Chomsky normal form. Theoretical Computer Science, 354(1), 118–130.

2. Bach, E. (1981). Discontinuous constituents in generalized categorial grammars. In North east linguistics society (NELS 11) (pp. 1–12).

3. Becerra-Bonache, L. (2006). On the learnability of mildly context-sensitive languages using positive data and correction queries. Ph.D. thesis, Universitat Rovira i Virgili, Tarragona, Spain.

4. Lecture notes in computer science;L. Becerra-Bonache,2004

5. Becker, T., Rambow, O., & Niv, M. (1992). The derivational generative power of formal systems or scrambling is beyond LCFRS (Tech. Rep. 92–38). Institute For Research in Cognitive Science, University of Pennsylvania.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Semantic separator learning and its applications in unsupervised Chinese text parsing;Frontiers of Computer Science;2013-01-09

2. A Spectral Learning Algorithm for Finite State Transducers;Machine Learning and Knowledge Discovery in Databases;2011