We investigate a structural subclassification of twin prime pairs based on intersections between two modular quadruplet configurations, an admissible (2, 4, 2) prime pattern and a complimentary forbidden quadruplet pattern eliminated modulo 3. We define an overlap counting function ��(��) measuring the number of twin primes up to �� arising from such structural intersections and compare it to the total twin prime count ��(��). Computational data up to ��=3×1011 shows that the ratio ��(��)=��(��) ��(��) increases from approximately 0.4 at 103 to approximately 0.6568 at 3×1011. We prove that the structural configurations underlying the overlap occur infinitely often as arithmetic patterns and that ��(��)→∞ ���� ��→∞. We do not prove infinitude of twin primes nor do we establish a limiting value of ��(��). However, the data suggests that the overlap subclass forms a substantial and stable proportion of observed twin primes at large computational scales. This work provides an empirical decomposition of twin primes that they may compliment probabilistic models such as the Hardy-Littlewood heuristic.