.png){kind=icon}
.png){kind=icon}
Return
Probabilistic logic with minimum perplexity: Application to language modeling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2004.12.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Any statistical model based on training encounters sparse configurations. These data are those that have not been encountered (or seen) during the training phase. This inherent problem is a big challenge to many scientific communities. The statistical estimation of rare events is usually performed through the maximum likelihood (ML) criterion. However, it is well-known that the ML estimator is sensitive to extreme values that is therefore non-reliable. To answer this challenge, we propose a novel approach based on probabilistic logic (PL) and the minimal perplexity criterion. In our approach, configurations are considered as probabilistic events such as predicates related through logical connectors. Our method was applied to estimate word trigram probability values from a corpus. Experimental results conducted on several test sets show that the PL method with minimal perplexity has outperformed both the Absolute Discounting, and the Good-Turing Discounting techniques. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
word trigrams
probabilistic logic
statistical language model
maximum likelihood estimation
sparseness problem
minimum perplexity
entropy maximization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available