Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets

Abstract

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 2 R |·|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.