Paper: Generalized Hebbian Algorithm For Incremental Singular Value Decomposition In Natural Language Processing

ACL ID E06-1013
Title Generalized Hebbian Algorithm For Incremental Singular Value Decomposition In Natural Language Processing
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 2006
Authors

An algorithm based on the Generalized Hebbian Algorithm is described that allows thesingular valuedecomposition of a dataset to be learned based on single observation pairs presented seri- ally. The algorithm has minimal mem- ory requirements, and is therefore in- teresting in the natural language do- main, where very large datasets are of- ten used, and datasets quickly become intractable. The technique is demon- strated on the task of learning word and letter bigram pairs from text.