code: def match_pattern_seq(self, pat, const):
          
          segs = [self.fts(s) for s in const]
          if len(pat) != len(segs):
              return False
          else:
              return all([set(p) <= s for (p, s) in zip(pat, segs)])
docs: Implements limited pattern matching. Matches just in case pattern is
          the same length (in segments) as the constituent and each of the
          segments in the pattern is a featural subset of the corresponding
          segment in the word.
  
          Args:
              pat (list): pattern consisting of a list of sets of (value, feature)
                          tuples.
              const (list): a sequence of Unicode IPA strings consisting of zero
                            or more segments.
  
          Returns:
              bool: `True` if `const` matches `pat`