New Algorithm

It is fairly common that different people are associated with the same name. In tracking person entities in a large document pool, it is important to determine whether multiple mentions …...

We propose a new algorithm to approximately extract top-scoring hypotheses from a hyper- graph when the score includes an N–gram language model. In the popular cube prun- ing algorithm, every …...