Abstract
This paper describes membrane computational models parsing affixed Romanian words with prefixes, suffixes, terminations, and alterations in the root. An algorithm for Romanian affixes extraction is given, and several models of P systems are proposed.
The authors acknowledge the project STCU-5384 “Models of high performance computations based on biological and quantum approaches”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alhazov, A., Boian, E., Cojocaru, S., Colesnicov, A., Malahov, L., Petic, M., Ciubotaru, C.: Membrane Models of Romanian Word Affixation. Applied Linguistics and Linguistic Technologies: MegaLing-2012. Kyiv (in print, 2013) (in Russian)
Graur, A., Avram, M.: Word formation in Romanian, vol. II, p. 310. Romanian Academy Press, Bucharest (1978) (in Romanian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alhazov, A. et al. (2013). A P System Parsing Word Derivatives. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds) Unconventional Computation and Natural Computation. UCNC 2013. Lecture Notes in Computer Science, vol 7956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39074-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-39074-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39073-9
Online ISBN: 978-3-642-39074-6
eBook Packages: Computer ScienceComputer Science (R0)