A Bayesian framework for word segmentation: Exploring the effects of context
Open accessThe DOI matches its Crossref record; 87 of the 87 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949 · cited 2×
“We used a method known as Gibbs sampling (Geman and Geman, 1984), a type of Markov chain Monte Carlo algorithm (Gilks et al., 1996) in which variables are repeatedly sampled from their conditional posterior distribution given the current values of all other variables in the model.”
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0082 · Cited by 12,223
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Sequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366
Cited by
How to grow a mind: Statistics, structure, and abstraction
Tenenbaum, J. B., Kemp, C., Griffiths, T. L., & Goodman, N. D. (2011) · Science · doi:10.1126/science.1192788 · Cited by 1,815
Self-citationA tutorial on Bayesian nonparametric models
Gershman, S. J., & Blei, D. M. (2012) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2011.08.004 · Cited by 605
Probabilistic models of cognition: exploring representations and inductive biases
Griffiths, T. L., Chater, N., Kemp, C., Perfors, A., & Tenenbaum, J. B. (2010) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2010.05.004 · Cited by 568
Self-citationA tutorial introduction to Bayesian models of cognitive development
Perfors, A., Tenenbaum, J. B., Griffiths, T. L., & Xu, F. (2011) · Cognition · doi:10.1016/j.cognition.2010.11.015 · Cited by 304
Self-citationErickson, L. C., & Thiessen, E. D. (2015) · Developmental Review · doi:10.1016/j.dr.2015.05.002 · Cited by 273
The extraction and integration framework: A two-process account of statistical learning
Thiessen, E. D., Kronstein, A. T., & Hufnagle, D. G. (2013) · Psychological Bulletin · doi:10.1037/a0030801 · Cited by 202
“Despite this expansion, however, virtually all of the models advanced to explain statistical learning have focused on conditional statistical learning (e.g., Goldwater et al., 2009; Orbán et al., 2008; Perruchet & Vinter, 1998).”
BackgroundThe computational nature of memory modification
Gershman, S. J., Monfils, M.-H., Norman, K. A., & Niv, Y. (2017) · eLife · doi:10.7554/elife.23763 · Cited by 172
“Simplicity principle : sensory inputs tend to be generated by a small (but possibly unbounded) number of latent causes.”
BackgroundMethodSymbol emergence in robotics: a survey
Taniguchi, T., Nagai, T., Nakamura, T., Iwahashi, N., Ogata, T., & Asoh, H. (2016) · Advanced Robotics · doi:10.1080/01691864.2016.1164622 · Cited by 150
Discovering latent causes in reinforcement learning
Gershman, S. J., Norman, K. A., & Niv, Y. (2015) · Current Opinion in Behavioral Sciences · doi:10.1016/j.cobeha.2015.07.007 · Cited by 151
One model for the learning of language
Yang, Y., & Piantadosi, S. T. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2021865119 · Cited by 50
“137.”
Beguš, G. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.03.017 · Cited by 42
Collective predictive coding hypothesis: symbol emergence as decentralized Bayesian inference
Taniguchi, T. (2024) · Frontiers in Robotics and AI · doi:10.3389/frobt.2024.1353870 · Cited by 28
“Although word units can be discovered from character strings usingunsupervisedlearning(Goldwater et al.,2009;Mochihashi et al., 2009), such approaches have been extended to consider speech input as an observation.”
BackgroundWord Segmentation on Discovered Phone Units With Dynamic Programming and Self-Supervised Scoring
Kamper, H. (2023) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2022.3229264 · Cited by 24
“(phoneme or phone sequences) [2], [3], [4].”
BackgroundMethodAction chunking as conditional policy compression
Lai, L., Huang, A. Z., & Gershman, S. J. (2022) · doi:10.31234/osf.io/z8yrv · Cited by 9
“While our work is unique in that it addresses how action chunking varies as a function of memory constraints, some related work has explored how memory resource limitations affect word segmentation (Goldwater et al., 2009; Frank et al., 2010).”
Metadata
- Authors
- Goldwater, S., Griffiths, T. L., & Johnson, M.
- Venue
- Cognition
- Publisher
- Elsevier BV
- Published
- 2009-07
- Volume
- 112
- Issue
- 1
- Pages
- 21-54
- ISSN
- 0010-0277 (ISSN-L)
- OpenAlex
- W2126377586
- Cited by
- 431
- References
- 87
- FWCI
- 54.21
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.