Skip to main content
SpringerLink
Log in

Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG

  • Conference paper
Grammatical Inference: Theoretical Results and Applications (ICGI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6339))

Included in the following conference series:

  • 784 Accesses

Abstract

We develop a framework based on Hölder norms that allows us to easily transfer learnability results. This idea is concretized by applying it to Classical Categorial Grammars (CCG).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Takada, Y.: A hierarchy of language families learnable by regular language learning. Information and Computation 123, 138–145 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Fernau, H., Sempere, J.M.: Permutations and control sets for learning non-regular language families. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol. 1891, pp. 75–88. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Fernau, H.: Even linear simple matrix languages: formal language properties and grammatical inference. Theoretical Computer Science 289, 425–489 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kanazawa, M.: Learnable Classes of Categorial Grammars. PhD, CSLI (1998)

    Google Scholar 

  5. Costa Florêncio, C., Fernau, H.: Finding consistent categorial grammars of bounded value: a parameterized approach. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 202–213. Springer, Heidelberg (2010)

    Google Scholar 

  6. Dassow, J., Fernau, H.: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach. Information and Computation 206, 1095–1103 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Angluin, D.: Inference of reversible languages. Journal of the ACM 29(3), 741–765 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U. Leuven, Leuven, Belgium

    Christophe Costa Florêncio

  2. FB IV—Abteilung Informatik, Universität Trier, D-54286, Trier, Germany

    Henning Fernau

Authors
  1. Christophe Costa Florêncio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Sistemas Informáticos y Computatión, Universidad Politécnica de Valencia, Camino de Vera s/n, 46022, Valencia, Spain

    José M. Sempere  & Pedro García  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Costa Florêncio, C., Fernau, H. (2010). Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15488-1_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15487-4

  • Online ISBN: 978-3-642-15488-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation