This allows AGs to learn reusable sub-trees such as words, sequences of words, or smaller units such as Onsets and Codas.
while ordinary PCFGs have a finite number of parameters (one probability for each rule), Adaptor Grammars in addition have a parameter for every possible complete tree rooted in any of its adapted non-terminals, leading to a potentially infinite number of such parameters.