## Appendix A The Fundamental Scale Algorithm Pseudo-Code
\begin{tabular}{|c c c c|c c c c c|} \hline Rank & Symbol & Probability & Occurrence & Length & Rank & Symbol & Probability & Occurrence & Length \\ \hline



& 0.00815 & 690 & 1 & 72 & \({}^{\circ}\)@ & 0.00078 & 66 & 2 \\
23 & = & 0.00801 & 678 & 1 & 73 & w & 0.00073 & 62 & 1 \\
24 & O & 0.00773 & 654 & 1 & 74 & \({}^{\circ}\)\({}_{2}\) & 0.00070 & 59 & 1 \\
25 & V & 0.00748 & 633 & 1 & 75 & \$ & 0.00064 & 54 & 1 \\
26 & K & 0.00746 & 631 & 1 & 76 & & 0.00064 & 54 & 1 \\
27 & \(\bar{\rm a}\) & 0.00671 & 568 & 1 & 77 & & 0.00063 & 53 & 1 \\
28 &, & 0.00658 & 557 & 1 & 78 & & 0.00057 & 48 & 1 \\
29 & 4 & 0.00635 & 537 & 1 & 79 & & 0.00057 & 48 & 1 \\
30 & \(\%\) & 0.00600 & 508 & 1 & 80 & & 0.00056 & 47 & 8 \\
31 & Z & 0.00594 & 503 & 1 & 81 & \(\bar{\rm u}\) & 0.00054 & 46 & 1 \\
32 & 7 & 0.00590 & 499 & 1 & 82 & & 0.00054 & 46 & 4 \\
33 & G & 0.00582 & 492 & 1 & 83 & \(\cdot\) & 0.00054 & 46 & 1 \\
34 & I & 0.00576 & 488 & 1 & 84 & & 0.00053 & 44 & 4 \\
35 & \({}^{\circ}\) & 0.00517 & 438 & 1 & 85 & \(\Box\) & 0.00050 & 43 & 1 \\
36 & \(\&\) & 0.00454 & 385 & 1 & 86 & & 0.00050 & 43 & 1 \\
37 & F & 0.00426 & 360 & 1 & 87 & 4\(\%\)4 & 0.00049 & 41 & 4 \\
38 & R & 0.00410 & 347 & 1 & 88 & \(f\) & 0.00048 & 41 & 1 \\
39 & X & 0.00409 & 346 & 1 & 89 & & 0.00047 & 40 & 0 \\
40 & & 0.00401 & 340 & 1 & 90 & \(\overline{\rm u}\) & 0.00047 & 40 & 1 \\
41 & * & 0.00369 & 312 & 1 & 91 & \(\overline{\rm u}\) & 0.00047 & 40 & 1 \\
42 & & 0.00345 & 292 & 1 & 92 & let & 0.00046 & 39 & 1 \\
43 & S & 0.00323 & 274 & 1 & 93 & \(\cdot\) & 0.00044 & 37 & 1 \\
44 & T & 0.00322 & 273 & 1 & 94 & nn & 0.00044 & 37 & 1 \\
45 & \(\cdot\) & 0.00320 & 271 & 1 & 95 & \(\bar{\rm a}\)\({}^{3}\) & 0.00043 & 37 & 2 \\
46 & H & 0.00318 & 269 & 1 & 96 & \({}^{\circ}\)@\({}^{3}\) & 0.00043 & 36 & 3 \\
47 & f & 0.00302 & 255 & 1 & 97 & \(\bar{\rm A}\) & 0.00042 & 36 & 1 \\
48 & M & 0.00299 & 253 & 1 & 98 & i & 0.00042 & 36 & 1 \\
49 & U & 0.00285 & 241 & 1 & 99 & \(\cdot\)/\(\cdot\)/\(\cdot\) & 0.00038 & 32 & 4 \\
50 & & 0.00285 & 241 & 1 & 100 & v & 0.00038 & 32 & 1 \\ \hline \end{tabular} 

## Conflicts of Interest

The authors declare no conflict of interest. ## References

* [PERSON] and Multiscale Complexity/Entropy (2004) [PERSON] Multiscale Complexity/Entropy. _Adv. Complex Syst._**2004**, \(7\), 47-63. * [PERSON] et al. (2013) [PERSON]; [PERSON]; [PERSON] Computationally tractable pairwise complexity profile. _Complexity_**2013**, _18_, 20-27. * [PERSON] et al. (1995) [PERSON]; [PERSON]; [PERSON] Statistical Measure Of Complexity. _Phys. Lett. A_**1995**, _209_, 321-326. * [PERSON] et al. (2008) [PERSON]; [PERSON]; [PERSON] An information-theoretic primer on complexity, self-organisation and emergence. _Complexity_**2008**, _15_, 11-28. * [PERSON] (1995) [PERSON] What is Complexity? Remarks on simpicity and complexity by the Nobel Prize-winning author of _The Quark and the Jaguar. Complexity_**1995**, \(1\), doi:10.1002/cplx.6130010105. * [PERSON] (1997) [PERSON] _The Complexity and Entropy of Literary Styles_; NSF Technical Report No. 97; Department of Statistics, Stanford University: Stanford, CA, USA, 1997; pp. 1-15. * [PERSON] and [PERSON] (2002) [PERSON]; [PERSON] Entropic Analysis of the Role of Words in Literary Texts. _Adv. Complex Syst._**2002**, \(5\), 7-17. * [PERSON] (2015) [PERSON] Text Clustering : An Application with the State of the Union Addresses. _J. Assoc. Inf. Sci. Technol._**2015**, doi:10.1002/asi.23283. * [PERSON] et al. (2014) [PERSON]; [PERSON]; [PERSON] Complexity measurement of natural and artificial languages. _Complexity_**2014**, doi:10.1002/cplx.21529. * [PERSON] and [PERSON] (2010) [PERSON]; [PERSON] [PERSON] Entropic descriptor of a complex behaviour. _Physica A_**2010**, _389_, 397-407. * [PERSON] (2015) [PERSON] Complexity measures for complex systems and complex objects. Available online: www.cs.brandeis.edu/~pablo/complex.maker.html (accessed on 19 March 2015).