Abstract
It is well-known that certain classes of classical categorial grammars are learnable, within Gold’s paradigm of identification in the limit, from positive examples. In the search for classes which can be learned efficiently from strings, we study the class of 2-letter rigid grammars, which is the class of classical categorial grammars with an alphabet of two letters, each of which is assigned a single type. The (non-trivial) structure of this class of grammars is studied and it is shown that grammars in this class can be learned very efficiently. The algorithm given for solving this learning problem runs in time linear in the total length of the input strings. After seeing two or more strings in a language, the algorithm can determine precisely the (finite) set of grammars which can generate those strings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Costa Florŋcio C. Consistent Identification in the Limit of any of the Classes k-Valued is NP-Hard, In de Groote P., Morril G., Retor’e C., Eds., Logical Aspects of Computational Linguistics, vol. 2099 of Lecture Notes in Artificial Intelligence, p. 125–138, Springer, 2001.
Graham R., Knuth D., Potashnik O. Concrete Mathematics, 2nd ed. Addison-Wesley, 1994.
Kanazawa M. Learnable Classes of Categorial Grammars, Studies in Logic Language and Information, CSLI Publications, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seginer, Y. (2002). Fast Learning from Strings of 2-Letter Rigid Grammars. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2002. Lecture Notes in Computer Science(), vol 2484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45790-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-45790-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44239-4
Online ISBN: 978-3-540-45790-9
eBook Packages: Springer Book Archive