Spell Checking Engine

A log parsing pipeline uses pattern matching with wildcard characters to classify log lines against template patterns, enabling structured log analysis without full regex overhead. Implement a pattern matcher where `.` (dot) matches exactly one character (any character). Given a `word` and a `pattern`, return whether the word fully matches the pattern. **Input:** `word` (string), `pattern` (string with `.` wildcards). **Output:** `True` if the word matches the pattern, `False` otherwise. **Key Rules:** - `.` matches exactly one character (not zero, not more than one) - The entire word must match the entire pattern (full match, not substring) - Use dynamic programming for O(n × m) time