http://coling2016.anlp.jp/doc/tutorial/slides/T6/coling-succinct.pdf
Matthias Petri and Trevor Cohn
Detailed version: http://coling2016.anlp.jp/doc/tutorial/Tutorial-T6.pdf
Succinct data structures involve the use of novel data structures, compression technologies, and other mechanisms to allow data to be stored in extremely small memory or disk footprints, while still allowing for efficient access to the underlying data. They have successfully been applied in areas such as Information Retrieval and Bioinformatics to create highly compressible in-memory search indexes which provide efficient search functionality over datasets which traditionally could only be processed using external memory data structures.
Modern technologies in this space are not well known within the NLP community, but have the potential to revolutionise NLP, particularly the application to `big data’ in the form of terabyte and larger corpora. This tutorial will present a practical introduction to the most important succinct data structures, tools, and applications with the intent of providing the researchers with a jump-start into this domain. The focus of this tutorial will be efficient text processing utilising space efficient representations of suffix arrays, suffix trees and searchable integer compression schemes with specific applications of succinct data structures to common NLP tasks such as $n$-gram language modelling.