Feature lattices for maximum entropy modelling

10Citations
Citations of this article
99Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Mikheev, A. (1998). Feature lattices for maximum entropy modelling. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 2, pp. 848–854). Association for Computational Linguistics (ACL). https://doi.org/10.3115/980691.980709

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free