Rademacher complexity and grammar induction algorithms: What it may (not) tell us

S. Katrenko, M. van Zaanen

    Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

    35 Downloads (Pure)
    Original languageEnglish
    Title of host publicationGrammatica inference
    Subtitle of host publicationTheoretical results and applications
    EditorsJ. Sempere, P. Garcia
    Place of PublicationBerlin/Heidelberg
    PublisherSpringer
    Pages293-296
    Number of pages4
    ISBN (Print)3642154875
    Publication statusPublished - 2010

    Publication series

    NameLecture Notes in Artificial Intelligence
    Number6339

    Cite this

    Katrenko, S., & van Zaanen, M. (2010). Rademacher complexity and grammar induction algorithms: What it may (not) tell us. In J. Sempere, & P. Garcia (Eds.), Grammatica inference: Theoretical results and applications (pp. 293-296). (Lecture Notes in Artificial Intelligence; No. 6339). Berlin/Heidelberg: Springer.
    Katrenko, S. ; van Zaanen, M. / Rademacher complexity and grammar induction algorithms : What it may (not) tell us. Grammatica inference: Theoretical results and applications. editor / J. Sempere ; P. Garcia. Berlin/Heidelberg : Springer, 2010. pp. 293-296 (Lecture Notes in Artificial Intelligence; 6339).
    @inbook{29b92f42bc7c47a982ca2109727c8783,
    title = "Rademacher complexity and grammar induction algorithms: What it may (not) tell us",
    author = "S. Katrenko and {van Zaanen}, M.",
    note = "Pagination: 4",
    year = "2010",
    language = "English",
    isbn = "3642154875",
    series = "Lecture Notes in Artificial Intelligence",
    publisher = "Springer",
    number = "6339",
    pages = "293--296",
    editor = "J. Sempere and P. Garcia",
    booktitle = "Grammatica inference",

    }

    Katrenko, S & van Zaanen, M 2010, Rademacher complexity and grammar induction algorithms: What it may (not) tell us. in J Sempere & P Garcia (eds), Grammatica inference: Theoretical results and applications. Lecture Notes in Artificial Intelligence, no. 6339, Springer, Berlin/Heidelberg, pp. 293-296.

    Rademacher complexity and grammar induction algorithms : What it may (not) tell us. / Katrenko, S.; van Zaanen, M.

    Grammatica inference: Theoretical results and applications. ed. / J. Sempere; P. Garcia. Berlin/Heidelberg : Springer, 2010. p. 293-296 (Lecture Notes in Artificial Intelligence; No. 6339).

    Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

    TY - CHAP

    T1 - Rademacher complexity and grammar induction algorithms

    T2 - What it may (not) tell us

    AU - Katrenko, S.

    AU - van Zaanen, M.

    N1 - Pagination: 4

    PY - 2010

    Y1 - 2010

    M3 - Chapter

    SN - 3642154875

    T3 - Lecture Notes in Artificial Intelligence

    SP - 293

    EP - 296

    BT - Grammatica inference

    A2 - Sempere, J.

    A2 - Garcia, P.

    PB - Springer

    CY - Berlin/Heidelberg

    ER -

    Katrenko S, van Zaanen M. Rademacher complexity and grammar induction algorithms: What it may (not) tell us. In Sempere J, Garcia P, editors, Grammatica inference: Theoretical results and applications. Berlin/Heidelberg: Springer. 2010. p. 293-296. (Lecture Notes in Artificial Intelligence; 6339).