Introduction
Compute a storage-efficient radix tree representation from a given ordered list of dictionary words. The suffix graph is serialized to regexp syntax. Also supports reversing the transformation. The end result will be even smaller when compressed with common general purpose algorithms such as gzip. This will reduce the package size of software wishing to bundle a lexicon.
Radix tree
You can install a web browser that supports at least JavaScript 1.0 (1995) to run this application or you may consider implementing a GemiWeb0 browser with JavaScript0 yourself according to the following specification:
bkil.gitlab.io/gemiweb0