3 ms·
>A prefix tree for searches? Done, but that didn't need well formed text/strings for it to work. I think this does need "well formed" strings and the complexit
by PeCaN 7y ago
>A prefix tree for searches? Done, but that didn't need well formed text/strings for it to work.
I think this does need "well formed" strings and the complexities of Unicode. Is a a prefix of ä? Is 앉 a prefix of 앉다?
- taeric 7y agoIn my case, I was fine with binary prefixes. And searches don't even need Unicode to get difficult. Consider: to, two, too, 2, and II. Should those all find each other? Highly dependent on context. And likely you will be reimplementing NLP before you realize it.
- naniwaduni 7y agoEven worse: is ff a prefix of ffi?