On Total Contextual Grammars with Restricted Choice

• Autorzy: Ceterchi R. , Gramatovici R.
• Języki publikacji: EN

Abstrakty

EN

A variant of contextual grammars, namely the total contextual grammar with restricted choice, is studied from several points of view. The results obtained by comparing this concept with other related types of contextual grammars support the claim that total contextual grammars with restricted choice are a generative model with good enough qualities for applications in the field of computational linguistics.

Słowa kluczowe

EN

total contextual grammars; n-contextual grammars; contextual grammar with choice; local contextual grammars

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 64, nr 1-4
• Strony: 79--91
• Opis fizyczny: Bibliogr. 17 poz.

Twórcy

autor

Ceterchi R.

• Faculty of Mathematics, Bucharest University, Str. Academiei 14, 010014 Bucharest, Romania

autor

Gramatovici R.

• Faculty of Mathematics, Bucharest University, Str. Academiei 14, 010014 Bucharest, Romania

Bibliografia

• [1] R. Ceterchi, Marcus contextual grammars, Chapter 17 in Formal Languages and Applications, C. Martin-Vide, V. Mitrana, Gh. Păun, eds., Springer-Verlag, Berlin, Heidelberg, 2004, 335–366.
• [2] K. Culik II, N-ary grammars and the descriptions of mappings of languages, Kybernetika, 6(2), 1970, 99–117.
• [3] A. Ehrenfeucht, Gh. Păun, G. Rozenberg, Contextual grammars and formal languages, Chapter 6 in [17], 237–294.
• [4] R. Gramatovici, An efficient parser for a class of contextual languages, Fundamenta Informaticae, 33(3), 1998, 211–238.
• [5] R. Gramatovici, F.Manea, Parsing local internal contextual languages with context-free choice, in the present volume.
• [6] L. Ilie, On computational complexity of contextual languages, Theoretical Computer Science, 183 (1997) 33–44.
• [7] P. Jančar, F. Mráz, M. Plátek, M. Procházcha, Deleting automata with a restart operation, in Proc. Developments in Language Theory, DLT 1997, S. Bozapalidis, ed., Thessaloniki, 1998, 191–202.
• [8] S. Marcus, Contextual grammars, Rev. Roum. Math. Pures Appl., 14 (1969), 1525–1534.
• [9] S. Marcus, Contextual grammars and natural languages, Chapter 5 in [17], 215–236.
• [10] S. Marcus, C. Martín-Vide, Gh. Păun, Contextual grammars as generativemodels of natural languages, Computational Linguistics 24(2), 1998, 245-274.
• [11] C. Martín-Vide, A. Mateescu, J. Miquel-Verges, Gh. Păun, Internal contextual grammars: minimal, maximal and scattered use of selectors, in Proc. Fourth Bar-Ilan Symposium on Foundations of Artificial Intelligence, M. Koppel, E. Shamir, eds., AAAI Press, Menlo Park, 1997, 159–168.
• [12] F. Mráz, M. Plátek, M. Procházcha, Deleting automata with a restart operation and Marcus grammars, in Proc. Developments in Language Theory, DLT 1997, S. Bozapalidis, ed., Thessaloniki, 1998, 329–342.
• [13] F. Mráz, M. Plátek, M. Procházcha, Restarting automata, deleting and Marcus grammars, in Recent Topics in Mathematical and Computational Linguistics, C. Martin-Vide, Gh. Paun, eds., Romanian Academy Publishing House, 2000, 218–233.
• [14] X.M. Nguyen, N-contextual grammars with syntactical invariant choice, Found. Control Engineering, 5 (1980), 21–29.
• [15] X.M. Nguyen, Gh. Păun, On the generative capacity of n-contextual grammars, Bull. Math. Soc. Sci. Math. Roumanie, 25(74), 1982, 345–354.
• [16] Gh. Păun, Marcus Contextual Grammars, Kluwer, Dordrecht, Boston, London, 1997.
• [17] G. Rozenberg, A. Salomaa (eds.), The Handbook of Formal Languages, 3 volumes, Springer-Verlag, Berlin, Heidelberg, 1997.