| J93-4001 | ) . The major disadvantage of | factored extraction | is that no pruning is done in |
| J93-4001 | lowest mean value appears for | factored extraction | with the modified grammar and |
| J93-4001 | very similar to the factoring in | factored extraction | , except that we are no longer |
| J93-4001 | advantage of factored pruning over | factored extraction | is that we can prune , although |
| J93-4001 | because it is almost as fast as | factored extraction | but is much less sensitive to |
| J93-4001 | - ing , factored pruning , and | factored extraction | strategies discussed above . |
| J93-4001 | This effect is strongest for the | factored extraction | algorithm since inconsistencies |
| J93-4001 | pruning have been obtained . The | factored extraction | strategy exhibits the most interesting |
| J93-4001 | the effect of adding pruning to | factored extraction | without losing its noncopying |
| J93-4001 | preliminary measurements to suggest that | factored extraction | may give better overall results |
| J93-4001 | factoring . We call this strategy a | factored extraction | strategy because it extracts |
| J93-4001 | adding functional pruning to the | factored extraction | algorithm so that it would be |
| J93-4001 | between sentences . However , | factored extraction | is very sensitive to the amount |
| J93-4001 | only as a point of reference . | Factored extraction | is the only other interface strategy |
| J93-4001 | caches solutions on each edge . 5 . | Factored Extraction | We now examine an interface algorithm |
