Temporal Pooling (TP) is a recent technique for processing temporal events by forming declarative representations of the complete sequences. In this paper, we examine and extend the functionality of the existing TP algorithm from the Hierarchical Temporal Memory (HTM) framework and introduce the Self-Organising Temporal Pooling (SOTP) architecture. The SOTP draws together the Merge Self-Organising Map (MSOM) and a new algorithm termed the Modified Temporal Pooler (MTP) to produce functionality not yet seen in a TP. This new architecture is shown to be capable of producing stable declarative representations of sequences that activate consistently for each item in that sequence.