C04-1067 segmentation system using the well-known maximum matching method . Character Tagging A
C02-1148 technique we employed was the standard maximum matching dictionary based approach . The
E06-1019 size is 40 . Match : The weighted maximum matching algorithm ( West , 2001 ) . This
C04-1067 processing using heuristic rules . Maximum Matching The same system used in the Chinese
D08-1111 the most commonly used , such as maximum matching . They firstly segment sentences
C04-1067 used by the hybrid method and Maximum Matching are constructed from all the
E06-1019 2005 ) , and approximations to maximum matching like competitive linking ( Melamed
C96-1035 ab " is a 2-character word and maximum matching moves on to " c " . If it can
C96-1035 assumed a 1-character word and maximum matching moves on to " b " . If a match
C04-1067 well-balanced . The results of Maximum Matching and Character Tagging show the
D13-1045 annotated tokens , and find the maximum matching annotated token ( line 1 to line
E06-1019 space methods include weighted maximum matching ( Taskar et al. , 2005 ) , and
D14-1093 second matching scheme is backward maximum matching , which can be treated as the
C02-1148 accuracy control By using the forward maximum matching segmentation strategy with the
C96-1035 Chinese Word Segmentation based on Maximum Matching and Word Binding Force </title>
D13-1045 assigned the attribute label of the maximum matching annotated token ( line 6 to line
C04-1067 which was discussed in Section 3 . Maximum Matching is word-based and has the higher
E06-1019 this objective function and the maximum matching algorithm . Our two experiments
C04-1067 . As a dictionary for ChaSen , Maximum Matching and the hybrid method , we use
D14-1093 which is very close to the forward maximum matching algorithm of Wu and Tseng ( 1993
hide detail