Citazioni |
 |
A grammar is said to meet the true generalization condition if each MS rule represents a true generalization about the (fully specified) systematic phonemic matrices of the language. That is, given any (fully specified) systematic phonemic matrix S and any MS rule R, it must not be the case that SD(R) is a sub-matrix of S when SC(R) is not, for in such a case the rule R would be making a false statement about S. - Stanley (2004), a pag.72
|