Ah, I think I see the problem. The current regex manifestation method is only recursing to two levels, and your credit card's pattern is at the third level.

``` ruby
    def manifest_regex
      @schema["definitions"].each do |_, type_schema|
        type_schema["definitions"].each do |_, property_schema|
          if pattern = property_schema["pattern"]
            property_schema["pattern"] = Regexp.new(pattern)
          end
        end
      end
    end
```

@naaman What do you think about changing `manifest_regex` to be a recursive method instead of using `match`? Theoretically it should be descending the schema tree as far down as necessary.