Fast Searching on Large Lexicons for Post-processing on Handwriting Recognition

This paper presents a novel data structure for representing large lexicons, that allows fast searches. It is based on the concept of directly addressing a table (Existence Table) in which there is a slot of 1 bit for each word on the lexicon. To obtain a small table, succesive reductions of the number of bits used to represent each word are done by using look-up tables (Translation Tables). The data structure is very flexible, and can be used not only for English lexicons, but also for those with large data sets like Japanese or Chinese.