C86-1067 paths , the following heuristic search method is adopted . First , a path that
C02-1166 finally obtained for the different search methods . 4 Linguistic preprocessing
C02-1072 accuracy ratio of simple dictionary search method ( rs ) . And numbers in the other
A88-1033 variation of the A * best-first search method . See Nilsson ( 1980 ) for a
C69-5101 Binary Search Using the binary search method will yield a more satisfactory
D09-1059 Treebank We applied the bistratal search method in Algorithm 3 on the data from
D09-1059 , we propose a new approximate search method for bistratal dependency analysis
C69-5101 . This variation of the linear search method is called the single chain method
D09-1021 models . We describe approximate search methods that involve a significant extension
C94-2169 nm > mnpty set . This binary search method makes efficient retrieval possible
D08-1023 novel probabilistic inference and search methods for synchronous gram - mars .
D09-1059 bistratal dependency analysis . The search method is based on a beam search procedure
C04-1022 that the GA outperforms other search methods . The best language models all
C04-1152 accuracy over the current greedy search method . In ad - dition , we will investigate
C00-2151 . Both complete and heuristic search methods can be eml ) loyed to solve such
D09-1059 k-Best Dependency Parsing The search method commonly used in dependency parsers
C04-1168 function , we used Pow - ell 's search method to nd a solution . The Pow -
D09-1021 is NP-complete ) . Approximate search methods will be needed . The next two
C88-2164 Like gamblers , we tend to use search methods which are more or less risky
C04-1197 experiments . Note that ordinary search methods ( e.g. , beam search ) are not
hide detail