An approach to measuring complexity within the boundaries of a natural language fuzzy grammar

Abstract

This paper presents an approach to evaluate complexity by means of a Natural Language Fuzzy Grammar. Frequently, Linguistics has described a natural language grammar by means of discrete terms. However, a grammar can be explained in terms of degrees by following the concepts of linguistic gradience & fuzziness. Understanding a grammar as a fuzzy or gradient object allows us to establish degrees of grammaticality for every linguistic input. This shall be meaningful for linguistic complexity considering that the less grammatical an input is the more complex its processing will be. From this regard, an input’s degree of complexity is always going to depend on its grammar. The bases of the natural language fuzzy grammar are shown here. Some of these are described by Fuzzy Type Theory. The linguistic inputs are characterized by constraints through a Property Grammar.