P84-1049 was correct at first choice ( no back-tracking ) in 94 % of sentences . Allowing
A97-2013 into Perl scripts , which perform back-tracking search on the input text . MOP
C04-1129 be considered equivalent to a back-tracking step . We rede ne the criteria
P98-1102 meta-interpreter . This basic back-tracking constraint satisfaction strategy
C80-1004 all the tried rules fail , start back-tracking . step 3 : tree building upward
P84-1049 rejected by subsequent analysis , back-tracking occurs and searches for the next
P97-1026 without need for sophisticated back-tracking ( Elhadad and Robin , 1992 )
E97-1026 without need for sophisticated back-tracking ( Elhadad and Robin , 1992 )
H92-1067 entire utterance can be obtained by back-tracking . The recognition algorithm can
N06-2033 over the input string with no back-tracking , making decisions based on the
P84-1049 % of sentences . Allowing one back-tracking yeilded 98 % , two back - trackings
C92-4184 stat ~ meat . It is essentially a back-tracking algorithm , but it prunes unpromising
J85-1003 sub ) TS , and uses a built-in back-tracking mechanism to find the first path
C80-1076 through a pinhole the user can avoid back-trackings of dialog listings while keeping
N03-3009 by false starts , hesitations , back-trackings , and interjections ; however
P10-1028 the end-position of Q. Then , by back-tracking the most probable bi-phrase boundaries
hide detail