In this paper, we study the word-representability of well-partitioned chordal graphs using split decomposition. We show that every component of the minimal split decomposition of a well-partitioned chordal graph is a split graph. Thus we have a characterization for word-representability of well-partitioned chordal graphs. As a consequence, we prove that the recognition of word-representability of well-partitioned chordal graphs can be done in polynomial time. Moreover, we prove that the representation number of a word-representable well-partitioned chordal graph is at most three. Further, we obtain a minimal forbidden induced subgraph characterization of circle graphs restricted to well-partitioned chordal graphs. Accordingly, we determine the class of word-representable well-partitioned chordal graphs having representation number exactly three.