Feature Lattices for Maximum Entropy Modelling

Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. The iterative scaling algorithm that is used for the parameter estimation is computationally expensive while the feature selection process might require to estimate parameters for many candidate features many times. In this paper we present a novel approach for building maximum entropy models. Our approach uses the feature collocation lattice and builds complex candidate features without resorting to iterative scaling.

• Type: Conference
• Year: 1998
• Where: ACL
• Authors: Andrei Mikheev
• Keywords: ACL 1998, ACL 2007, Iterative Scaling, Maximum Entropy, Maximum Entropy Framework