Branch and Bound

AbstractGraph based dependency parsing is inefficient when handling non-local features due to high computational complexity of inference. In this paper, we proposed an exact and efficient decoding algorithm based on …...

Many models in NLP involve latent vari- ables, such as unknown parses, tags, or alignments. Finding the optimal model pa- rameters is then usually a difficult noncon- vex optimization problem. …...

This paper describes a method of multi- document summarization with evolutionary computation. In automatic document sum- marization, the method to make a summary by finding the best combination of important …...

We present a novel dependency pars- ing method which enforces two structural properties on dependency trees: bounded block degree and well-nestedness. These properties are useful to better represent the set …...