| P97-1056 | the same ordering as the Naive | Back-off algorithm | ( table 1 ) . In Figure 1 this |
| E97-1056 | the same ordering as the Naive | Back-off algorithm | ( table 1 ) . In Figure 1 this |
| P06-2067 | and the corresponding SCFs . The | Back-off Algorithm | always starts with the longest |
| P06-2067 | Hypothesis Test ( Brent , 1993 ) and a | back-off algorithm | ( Sarkar and Zeman , 2000 ) . |
| P97-1056 | importance , we call this the Naive | Back-off algorithm | . Usually , not all features |
| E97-1056 | importance , we call this the Naive | Back-off algorithm | . Usually , not all features |
| P97-1056 | specificity ordering as the Naive | Back-off algorithm | already performs quite well in |
| E97-1056 | specificity ordering as the Naive | Back-off algorithm | already performs quite well in |
| W02-0504 | we have n't seen , and a simple | back-off algorithm | to tell us how to distribute |
| W03-2508 | predictions are generated by a | back-off algorithm | , which consults both the word |
| P06-2067 | an SCC being a valid SCF . 2 . | Back-off Algorithm | : Many SCCs generated by the |
| W02-1905 | answer-points using the following | back-off algorithm | based on the processing results |
| W97-1016 | exactly to the behavior of the | Back-Off algorithm | of Collins and Brooks ( 1995 |
| J05-3004 | make no assigment and stop . The | back-off algorithm | algoWeb ∗ v1 uses baselineSTR |
| J05-3004 | make no assignment and stop . The | back-off algorithm | algoWN ∗ v1 uses baselineSTR |
