How is semantic caching different from a normal exact-match cache key?

A normal cache only hits if the new request is byte-for-byte identical to a previous one. Semantic caching embeds the incoming query and checks for high similarity against previously cached queries, so a rephrased question ('What's Java's garbage collector?' vs 'How does GC work in Java?') can still hit the cache even though the literal text differs.