The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algorithms for bigram and trigram word clustering
Open accessAbstract
In this paper, we describe an efficient method for obtaining word classes for class language models. The method employs an exchange algorithm using the criterion of perplexity improvement. The novel contributions of this paper are the extension of the class bigram perplexity criterion to the class trigram perplexity criterion, the description of an efficient implementation for speeding up the clustering process, the detailed computational complexity analysis of the clustering algorithm, and, finally, experimental results on large text corpora of about 1, 4, 39 and 241 million words including examples of word classes, test corpus perplexities in comparison to word language models, and speech recognition results.
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
(1992) · doi:10.5555/176313.176316 · Cited by 2,892
On structuring probabilistic dependences in stochastic language modelling
Ney, H., Essen, U., & Kneser, R. (1994) · Computer Speech & Language · doi:10.1006/csla.1994.1001 · Cited by 517
Self-citation
Cited by
(2010) · Cited by 1,906
From Feedforward to Recurrent LSTM Neural Networks for Language Modeling
Sundermeyer, M., Ney, H., & Schluter, R. (2015) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2015.2400218 · Cited by 507
Self-citationInteracting with computers by voice: automatic speech recognition and synthesis
O'Shaughnessy, D. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.817117 · Cited by 132
Automatic Speech Recognition With Very Large Conversational Finnish and Estonian Vocabularies
Enarvi, S., Smit, P., Virpioja, S., & Kurimo, M. (2017) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2017.2743344 · Cited by 33
“of the objective function can be done in O(NC ), and thus one word iterated in O(N 2 C ) time [17].”
BackgroundClass n-Gram Models for Very Large Vocabulary Speech Recognition of Finnish and Estonian
Varjokallio, M., Kurimo, M., & Virpioja, S. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-45925-7_11 · Cited by 6
Metadata
- Authors
- Martin, S., Liermann, J., & Ney, H.
- Venue
- Speech Communication
- Publisher
- Elsevier BV
- Published
- 1998-04
- Volume
- 24
- Issue
- 1
- Pages
- 19-37
- ISSN
- 0167-6393 (ISSN-L)
- OpenAlex
- W2080018251
- Cited by
- 191
- References
- 2
- FWCI
- 5.25
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithms for bigram and trigram word clustering. https://app.cochat.ai/papers/10.1016/s0167-6393(97)00062-9
- The paper
- Martin, S., Liermann, J., & Ney, H. (1998). Algorithms for bigram and trigram word clustering. Speech Communication. https://doi.org/10.1016/s0167-6393(97)00062-9
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.