Coarse to Fine Pruning
method
ID: coarsetofinepruning
Related Papers
A Constrained Viterbi Relaxation for Bidirectional Word Alignment
Bidirectional models of word alignment are an appealing alternative to post-hoc combinations of directional word align- ers. Unfortunately, most bidirectional formulations are NP-Hard to solve, and a previous attempt to …...
Sparser, Better, Faster GPU Parsing
Due to their origin in computer graph- ics, graphics processing units (GPUs) are highly optimized for dense problems, where the exact same operation is applied repeatedly to all data points. …...