A context-free language for binary multinomial processing tree models
From MaRDI portal
Publication:2654150
DOI10.1016/J.JMP.2009.07.009zbMATH Open1200.62137OpenAlexW2058559520MaRDI QIDQ2654150FDOQ2654150
Authors: Brendan P. Purdy, William H. Batchelder 
Publication date: 15 January 2010
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2009.07.009
Recommendations
- On the minimum description length complexity of multinomial processing tree models
- scientific article; zbMATH DE number 2090198
- Tree models and (labeled) categorial grammar
- Stochastic inference of regular tree languages
- Multiple context-free tree grammars: lexicalization and characterization
- A tree-height hierarchy of context-free languages
- scientific article; zbMATH DE number 17561
- Context-free grammars on trees
- Binary Tree Code Words as Context-Free Languages
- Multiple context-free tree grammars and multi-component tree adjoining grammars
Applications of graph theory (05C90) Applications of statistics to psychology (62P15) Linguistics (91F20)
Cites Work
- The Bayesian Choice
- Title not available (Why is that?)
- Mathematical and statistical methods for genetic analysis.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree inference with factors selectively influencing processes in a processing tree
- Parallel concepts in graph theory
- The statistical analysis of a model for storage and retrieval processes in human memory
- On the minimum description length complexity of multinomial processing tree models
- Title not available (Why is that?)
- On certain formal properties of grammars
- Model selection based on minimum description length
- Representing parametric order constraints in multi-trial applications of multinomial processing tree models
- Title not available (Why is that?)
- The mathematics of language
- The statistical analysis of general processing tree models with the EM algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Grammar-Oriented Enumeration of Binary Trees
Cited In (9)
- Cognitive psychometrics: the scientific legacy of William H. Batchelder (1940--2018)
- Tree inference: selective influence in multinomial processing trees with supplementary measures such as response time
- Representing probabilistic models of knowledge space theory by multinomial processing tree models
- Selecting amongst multinomial models: an apologia for normalized maximum likelihood
- Bayesian estimation of multinomial processing tree models with heterogeneity in participants and items
- On the minimum description length complexity of multinomial processing tree models
- Beta-MPT: multinomial processing tree models for addressing individual differences
- Binary Tree Code Words as Context-Free Languages
- Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)
Uses Software
This page was built for publication: A context-free language for binary multinomial processing tree models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654150)
