Shrinking a 250K-word dictionary to 500KB: from tries to DAWGs to succinct bit-packed trees

Shrinking a 250K-word dictionary to 500KB: from tries to DAWGs to succinct bit-packed trees If you are building a word game for the browser, you are fighting a constant battle against the "bundle size tax." When you need to validate moves against a s...