2 ms·
I was reading a distinction between recognising parts of a string, and changing parts. Such that I can't remember the last time I modified a string. I can thi
by taeric 7y ago
I was reading a distinction between recognising parts of a string, and changing parts. Such that I can't remember the last time I modified a string. I can think of plenty of times I took one apart and used a piece of it. Usually well structured to avoid the corner cases. Or, again, forced into a madlibs style structure to present to the user.
But yeah, looking for palindromes is a thing I can't recall ever having done. A prefix tree for searches? Done, but that didn't need well formed text/strings for it to work.
- 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?