patternrecognition-在線瀏覽
2024-08-27 16:31本頁面
【正文】 b b 30 String Matching ? Advantages: Shape Numbers suits the processing structure simple graph, specially bees by the line bination solve rotation the question problem 5. Matching Shape Numbers most emphatically to the graph outline, Shape similarity also may pletely overe 6. The Displacement question definitely may overe, because of this method emphatically to the relative position but is not to the position 31 String Matching ? Disadvantages: can not uses for a hollow structure color is unable to recognize 32 Syntactic Recognition of Strings String Grammars ? When dealing with strings, we define a grammar as the 4tuple ? is a finite set of variables called nonterminals, ? is a finite set of constants called terminals, ? is a set of rewriting rules called productions, ? in is called the starting symbol. ( , , , )G N P S??N?PS N33 Syntactic Recognition of Strings String Grammars ? Object represented by its skeleton ? primitives. ? structure generated by using a regular string grammar a c b 34 Syntactic Recognition of Strings String Grammars ? Advantages: method may use to a more plex structure is a good method for character set ? Disadvantages: color is unable to recognize problem 35 Syntactic Recognition of Tree Grammars ? A tree grammar is defined as the 5tuple ? and are sets of nonterminals and terminals, respectively ? is the start symbol, which in general can be a tree ? is a set of productions of the form , where and are trees ? is a ranking function that denotes the number of direct descendants(offspring) of a node whose label is a terminal in the grammar ( , , , , )G N P r S??N ?SPijTT?iT jTr36 Syntactic Recognition of Tree Grammars ? Of particular relevance to our discussion are expansive tree grammars having productions of the form ? where are not terminals and k is a terminal 1 2 , ..., nX X X37 ? An object ? Primitives used for representing the skeleton by means of a tree grammar Syntactic Recognition of Tree Grammars a b c d e 38 Syntactic Recognition of Tree Grammars ? For example a b c d e 1(1) SaX? 11(2) XbX? 123(3) XcXX? 22(4) XdX?2(5)Xa?33(6) XeX?3(7)Xa? 39 Syntactic Recognition of Tree Grammars ? Advantages
法律信息相關(guān)推薦
鄂ICP備17016276號-1