ps_nbest(ps_decoder_t * ps) stuck

[Carlo Benussi]

I am trying to get the first 3 nbest hypothesis after a recognition. I do it like the following:

    ps_nbest_t *nbest = ps_nbest(m_pPs1);
    for (int k = 0; ((k < m_NBestTill) && nbest); k++)
    {
        int score;
        const char *hyp = ps_nbest_hyp(nbest, &score);
        nbest = ps_nbest_next(nbest);
    }
    if (nbest) ps_nbest_free(nbest);

m_NBestTil is set to 3 in this case.

I found out that for some grammars that allow indefinite repetitions (with the char *), the function ps_nbest(ps_decoder_t * ps) just get stuck and runs forever.

It is possible to set the start_node and end_node like in the deprecated version ps_nbest (ps_decoder_t *ps, int sf, int ef, char const *ctx1, char const *ctx2)? I would like to bound this research.

[Nickolay V. Shmyrev]

I found out that for some grammars that allow indefinite repetitions (with the char *), the function ps_nbest(ps_decoder_t * ps) just get stuck and runs forever.

You need to provide an example to reproduce this issue in order to let us solve this bug.