In this paper, the recognition method of Hangout patterns with the partial separation for the subpatterns is proposed. First, Hangout patterns are formalized into six formal patterns and their surface structures are discriminated. Second, two to four subpatterns from one form pattern are separated by the new algorithm combined with Index mark and Window. Hangout patterns are recognized with only frontiers of the tree by defining the regular U-tree grammar for the separated subpatterns. Compared with the previous tree grammar , this grammar reduces the production rules to 1/3 and simplifies automaton processing and has more flexiblity. By the simulation result for 1,600 characters of Hangeul patterns, separation rate of subpatterns (24 or 44) is obtained 99.1% and recognition rate is obtained 100 %.