2007
DOI: 10.1109/tasl.2007.900090
|View full text |Cite
|
Sign up to set email alerts
|

Kneser–Ney Smoothing With a Correcting Transformation for Small Data Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…A number of smoothing algorithms for LM has been investigated. In the literature, a number of smoothing techniques can be seen including Additive smoothing [8], Good-Turing [17], Jelinek-Mercer and Katz smoothing [8], Witten-Bell smoothing [8], Absolute Discounting [13], Kneser Ney [1] and Latent Dirichlet Allocation (LDA) [3]. As per literature survey.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A number of smoothing algorithms for LM has been investigated. In the literature, a number of smoothing techniques can be seen including Additive smoothing [8], Good-Turing [17], Jelinek-Mercer and Katz smoothing [8], Witten-Bell smoothing [8], Absolute Discounting [13], Kneser Ney [1] and Latent Dirichlet Allocation (LDA) [3]. As per literature survey.…”
Section: Introductionmentioning
confidence: 99%
“…Kneser Ney smoothing technique has been evolved from Absolute Discounting technique [13] which assimilates the information of both higher order and lower order of the gram to assign the probability. It relies on the context of the gram to assign the probability.…”
Section: Introductionmentioning
confidence: 99%