2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/151105We present a parsing algorithm with polynomial time complexity for a large subset of V-TAG languages. V-TAG, a variant of multi-component TAG, can handle free-word order phenomena which are beyond the class LCFRS (which includes regular TAG). Our algorithm is based on a CYK-style parser for TAGs.4 pages, uuencoded compressed ps fileComputation and Languagetext