efficient parsing of highly ambiguous context-free grammars with bit vectors an efficient bit-vector-based cky-style parser for context-free parsing is presented. the parser computes a compact parse forest representation of the complete set of possible analyses for large treebank grammars and long input sentences. the parser uses bit-vector operations to parallelise the basic parsing operations. the parser is particularly useful when all analyses are needed rather than just the most probable one. we apply the viterbi algorithm, exploiting its ability to deal with highly-ambiguous grammars. |