Pattern substring bijection

Given a pattern of lowercase letters and a string s, return true if there is a bijection between letters in pattern and non-empty substrings of s such that replacing each pattern letter with its substring yields exactly s. The mapping must be one-to-one in both directions (no two letters map to the same substring, and each letter maps to exactly one substring). Both inputs have length 1..20.