private static boolean matchesSeq(String[] words, String[]... sequence) {
		// If there aren't enough words to possibly
		// match the sequence, return false
		if(words.length < sequence.length) {
			return false;
		}

		// For each item in the sequence, ensure the
		// word is one of the possibilities given
		for(int i = 0; i < sequence.length; i++) {
			String word = words[i];
			String[] possibilities = sequence[i];
			// If it isn't, return false
			if(!matchesAny(word, possibilities)) {
				return false;
			}
		}

		// If each item in the sequence
		// had a match, return true
		return true;
	}