Probabilistic logic with minimum perplexity: Application to language modeling

DOI10.1016/J.PATCOG.2004.12.009zbMATH Open1101.68804OpenAlexW2024114337MaRDI QIDQ2485071FDOQ2485071

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

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

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)

Cites Work

• THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
• Title not available (Why is that?)
• Probabilistic logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Similarity-based models of word cooccurrence probabilities
• 10.1162/153244303322533223
• Theory and algorithms for analysing the consistent region in probabilistic logic

Cited In (1)

• Min-based possibilisticDL-Lite

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)