Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees