Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Someone
on Sept 11, 2023
|
parent
|
context
|
favorite
| on:
Calculate the difference and intersection of any t...
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.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
For example, if you have words
there’s no need to repeat the “”, “ed”, “ing”, “s” parts.