Because the derived f-descriptions can never be unsatisfiable (the string grammars do not contain atomic values), the f-structure constraints of the string grammars do not actually filter the language of the context-free grammar.
g and its string grammars must have the same language L(g) = L(String 1 (g)) = L(String 2 (g)).