Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Question about Beam Search #219

Open
aqaqsubin opened this issue Aug 2, 2021 · 0 comments
Open

Question about Beam Search #219

aqaqsubin opened this issue Aug 2, 2021 · 0 comments

Comments

@aqaqsubin
Copy link

Hi, i really enjoyed your paper on text summarization using Bert model.

I have a question in this code.

On your paper, you said that you used beam search algorithm (beam size is 5) during decoding.
But I think, beam size is fixed on 1 in this code. (fast beam search)

Wouldn't using beam size of 1 in Abstractive summarization get worse results?
Wasn't there any affect on performance?

Thanks in advance

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant