The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Similarity-Based Models of Word Cooccurrence Probabilities
Open accessAbstract
In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine which of the two word combinations “eat a peach” and ”eat a beach” is more likely. Statistical NLP methods determine the likelihood of a word combination from its frequency in a training corpus. However, the nature of language is such that many word combinations are infrequent and do not occur in any given corpus. In this work we propose a method for estimating the probability of such previously unseen word combinations using available information on “most similar” words.We describe probabilistic word association models based on distributional word similarity, and apply them to two tasks, language modeling and pseudo-word disambiguation. In the language modeling task, a similarity-based model is used to improve probability estimates for unseen bigrams in a back-off language model. The similarity-based method yields a 20% perplexity improvement in the prediction of unseen bigrams and statistically significant reductions in speech-recognition error.We also compare four similarity-based estimation methods against back-off and maximum-likelihood estimation methods on a pseudo-word sense disambiguation task in which we controlled for both unigram and bigram frequency to avoid giving too much weight to easy-to-disambiguate high-frequency configurations. The similarity-based methods perform up to 40% better on this particular task.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
(1992) · doi:10.5555/176313.176316 · Cited by 2,892
Cited by
From Frequency to Meaning: Vector Space Models of Semantics
Turney, P. D., & Pantel, P. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2934 · Cited by 2,866
Evaluating WordNet-based Measures of Lexical Semantic Relatedness
Budanitsky, A., & Hirst, G. (2006) · Computational Linguistics · doi:10.1162/089120106776173093 · Cited by 1,448
KEYWORD EXTRACTION FROM A SINGLE DOCUMENT USING WORD CO-OCCURRENCE STATISTICAL INFORMATION
MATSUO, Y., & ISHIZUKA, M. (2004) · International Journal on Artificial Intelligence Tools · doi:10.1142/s0218213004001466 · Cited by 788
Measures of distributional similarity
Lee, L. (1999) · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - · doi:10.3115/1034678.1034693 · Cited by 583
Self-citationA word at a time: computing word relatedness using temporal semantic analysis
Radinsky, K., Agichtein, E., Gabrilovich, E., & Markovitch, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963455 · Cited by 405
Metadata
- Authors
- Dagan, I., Lee, L., & Pereira, F. C. N.
- Venue
- Machine Learning
- Published
- 1999-02
- Volume
- 34
- Issue
- 1-3
- Pages
- 43-69
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1593239840
- Cited by
- 375
- References
- 3
- FWCI
- 15.06
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Similarity-Based Models of Word Cooccurrence Probabilities. https://app.cochat.ai/papers/10.1023/a:1007537716579
- The paper
- Dagan, I., Lee, L., & Pereira, F. C. N. (1999). Similarity-Based Models of Word Cooccurrence Probabilities. Machine Learning. https://doi.org/10.1023/a%3A1007537716579
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.