THE RECOGNITION OF IMPERFECT STRINGS GENERATED BY FUZZY CONTEXT-SENSITIVE GRAMMARS

被引:6
作者
INUI, M
SHOAFF, W
FAUSETT, L
SCHNEIDER, M
机构
[1] FLORIDA INST TECHNOL,DEPT COMP SCI,150 W UNIV BLVD,MELBOURNE,FL 32901
[2] FLORIDA INST TECHNOL,DEPT APPL MATH,MELBOURNE,FL 32901
关键词
CONTEXT SENSITIVE GRAMMARS; FUZZY SETS; IMPERFECT STRINGS; PATTERN RECOGNITION;
D O I
10.1016/0165-0114(94)90069-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we extend previous work on the recognition of imperfect strings generated by fuzzy context-free grammars to the recognition of imperfect strings generated by fuzzy context-sensitive grammars. A context-sensitive production rule alphaAgamma --> alphabetagamma has both constitutent (beta) and contexts (alpha, gamma) which can be changed by substituting, deleting or inserting terminal characters. Changed rules derive strings which can be considered to be in the language generated by the original grammar with some certainty. Since some strings may not be recognizable when only one change is made to the grammar, multiple error corrections are described.
引用
收藏
页码:21 / 29
页数:9
相关论文
共 4 条
  • [1] Hopcroft J. E., 1979, INTRO AUTOMATA THEOR
  • [2] KUNO S, 1967, MATH LINGUISTICS AUT, pCHA
  • [3] Sankoff D, 1983, TIME WARPS STRING ED
  • [4] THE UTILIZATION OF FUZZY-SETS IN THE RECOGNITION OF IMPERFECT STRINGS
    SCHNEIDER, M
    LIM, H
    SHOAFF, W
    [J]. FUZZY SETS AND SYSTEMS, 1992, 49 (03) : 331 - 337