A context-free language for binary multinomial processing tree models
Probabilistic binary multinomial processing tree models (BMPTs) are described for categorical data, in which the observed category is a result of occurrence or non-occurrence of some latent binary events. The correspondence between them is described by a binary tree in which the events are the internal nodes while the categories are leafs. An axiomatic theory of BMPTs is developed and a context-free language is proposed for the description of BMPT models. Identifiability of some subclasses of BMPT models and their enumeration are discussed. Some computational algorithms are considered for binary tree plotting with MATLAB software.
- 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
- Grammar-Oriented Enumeration of Binary Trees
- scientific article; zbMATH DE number 3148408 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1912149 (Why is no real title available?)
- scientific article; zbMATH DE number 3251418 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3342611 (Why is no real title available?)
- Mathematical and statistical methods for genetic analysis.
- Model selection based on minimum description length
- On certain formal properties of grammars
- On the minimum description length complexity of multinomial processing tree models
- Parallel concepts in graph theory
- Representing parametric order constraints in multi-trial applications of multinomial processing tree models
- The Bayesian Choice
- The mathematics of language
- The statistical analysis of a model for storage and retrieval processes in human memory
- The statistical analysis of general processing tree models with the EM algorithm
- Tree inference with factors selectively influencing processes in a processing tree
- 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
- Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)
- Bayesian estimation of multinomial processing tree models with heterogeneity in participants and items
- Binary Tree Code Words as Context-Free Languages
- Cognitive psychometrics: the scientific legacy of William H. Batchelder (1940--2018)
- Beta-MPT: multinomial processing tree models for addressing individual differences
- On the minimum description length complexity of multinomial processing tree models
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)
