The SigMod paper describes a more compact FST implementation looks really interesting:
http://www.cs.cmu.edu/~huanche1/publications/surf_paper.pdf (reference implementation: https://github.com/efficient/SuRF) Was wondering if Lucene's FST implementation used by term dictionary can take advantage of this. Thanks -John
