| W09-0107 | parse from the parse forest , a | best-first search algorithm | is applied . The algorithm consults |
| W07-2201 | from the compact parse forest , a | best-first search algorithm | is ap - plied . The algorithm |
| E09-1093 | parse from the parse forest , a | best-first search algorithm | is applied . The algorithm consults |
| E09-1069 | Another possibility is to use the | best-first search algorithm | . The best-first parser has a |
| J15-2004 | expectation . Beam search is a | best-first search algorithm | that explores at most K paths |
| E03-1017 | this paper , we have presented a | best-first search algorithm | for producing referring expressions |
| W13-2249 | wrapper paradigm and using the | best-first search algorithm | to explore the feature space |
| P03-1012 | alignment space . Instead , we use a | best-first search algorithm | ( with constant beam and agenda |
| C90-3071 | fragment analyses and using a | best-first search algorithm | in the parser . The reference |
| E03-1017 | dictionary plus POS tagger . <title> A | Best-First Search Algorithm | for Generating Referring Expressions |
| E03-1017 | control regimes , we propose a | best-first searching algorithm | for uniquely identifying sets |
| H91-1066 | the input . The matching uses a | best-first search algorithm | , where the " best " match is |
| W98-1422 | trees where unifiable ) and the | best-first search algorithm | is a general framework for handling |
| P12-1030 | evaluation function , f ( s ) . A | best-first search algorithm | iteratively removes the best |
| J15-3005 | parameters . In contrast , our | best-first search algorithm | can not find an output in reasonable |
| J15-3005 | we propose a learning-guided , | best-first search algorithm | for application of discriminative |
| E03-1017 | Algorithm at a Glance Basically , the | best-first search algorithm | is a generalization of the incremental |
| D10-1047 | prediction prob - lem . A * is a | best-first search algorithm | which can efficiently find the |
| C04-1171 | paradigms , we have developed a | best-first searching algorithm | that avoids the major deficit |
| W98-0508 | Determinism was accomplished with a | Best-First search algorithm | which implements syntactic heuristics |
