List of Figures

1. A simple type hierarchy.
2. A simple typed feature structure, represented as an AVM.
3. A simple typed feature structure, represented as a directed graph.
4. A subsumption example.
5. Structure sharing in a graph representation of a TFS.
6. Structure sharing in an AVM representation of a TFS.
7. The unification between a TFS and a cut TFS.
8. A Simple HPSG
9. A phrase rule in ALE.
10. Structure sharing between two typed feature structures (``external sharing'').
11. Structure sharing between two typed feature structures, after unification.
12. A phrase rule seen as a MRS.
13. A simple example of indexed chart parsing.
14. Quick check vectors
15. Static Cut - An Example.
16. An example of the applicability of Proposition 6.3.
17. An example of Proposition 6.3 limitation to $\vert[\widehat{x}]_{\bowtie} \cap \widehat{M}\vert = 1$.
18. An example of nodes in Case C of the proof for Proposition 6.6.
19. The encoding of TFSs as Prolog terms
20. The encoding of the TFS for the word mary as Prolog terms
21. Parsing times for EFD, EFD with positional indexing, and EFD with path indexing applied to the unconstrained MERGE grammar.
22. Parsing times for EFD, EFD with positional indexing, and EFD with path indexing applied to the constrained MERGE grammar.
23. Parsing times for EFD and EFD with quick-check applied to the unconstrained MERGE grammar. The sentence numbers are the same as those used in Figure 7.3.
24. Parsing times for EFD and EFD with quick-check applied to the constrained MERGE grammar. The sentence numbers are the same as those used in Figure 7.4.
25. Parsing times for EFD and EFD-indexing applied to the Alvey grammar.
26. Parsing times for EFD and EFD-indexing applied to CFGs with atomic categories.