Expressibility of many-valued linguistics constructions

• Autorzy: Frankowski S.
• Języki publikacji: EN

Abstrakty

EN

The main problem of this paper is a comparison between different kinds of many-valued and two valued linguistics constructions. We are trying to approximate probabilistic grammars by using ones which contain rational numbers only. Moreover, it is shown that probabilistic grammar can be simulated by regularly controlled grammar.

Słowa kluczowe

EN

formal languages; many-valued automata; probabilistic grammar

PL

języki formalne; gramatyki probabilistyczne

• Wydawca: Wydawnictwo Politechniki Łódzkiej
• Czasopismo: Journal of Applied Computer Science
• Rocznik: 2015
• Tom: Vol. 23, nr 2
• Strony: 7--19
• Opis fizyczny: Bibliogr. 11 poz.

Twórcy

autor

Frankowski S.

• University of Lodz, Department of Logic, Kopcińskiego 16/18, Lodz Poland

Bibliografia

• [1] Dassow, J., Grammars with regulated rewriting, Studies in Fuzziness and Soft Computing, Vol. 148, 2004, pp. 249–273.
• [2] E.T. Lee, L. Z., Note on fuzzy languages, Inform. Sci., Vol. 1, 1969, pp. 421–434.
• [3] Pereira, F., Riley, M., and Sproat, R., Weighted Rational Transductions and Their Application to Human Language Processing, In: Proceedings of the Workshop on Human Language Technology, HLT ’94, Association for Computational Linguistics, Stroudsburg, PA, USA, 1994, pp. 262–267.
• [4] Casacuberta, F. and de la Higuera, C., Computational Complexity of Problems on Probabilistic Grammars and Transducers, In: Grammatical Inference: Algorithms and Applications, edited by A. L. Oliveira, Vol. 1891 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2000, pp. 15–24.
• [5] Geman, S. and Johnson, M., Probabilistic Grammars and their Applications, In: In International Encyclopedia of the Social & Behavioral Sciences. N.J. Smelser and P.B, 2000, pp. 12075–12082.
• [6] Gerla, B., Many-valued logic and semirings, Neural Networks World, Vol. 5, 2003, pp. 467–480.
• [7] Salomaa, A., Probabilistic and weighted grammars, Information and Control, Vol. 15, 1969, pp. 529–544.
• [8] Hopcroft, J. E., Motwani, R., and Ullman, J. D., Introduction to Automata Theory, Languages, and Computation (3rd Edition), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006.
• [9] Mordeson, J. N. and Malik, D. S., Fuzzy Automata and Languages: Theory and Applications, Chapman & HallCRC, 2002.
• [10] Hájek, P., Metamathematics of Fuzzy Logic, Kluwer, 1998.
• [11] Droste, M. and Gastin, P., On aperiodic and star-free formal power series in partially commuting variables, Theory of Computing Systems, Vol. 42, No. 4, May 2008, pp. 608–631.