Probabilistic logic with minimum perplexity: Application to language modeling

DOI10.1016/J.PATCOG.2004.12.009MaRDI QIDQ2485071zbMATH OpenOpenAlexFDO

Authors D. Bouchaffra

Publication date 3 August 2005

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2004.12.009

zbMATH Keywords

Maximum likelihood estimationProbabilistic logicEntropy maximizationStatistical language modelMinimum perplexityProbabilistic LogicSparseness problemWord trigrams

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Natural language processing (68T50)

Recommendations

• Publication:4942752
• Always Good Turing: asymptotically optimal probability estimation
• Exploiting syntactic, semantic, and lexical regularities in language modeling via directed Markov random fields
• A mathematical theory of communication
• A study on the cross-entropy method for rare-event probability estimation

Cites work

• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 1408945 (Why is no real title available?)
• 10.1162/153244303322533223
• Probabilistic logic
• Similarity-based models of word cooccurrence probabilities
• THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
• Theory and algorithms for analysing the consistent region in probabilistic logic

Cited in

(1)

• Min-based possibilisticDL-Lite

Describes a project that uses

Uses Software

• WordNet

This page was built for publication: Probabilistic logic with minimum perplexity: Application to language modeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485071)