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.

Sign up for GitHub

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

Jump to bottom

关于Top K问题 #3

Open

Nash-x9 opened this issue Sep 21, 2023 · 0 comments

Nash-x9 commented Sep 21, 2023

我的场景中符合匹配结果太多，分数相似且很高。
和大佬请教下思路，如果直接拼接，由于内容太长模型会报错。
如果使用文本分割，分别匹配又很容易让模型无法理解前后的逻辑关系，我应该从什么角度去突破呢？只能优化文本分割的逻辑吗？

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment