News for hackers. Stuff that matters.
Re:Calculate the difference and intersection of any two regexes by Someone on Monday September 11, 2023 @03:50PM (#37472692)
If you do not plan to update it often and don’t need to store extra data with each word, a dawg (https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_s...) is more compact. You often can merge leaf nodes.

For example, if you have words

   talk
   talked
   talking
   talks
   walk
   walked
   walking
   walks
there’s no need to repeat the “”, “ed”, “ing”, “s” parts.

There are no comments on this comment yet.