In this section, several problems related to parsing grammars based on typed feature structures are outlined. In the first subsection, the most well-known obstacles to efficient parsing with TFSGs are introduced, together with details about parsing with TFSGs. The second subsection presents a textbook parsing algorithm suitable for TFSGs, while the third section gives an overview of an efficient parsing algorithm used as baseline for the experimental evaluation in Chapter 7. Finally, a formal definition of the rule completion process in TFSG chart parsing is introduced.