FUZZY PATTERN MATCHING

Abstract

Pattern‐directed inference systems (P.D.I.S.) are among the most largely used tools in A.I. to‐day in order to represent and exploit knowledge. Generally, P.D.I.S.'s use production rules triggered by matching between rule patterns and elements of the data base. However, the lack of flexibility in the matching remains a drawback in this kind of system. In the framework of the communication in natural language with robots, approximate descriptions of real world situations and approximately specified rules are needed; furthermore, similarity in the matching process does not always need to be perfect. Thus, the pervading fuzziness of natural language can be taken into account. The following levels, belonging to the real interval [0,1], are evaluated: The possibility of similarity between referents designated in the data and in the pattern respectively; the necessity that a referent designated in the data is similar to a referent designated in the pattern. Designations are fuzzy when the pattern or the data are fuzzy, which is usual with words of a natural language.

Citation

CAYROL, M., FARRENY, H. and PRADE, H. (1982), "FUZZY PATTERN MATCHING", Kybernetes, Vol. 11 No. 2, pp. 103-116. https://doi.org/10.1108/eb005612