| KALIF HARDCORE vs Kazuya | 11–7 | 61.11% |
| KALIF HARDCORE vs Jin | 11–6 | 64.71% |
| KALIF HARDCORE vs King | 11–1 | 91.67% |
| KALIF HARDCORE vs Reina | 5–4 | 55.56% |
| KALIF HARDCORE vs Leo | 7–1 | 87.50% |
| KALIF HARDCORE vs Victor | 6–2 | 75.00% |
| KALIF HARDCORE vs Eddy | 4–4 | 50.00% |
| KALIF HARDCORE vs Steve | 4–3 | 57.14% |
| KALIF HARDCORE vs Paul | 4–2 | 66.67% |
| KALIF HARDCORE vs Law | 3–2 | 60.00% |
| KALIF HARDCORE vs Fahkumram | 3–2 | 60.00% |
| KALIF HARDCORE vs Xiaoyu | 2–2 | 50.00% |
| KALIF HARDCORE vs Miary Zo | 2–2 | 50.00% |
| KALIF HARDCORE vs Yoshimitsu | 3–0 | 100.00% |
| KALIF HARDCORE vs Hwoarang | 1–2 | 33.33% |
| KALIF HARDCORE vs Jack-8 | 2–1 | 66.67% |
| KALIF HARDCORE vs Devil Jin | 2–1 | 66.67% |
| KALIF HARDCORE vs Lili | 1–2 | 33.33% |
| KALIF HARDCORE vs Dragunov | 3–0 | 100.00% |
| KALIF HARDCORE vs Nina | 1–2 | 33.33% |
| KALIF HARDCORE vs Kuma | 2–1 | 66.67% |
| KALIF HARDCORE vs Asuka | 2–0 | 100.00% |
| KALIF HARDCORE vs Lars | 2–0 | 100.00% |
| KALIF HARDCORE vs Alisa | 0–2 | 0.00% |
| KALIF HARDCORE vs Panda | 0–2 | 0.00% |
| KALIF HARDCORE vs Jun | 2–0 | 100.00% |
| KALIF HARDCORE vs Azucena | 2–0 | 100.00% |
| KALIF HARDCORE vs Heihachi | 0–2 | 0.00% |
| KALIF HARDCORE vs Clive | 0–2 | 0.00% |
| KALIF HARDCORE vs Bryan | 1–0 | 100.00% |
| KALIF HARDCORE vs Leroy | 0–1 | 0.00% |
Limitations
This data is often requested to give insight into which characters you have more trouble with than others, but it is not particularly helpful for that. The main issue is that it is heavily skewed by how strong the opponents you play are.
For example, this data suggests my worst matchup is clearly vs Reina, but that's just because most of those games are vs Yagami.
There is a way to account for this being worked on. The central idea is to assign each matchup a rating vs you which adjusts based on the result, much like the regular rating but also based on the rating of each player. With this, it would give a better summary of how well you perform vs each character.
In the meantime, this page is here to present the data as requested.