Algorithm 1: To build sequential lexicon

Input: Lexicon Trie T, the sequential character of Chinese sentence $C=\left(C_1,C_2,\dots ,C_n\right)$

Output: The k-th sequential lexicon $LS=\left(L{S}_1,L{S}_2,\dots ,L{S}_k\right)$

1.Initialize an empty list LC.

2.For each character c in C, do: build the first word list append to LC.

3.Initialize an empty list LS.

4.For each character c in C, do: use depth search algorithm DFS(index, current_sequence) to build sequential lexicon LS.