Determine the maximum length of a subsequence from one string that is also a substring of another string. A subsequence of a string is created by removing zero or more characters from it, while a substring consists of consecutive characters from the string.

Given two strings x and y, determine the length of the longest subsequence of x that is also a substring of y.