| P10-2030 | annotators have . We presented an | incremental procedure | to speed up rule extraction . |
| C04-1044 | , is a good complement to the | incremental procedure | . 5.2 Bottom-up procedure We |
| D14-1178 | novel technique that adapts an | incremental procedure | for the construction of i1 normed |
| J00-3002 | Catalunya We describe a left-to-right | incremental procedure | for the processing of Lambek |
| C04-1044 | 6.1 Incremental procedure The | incremental procedure | ( IP ) results are given in Figure |
| C04-1044 | number of possible taggings ) . 6.1 | Incremental procedure | The incremental procedure ( IP |
| C04-1044 | used as a second step after the | incremental procedure | , it gives interesting results |
| C00-2151 | this is welcome behavior : The | incremental procedure | takes longer only in those cases |
| C04-1044 | nondeterministic . The interest of the | incremental procedure | is that it is global to the sentence |
| P09-1039 | constraints , eliminating the need for | incremental procedures | like the cutting-plane algorithm |
| W99-0307 | atop-down , bottom-up , or an | incremental procedure | ? • How does the genre |
| C00-2151 | . The run-time required by the | incremental procedure | as a percentage of the time required |
| J00-3002 | Lambek 1958 ) . We argue that an | incremental procedure | of proof net construction affords |
| C04-1044 | in the abstract formalism : an | incremental procedure | which is speci c to the destructuring |
| W97-0123 | feature selection process is an | incremental procedure | that builds up S by successively |
| P98-2214 | and Berger et al. ( 1996 ) is an | incremental procedure | that builds up S by successively |
| C04-1044 | formalisms and abstractions . 5.1 | Incremental procedure | We choose polarization followed |
| P99-1017 | is the re-orientation from an | incremental procedure | to a more static ` overview ' |
| W13-0110 | Non-incremental estimation Using this | incremental procedure | , we use the estimates from previous |
