Abstract
Linear language class is a subclass of context-free language class. In this paper, we propose an algorithm to learn linear languages from structural information of their strings. We compare our algorithm with other adapted algorithm from Radhakrishnan and Nagaraja [RN1]. The proposed method and the adapted algorithm are heuristic techniques for the learning tasks, and they are useful when only positive structural data is available.
Work partially supported by the Spanish CICYT under grant TIC-1026/92-CO2
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Amar, V., Putzolu, G.: On a Family of Linear Grammars. Information and Control 7 (1964) 283–291.
Angluin, D., Smith, C.: Inductive Inference: Theory and Methods. Computing Surveys 15 No. 3 (1983) 237–269.
García, P.: Learning K-Testable Tree Sets from positive data. Technical Report DSIC-II/46/93. Universidad Politécnica de Valencia. (1993)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company. (1979)
Radhakrishnan, V., Nagaraja, G.: Inference of Even Linear Grammars and its Application to Picture Description Languages. Pattern Recognition 21 No. 1 (1988) 55–62.
Ruiz, J., García, P.: The Algorithms RT and k-TTI: A First Comparison. Lecture Notes in Artificial Intelligence. Proceedings of the Second International Colloquium on Grammatical Inference ICGI94. Ed. Springer-Verlag. (1994) 180–188.
Sakakibara, Y.: Efficient Learning of Context-Free Grammars from Positive Structural Examples. Information and Computation 97 (1992) 23–60.
Salomaa, A.: Formal Languages. Academic Press. (1973)
Sempere, J., P. García, P.: A Characterization of Even Linear Languages and its Application to the Learning Problem. Lecture Notes in Artificial Intelligence. Proceedings of the Second International Colloquium on Grammatical Inference ICGI94. Ed. Springer-Verlag. (1994) 38–44.
Takada, Y.: Grammatical Inference of Even Linear Languages based on Control Sets. Information Processing Letters 28 No.4 (1988) 193–199.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sempere, J.M., Fos, A. (1996). Learning linear grammars from structural information. In: Miclet, L., de la Higuera, C. (eds) Grammatical Interference: Learning Syntax from Sentences. ICGI 1996. Lecture Notes in Computer Science, vol 1147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033348
Download citation
DOI: https://doi.org/10.1007/BFb0033348
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61778-5
Online ISBN: 978-3-540-70678-6
eBook Packages: Springer Book Archive