The above example 18 shows how our model handles commas in conjunctions of 2 or more phrases.
the possibleū values are characterized not by a lattice but by a cyclic WFSA (as |u i | is unbounded whenever |x i | > 0).