String Parsing Using a Fuzzy Context-Free Pattern
Armen Kostanyan, Anna Gevorgyan · 2023
This paper is devoted to determining the degree of compliance of a given string with a pattern represented as a context-free grammar, the terminal symbols of which are fuzzy properties of the characters of the base alphabet. Parsing is performed by converting the fuzzy context-free pattern into a fuzzy context-free grammar over the base alphabet, after which the fuzzy version of the Cocke-Younger-Kasami (CYK) algorithm is applied to determine the measure by which the given string can be parsed according to the given pattern. The proposed approach makes it possible to classify strings in the basic alphabet based on a fuzzy context-free pattern. This work may find application in bioinformatics to classify DNA sequences using fuzzy prototypes described in one way or another. Another application concerns the parsing of natural languages, where fuzzy methods have been used for a long time and give good results.