I don't understand your numbers. LCSS is O(N*M), so
Time for lcss comparing the two complete sentences
= 123*53
= 6,519
Time for lcss comparing the powerset of segments
= (10+2+2+4+2+2+2+2+2+3) * (7+3+3+3+2+4)
= 31*22
= 682
In reply to Re^2: LCS efficiency problem
by ikegami
in thread LCS efficiency problem
by zhe
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |