2002 · 100 citations · 11 references
ComputingComputer ScienceData ScienceData MiningMachine LearningStatistical ModelingEntropyHidden Markov ModelsLanguage ModelsPattern RecognitionFeature Tree RepresentationFeature TreesMax-entropyMaximum Entropy EstimationMaximum Entropy ModelingParse TreesSyntactic Parse Trees
An algorithm is proposed for maximum entropy modeling. It enables probabilistic modeling of complete structures, such as transition sequences in Markov models and parse trees, without dividing them into independent sub-events. A probabilistic event is represented by a feature forest, which is a packed representation of features with ambiguities. The parameters are efficiently estimated by traversing each node in a feature forest by dynamic programming. Experiments showed the algorithm worked efficiently even when ambiguities in a feature forest cause an exponential explosion of unpacked structures.
11
A Maximum Entropy Model for Part-Of-Speech Tagging
Adwait Ratnaparkhi · 1996 · 1.3K citations
Mitchell P. Marcus, Grace Kim, Mary Ann Marcinkiewicz et al. · 1994 · 751 citations · Full text