Advertisement

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach

  • Christophe Costa Florêncio
  • Henning Fernau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6031)

Abstract

Kanazawa ([8]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in the technical sense of identifiability in the limit from positive data. They are defined in terms of bounds on certain parameters of the grammars. Intuitively, these bounds correspond to restrictions on linguistic aspects such as the amount of lexical ambiguity of the grammar.

The time complexity of learning these classes has been studied by Costa Florêncio ([4]). It was shown that for most of these classes, selecting a grammar from the class that is consistent with the data is NP-hard. In this paper existing complexity results are sharpened by demonstrating W[2]-hardness. Additional parameters allowing FPT-results are also studied, and it is shown that if these parameters are fixed, these problems become computable in polynomial time. As far as the authors are aware, this is the first such result for learning problems.

Keywords

Polynomial Time Vertex Cover Structure Language Language Class Lexical Ambiguity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buszkowski, W.: Discovery procedures for categorial grammars. In: Klein, E., van Benthem, J. (eds.) Categories, Polymorphism and Unification. University of Amsterdam (1987)Google Scholar
  2. 2.
    Buszkowski, W., Penn, G.: Categorial grammars determined from linguistic data by unification. Studia Logica 49, 431–454 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Costa Florêncio, C.: Consistent identification in the limit of rigid grammars from strings is NP-hard. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 49–62. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Costa Florêncio, C.: Learning Categorial Grammars. PhD thesis, Universiteit Utrecht, The Netherlands (2003)Google Scholar
  5. 5.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  6. 6.
    Gallai, T.: Über extreme Punkt- und Kantenmengen. Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 2, 133–138 (1959)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Johnson, D.S.: The NP-completeness column. ACM Transactions on Algorithms 1(1), 160–176 (2005)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Kanazawa, M.: Learnable Classes of Categorial Grammars. PhD, CSLI (1998)Google Scholar
  9. 9.
    Köbler, J., Schöning, U., Torán, J.: Graph Isomorphism Problem: The Structural Complexity. Birkhäuser, Basel (1993)zbMATHGoogle Scholar
  10. 10.
    Moriyama, T., Sato, M.: Properties of language classes with finite elasticity. In: Tomita, E., Kobayashi, S., Yokomori, T., Jantke, K.P. (eds.) ALT 1993. LNCS (LNAI), vol. 744, pp. 187–196. Springer, Heidelberg (1993)Google Scholar
  11. 11.
    Reinhardt, K.: A parallel context-free derivation hierarchy. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 441–450. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christophe Costa Florêncio
    • 1
  • Henning Fernau
    • 2
  1. 1.Department of Computer ScienceK.U. LeuvenLeuvenBelgium
  2. 2.FB IV—Abteilung InformatikUniversität TrierTrierGermany

Personalised recommendations