2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/150984The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour of such parsers.8 pages, LaTeX source (one figure not included) To appear in ACL-94Computation and Languagetext