This is part of the last sentence under the section on BFS-based construction, hyperlink.

I believe they talk about having $O(n \log k)$ instead of $O(m \log k)$, where $n$ is the number of vertices in the trie.