Fast algorithm for entropy estimation

Е. А. Тимофеев, Alexei Kaltchenko · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2013

Proposed is a new fast algorithm for entropy estimation of a given input word. The algorithm utilizes k-nearest neighbor search of a given dictionary. The time complexity of the search is independent of the dictionary size.

Read the paper · More papers on PaperTik