This paper tries to demonstrate that it is possible to set a standardized unified measurement of almost all types of linguistic complexity, in all languages, providing the use of a system of description and interpretation–i.e. the Defining Matrix Analysis (DMA) – which is founded on the remarkable metalinguistic function of natural languages which allow them to self- describe with their most common words through the building of equivalency classes in which the grammatical facts – the main source of complexity – are « uncomplexified » and measured in terms of regular reduction operations.