Abstract
In this paper, we deal with a class of contextual languages defined in the frame of order-sorted algebra. We define a new way to describe contextual (multi)languages, using constraints. For this class of constraint contextual languages a learning method with motivations from natural language processing is provided.
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
J. Goguen, J. Meseguer, Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoretical Computer Science 105 (1992), 217–273.
R. Gramatovici, An efficient parser for a class of contextual languages, Fundamenta Informaticae, to appear.
R. Gramatovici, Contextual multilanguages and operatorial automata, submitted MFCS’98.
M. Kudlek, S. Marcus, A. Mateescu, Contextual Grammars with Distributed Catenation and Shuffle, Technical Report FBI-HH-B-200/97, University of Hamburg, 1997.
Gh. Păun, Marcus Contextual Grammars, Kluwer, 1997.
S. Marcus, Contextual grammars, Rev. Roum. Math. Pures Appl., 14,10 (1969), 69–74.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gramatovici, R. (1998). Contextual Multilanguages: A Learning Method. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive