W03-1306 normalized costs for approximate string searching . As the threshold increased
W03-1306 easily extended for approximate string searching . The method is illustrated in
C96-2200 practical situations in Chinese string searching . 2 . The Problem Directly using
W03-1306 Section 3 presents the approximate string searching algorithm for candidate recognition
W03-1306 We also present an approximate string searching method to alleviate the latter
W03-1306 performance by using the approximate string searching method described in Section 3
C96-2200 modifying the KMP for Chinese string searching . i I 12 3 14 5 \ -LSB- 6 7 \
C96-2200 function words ) . In Chinese string searching , this will happen for technical
W93-0115 The linguistic results from the string searching can be considerably deepened
W03-1306 dictionary and an approximate string searching tech - nique . In the second
W03-1306 different letters are 50 . 3.2 String Searching We have described a method for
W10-1907 " pattern match - ing " and " string searching " . Since the ROUGE metrics rely
W03-1306 String Searching A naive way for string searching using a dictionary is to conduct
W06-3208 applicable to noisy and limited data . String searching algorithms are used with information
P98-1010 McCreight , 1976 ) , which provide string searching in time which is linear in the
W06-3208 corpus , while MIND makes use of string searching algorithms and allows one to
W03-1306 , what we need is approximate string searching in which the recognizer scans
C96-2200 as characters . Two well-known string searching algorithms were discovered by
W03-1306 3.3 Implementation Issues for String Searching A naive way for string searching
C96-2200 2-byte characters . Thus , Chinese string searching algorithms have to deal with
hide detail