{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T19:15:13Z","timestamp":1784920513129,"version":"3.55.0"},"reference-count":22,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T00:00:00Z","timestamp":1427241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The complexity of the description of a system is a function of the entropy of its symbolic description. Prior to computing the entropy of the system\u2019s description, an observation scale has to be assumed. In texts written in artificial and natural languages, typical scales are binary, characters, and words. However, considering languages as structures built around certain preconceived set of symbols, like words or characters, limits the level of complexity that can be revealed analytically. This study introduces the notion of the fundamental description scale to analyze the essence of the structure of a language. The concept of Fundamental Scale is tested for English and musical instrument digital interface (MIDI) music texts using an algorithm developed to split a text in a collection of sets of symbols that minimizes the observed entropy of the system. This Fundamental Scale reflects more details of the complexity of the language than using bits, characters or words. Results show that this Fundamental Scale allows to compare completely different languages, such as English and MIDI coded music regarding its structural entropy. This comparative power facilitates the study of the complexity of the structure of different communication systems.<\/jats:p>","DOI":"10.3390\/e17041606","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T11:53:17Z","timestamp":1427284397000},"page":"1606-1633","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Fundamental Scale of Descriptions for Analyzing Information Content of Communication Systems"],"prefix":"10.3390","volume":"17","author":[{"given":"Gerardo","family":"Febres","sequence":"first","affiliation":[{"name":"Laboratorio de Evoluci\u00f3n, Universidad Sim\u00f3n Bol\u00edvar, Sartenejas, Baruta, Miranda, 1080, Venezuela"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus","family":"Jaffe","sequence":"additional","affiliation":[{"name":"Laboratorio de Evoluci\u00f3n, Universidad Sim\u00f3n Bol\u00edvar, Sartenejas, Baruta, Miranda, 1080, Venezuela"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2015,3,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1142\/S0219525904000068","article-title":"Multiscale Complexity\/Entropy","volume":"7","year":"2004","journal-title":"Adv. Complex Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1002\/cplx.21437","article-title":"Computationally tractable pairwise complexity profile","volume":"18","author":"Harmon","year":"2013","journal-title":"Complexity"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0375-9601(95)00867-5","article-title":"Statistical Measure Of Complexity","volume":"209","author":"Lopez","year":"1995","journal-title":"Phys. Lett. A"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/cplx.20249","article-title":"An information-theoretic primer on complexity, self-organisation and emergence","volume":"15","author":"Prokopenko","year":"2008","journal-title":"Complexity"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Gell-mann, M. (1995). What is Complexity? Remarks on simpicity and complexity by the Nobel Prize-winning author of. The Quark and the Jaguar. Complexity, 1.","DOI":"10.1002\/cplx.6130010105"},{"key":"ref_6","unstructured":"Kontoyiannis, I. (1997). The Complexity and Entropy of Literary Styles, Department of Statistics, Stanford University."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1142\/S0219525902000493","article-title":"Entropic Analysis of the Role of Words in Literary Texts","volume":"5","author":"Montemurro","year":"2002","journal-title":"Adv. Complex Syst."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Savoy, J. (2015). Text Clustering\u202f: An Application with the State of the Union Addresses. J. Assoc. Inf. Sci. Technol.","DOI":"10.1002\/asi.23283"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Febres, G., Jaff\u00e9, K., and Gershenson, C. (2014). Complexity measurement of natural and artificial languages. Complexity.","DOI":"10.1002\/cplx.21529"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.physa.2009.10.013","article-title":"Entropic descriptor of a complex behaviour","volume":"389","author":"Piasecki","year":"2010","journal-title":"Physica A"},{"key":"ref_11","unstructured":"Funes, P. Available online: www.cs.brandeis.edu\/~pablo\/complex.maker.html."},{"key":"ref_12","unstructured":"Zipf, G.K. (1949). Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology, Addison-Welesly."},{"key":"ref_13","first-page":"180","article-title":"Zipf \u2019s Law","volume":"10","author":"Kirby","year":"1985","journal-title":"J. Naval Sci"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-44686-9_33","article-title":"Zipf and Heaps Laws\u2019 Coefficients Depend on Language","volume":"2004","author":"Gelbukh","year":"2001","journal-title":"Comput. Linguist. Intell. Text Process"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Savoy, J. (2015). Vocabulary Growth Study\u202f: An Example with the State of the Union Addresses. J. Quant. Linguist., in press.","DOI":"10.1080\/09296174.2015.1106270"},{"key":"ref_16","unstructured":"Febres, G., and Jaff\u00e9, K. (2014). Quantifying literature quality using complexity criteria, Arxiv, 1401.7077."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00107510500052444","article-title":"Power laws, Pareto distributions and Zipf\u2019s law","volume":"46","author":"Newman","year":"2005","journal-title":"Contemp. Phys."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Chomsky, N. (1957). Syntactic Structures, Mouton.","DOI":"10.1515\/9783112316009"},{"key":"ref_19","unstructured":"Sipser, M. (2006). Introduction to the Theory of Computation, Thomson Course Technology."},{"key":"ref_20","unstructured":"Flesch, R. (1951). How to Test Readability, Harpe & Brothers."},{"key":"ref_21","unstructured":"Febres, G. Available online: www.gfebres.com\\F0IndexFrame\\F132Body\\F132BodyPublications\\MoNET\\MultiscaleStructureModeller.pdf."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/09296174.2013.830551","article-title":"Authorship Attribution Using Entropy","volume":"20","author":"Grabchak","year":"2013","journal-title":"J. Quant. Linguist"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/4\/1606\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:43:57Z","timestamp":1760215437000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/17\/4\/1606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,25]]},"references-count":22,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,4]]}},"alternative-id":["e17041606"],"URL":"https:\/\/doi.org\/10.3390\/e17041606","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,25]]}}}