Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets
- 34 Downloads
To overcome the limitations of context-free and context-sensitive grammars, regulated grammars have been proposed. In this paper, an algorithm is proposed for the recognition of faulty strings in regulated grammar. Furthermore, depending on the errors and certainty, it is decided whether the string belongs to the language or not based on string membership value. The time complexity of the proposed algorithm is O(|G R 2 |·|w|), where |GR| represents the number of production rules and |w| is the length of the input string, w. The reader is provided with numerical examples by applying the algorithm to regularly controlled and matrix grammar. Finally, the proposed algorithm is applied in the Hindi language for the recognition of faulty strings in regulated grammar as a real-life application.
KeywordsFuzzy regulated grammar fuzzy sets Chomsky normal form regularly controlled grammar matrix grammar
One of the authors, Nidhi Kalra was supported under Visvesvaraya PhD Scheme Fellowship by Ministry of Electronics and Information Technology, Government of India.
- 9.DePalma G F and Yau S S 1975 Fractionally fuzzy grammars with application to pattern recognition. In: Zadeh L A, Fu K S, Tanaka K and Shimura M (Eds.) Fuzzy Sets and their Application to Cognitive and Decision Processes. New York: Academic Press, pp. 329–351Google Scholar
- 17.Solar P 2014 Deep Pushdown Transducers and State Translation Schemes. In: Proceedings of the 20th Conference STUDENT EEICT, Brno University of Technology, 24 April, pp. 264–268Google Scholar
- 19.Zemek P 2013 One-sided random context grammars: Established results and open problems. In: Proceedings of the 19th Conference STUDENT EEICT, Brno University of Technology, 25 April, pp. 222–226Google Scholar
- 20.Van der Walt A P J 1970 Random context grammars. In: Proceedings IFIP Congress. North-Holland, Amsterdam, pp. 66–68Google Scholar
- 25.Kleijn H C M 1983 Selective Substitution Grammars Based on Context-Free Productions. Ph.D. Thesis, Leiden University, NetherlandsGoogle Scholar
- 26.Kleijn H C M 1987 Basic ideas of selective substitution grammars. In: Kelemenova A and Kelemen J (Eds.) Trends Techniques and Problems in Theoretical Computer Science. Berlin, Germany: Springer, pp. 75–95Google Scholar
- 34.Bag S, Tiwari M K and Chan F T S 2017 Predicting the consumer’s purchase intention of durable goods: An attribute-level analysis. Journal of Business Research. https://doi.org/10.1016/j.jbusres.2017.11.031
- 36.Lange M and Leiß H 2009 To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm. Informatica Didactica 8: 2008–2010Google Scholar