Pages that link to "Item:Q979181"

The following pages link to On the minimum description length complexity of multinomial processing tree models (Q979181):

Displaying 9 items.

• Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form (Q285951) (← links)
• The flexibility of models of recognition memory: an analysis by the minimum-description length principle (Q654392) (← links)
• Cognitive psychometrics: the scientific legacy of William H. Batchelder (1940--2018) (Q826953) (← links)
• The flexibility of models of recognition memory: the case of confidence ratings (Q899141) (← links)
• On the minimum description length complexity of multinomial processing tree models (Q979181) (← links)
• Selecting amongst multinomial models: an apologia for normalized maximum likelihood (Q2197107) (← links)
• Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004) (Q2348068) (← links)
• Model selection by minimum description length: lower-bound sample sizes for the Fisher information approximation (Q2513825) (← links)
• A context-free language for binary multinomial processing tree models (Q2654150) (← links)