This chapter introduces a general indexing method that can be applied to any chart-based parser. Without the loss of generality, and for preserving consistency, the chart parsing algorithm used for illustration here is an efficient algorithm based on EFD (Empty-First-Daughter) closure [Penn and Munteanu2003], implemented in Prolog. Before giving a detailed presentation of the proposed indexing method in Section 4.3, two additional concepts are introduced: a connection between parsing and typed feature structures and an indexing timeline that can be applied to any chart-based parser. The chapter concludes with an overview of related approaches to indexing/filtering TFSGs, accompanied by a discussion about advantages and disadvantages of the existing and proposed methods.