We define two new statistics on words: the k-connector and the gk-connector. For a word $π= π_1π_2\cdotsπ_n$ of length $n$ over the alphabet $[k]$, a k-connector is defined as an ordered pair $(π_j, π_{j+1})$ where $1 \leq j \leq n-1$ and $π_j + π_{j+1} = k$. Conversely, a gk-connector is defined as an ordered pair $(π_j, π_{j+1})$ where $1 \leq j \leq n-1$ and $π_j + π_{j+1} > k$. We investigate the enumeration of partitions based on these statistics, providing generating functions and explicit formulas.