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

计算左右熵算法问题 #12

Open
BucherLi opened this issue Dec 21, 2018 · 1 comment
Open

计算左右熵算法问题 #12

BucherLi opened this issue Dec 21, 2018 · 1 comment

Comments

@BucherLi
Copy link

假设有两个词串分别是[a,b,c]和[b,c,a],[a,b,c]在计算左熵的时候会转换成b->c->a存储到树中,[b,c,a]在顺序存储的时候也会转换成b->c->a存储到树中,那么这个时候计算bc的左熵的时候会有问题把,额外把a的次数多加了一。

@zhanzecheng
Copy link
Owner

Hi BucherLi,

感谢你的问题,十分抱歉这么久才回复。
我们使用isback()函数来区分这种情况。

Best,
Zecheng

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

2 participants