Abstract
In this chapter, we present a statistical mechanical model of language acquisition and change at a mesoscopic level, and validate our model for the sound systems of the languages across the world. We show that the emergence of the linguistic diversity that exists across the consonant inventories of some of the major language families of the world can be explained through a complex network based growth model, which has only a single tunable parameter that is meant to introduce a small amount of randomness in the otherwise preferential attachment based growth process. The experiments with this model parameter indicates that the choice of consonants among the languages within a family are far more preferential than it is across the families. Furthermore, our observations indicate that this parameter might bear a correlation with the period of existence of the language families under investigation. These findings lead us to argue that preferential attachment seems to be an appropriate high level abstraction for language acquisition and change.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A bipartite network is a special kind of network which can be partitioned into two distinct and mutually exclusive sets of nodes such that edges run only between nodes from two different partitions. There are no edges connecting two nodes in the same partition.
- 2.
A random variable is said to have a β-distribution with parameters α > 0 and β > 0 if and only if its probability mass function is given by, f(x)\(= \frac{\Gamma (\alpha +\beta )} {\Gamma (\alpha )\Gamma (\beta )}{x}^{\alpha -1}{(1 - x)}^{\beta -1}\) for 0 < x < 1 and f(x) = 0 otherwise. Γ(\(\cdot \)) is the Euler’s gamma function.
- 3.
Mean error is defined as the average difference between the ordinate pairs (say y and y ′) where the abscissas are equal. In other words, if there are Y such ordinate pairs then the mean error can be expressed as \(\frac{\sum \limits \mid y-{y}^{\prime}\mid } {Y }\).
- 4.
As one can see in Fig. 5, the analytical solution arrived at by assuming that all language nodes have the same degree μ is qualitatively similar to the degree distribution of real PlaNet, though a poorer match to it when we comapre the simulation with exact degrees of the language nodes.
- 5.
As explained in [40], when \(\gamma \geq (N/\mu ) - 1\) all the almost all the language nodes connect to the same set μ consonant nodes making other consonants virtually inexistant. For such a situation to arise for PLaNet, γ had to be greater than or equal to 25.
- 6.
Most of the information has been collected from the Ethnologue: http://www.ethnologue.com/ and the World Atlas of Language Structures: http://wals.info/
- 7.
Interestingly, while preparing this set of Indo-European languages from UPSID, we did not find English.
References
Abramowitz, M., & Stegun, I. (Eds.). (1974). Handbook of mathematical functions. New York: Dover Publications.
Albert, R., & Barabási, A. L. (2000). Topology of evolving networks: Local events and universality. Physical Review Letters, 85, 5234–5237.
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000). Classes of small-world networks. Proceedings of the National Academy of Sciences, 97, 11149–11152.
Anderson, H. (1989). Markedness theory: The first 150 years. In O. M. Tomic (Ed.), Markedness in synchrony and diachrony (pp. 11–46). Berlin: Mouton de Gruyter.
Balter, M. (2003). Early date for the birth of indo-european languages. Science, 302(5650), 1490.
Barabási, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509–512.
Barabási., A. L., Jeong, H., Ravasz, R., Néda, Z., Vicsek, T., & Schubert, A. (2002). On the topology of the scientific collaboration networks. Physica A, 311, 590–614.
Blevins, J. (2004). Evolutionary phonology: the emergence of sound patterns. Cambridge/ New York: Cambridge University Press.
Boersma, P. (1998). Functional phonology. The Hague: Holland Academic Graphics.
Bulmer, M. G. (1979). Principles of statistics. New York: Dover Publications.
Bybee, J. L. (1995). Diachronic and typological properties of morphology and their implications for representation. In L. B. Feldman (Ed.), Morphological aspects of language processing (pp. 225–246). Hillsdale: Lawrence Erlbaum Associates.
Caldarelli, G., & Catanzaro, M. (2004). The corporate boards networks. Physica A, 338, 98–106.
Choudhury, M., and Mukherjee, A. (2009). The Structure and Dynamics of Linguistic Networks. In Dynamics on and of Complex Networks: Applications to Biology, Computer Science, Economics, and the Social Sciences, Ganguly, N., Deutsch, A., and Mukherjee, A., (eds.), Birkhauser, Springer, Boston, 145–166, ISBN: 978-0-8176-4750-6.
Clements, G. N. (2008). The role of features in speech sound inventories. In E. Raimy & C. Cairns (Eds.), Contemporary views on architecture and representations in phonological theory. Cambridge, MA: MIT Press.
de Boer, B. (1999). Self-organisation in vowel systems. Ph.D. thesis, AI Lab, Vrije Universiteit Brussel.
Dorogovtsev, S. N., & Mendes, J. F. F. (2003). Evolution of networks: From biological nets to the internet and WWW. Oxford: Oxford University Press.
Eubank, S., Guclu, H., Kumar, V. S. A., Marate, M. V., Srinivasan, A., Toroczkai, Z., & Wang, N. (2004). Modelling disease outbreaks in realistic urban social networks. Nature, 429, 180–184.
Evans, T. S., & Plato, A. D. K. (2007). Exact solution for the time evolution of network rewiring models. Physical Review E, 75, 056101.
Ferrer-i-Cancho, R., & Solé, R. V. (2001). The small world of human language. Proceedings of The Royal Society of London. Series B, Biological Sciences, 268(1482), 2261–2265.
Guillaume, J. L., & Latapy, M. (2004). Bipartite structure of all complex networks. Information Processing Letters, 90(5), 215–221.
Hayes, B. (2004). Phonological acquisition in optimality theory: The early stages. In R. Kager, W. Zonneveld, & J. Pater (Eds.), Fixing priorities: Constraints in phonological acquisition. Cambridge: Cambridge University Press.
Hinskens, F., & Weijer, J. (2003). Patterns of segmental modification in consonant inventories: A cross-linguistic study. Linguistics, 41(6), 1041–1084.
Hughes, B. D. (1995). Random walks and random environments: Random walks (Vol. 1). New York: Oxford Science Publications.
Ke, J., Ogura, M., & Wang, W. S.-Y. (2003). Optimization models of sound systems using genetic algorithms. Computational Linguistics, 29(1), 1–18.
Ladefoged, P., & Maddieson, I. (1996). The sounds of the world’s languages. Oxford: Blackwell.
Lambiotte, R., & Ausloos, M. (2005). N-body decomposition of bipartite networks. Physical Review E, 72, 066117.
Liljencrants, J., & Lindblom, B. (1972). Numerical simulation of vowel quality systems: The role of perceptual contrast. Language, 48, 839–862.
Lindblom, B. (1986). Phonetic universals in vowel systems. In J. J. Ohala & J. J. Jaeger (Eds.), Experimental phonology (pp. 13–44). Orlando, FL: Academic.
Lindblom, B., & Maddieson, I. (1988). Phonetic universals in consonant systems. In M. Hyman & C. N. Li (Eds.), Language, speech, and mind (pp. 62–78). London/New York: Routledge
Maddieson, I. (1980). Working Papers in Phonetics (UCLA N050). Los Angeles: Department of Linguistics, University of California
Maddieson, I. (1984). Patterns of sounds. Cambridge/New York: Cambridge University Press.
Maddieson, I. (1999). In search of universals. In Proceedings of the XIVth International Congress of Phonetic Sciences (pp. 2521–2528). Berkley: University of California
Mukherjee, A., Choudhury, M., Basu, A., and Ganguly, N. (2008). Modeling the Structure and Dynamics of the Consonant Inventories: A Complex Network Approach , In the proceedings of COLING(08), 601–608, Manchester
Newman, M. E. J. (2001). Scientific collaboration networks. Physical Review E, 64, 016131.
Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45(2), 167–256.
Ohkubo, J., Tanaka, K., & Horiguchi, T. (2005). Generation of complex bipartite graphs by using a preferential rewiring process. Physical Review E, 72, 036120.
Oudeyer, P.-Y. (2006). Self-organization in the evolution of speech. Oxford: Oxford University Press.
Peltomäki, M., & Alava, M. (2006). Correlations in bipartite collaboration networks. Journal of Statistical Mechanics: Theory and Experiment, 1, P01010.
Pericliev, V., & Valdés-Pérez, R. E. (2002). Differentiating 451 languages in terms of their segment inventories. Studia Linguistica, 56(1), 1–27.
Peruani, F., Choudhury, M., Mukherjee, A., & Ganguly, N. (2007). Emergence of a non-scaling degree distribution in bipartite networks: A numerical and analytical study. Europhysics Letters, 79(2), 28001.
Prince, A., & Smolensky, P. (2004). Optimality theory: Constraint interaction in generative grammar. Malden/Oxford: Wiley-Blackwell.
Ramasco, J. J., Dorogovtsev, S. N., & Pastor-Satorras, R. (2004). Self-organization of collaboration networks. Physical Review E, 70, 036106.
Schwartz, J.-L., Boë, L.-J., Vallée, N., & Abry, C. (1997). The dispersion-focalization theory of vowel systems. Journal of Phonetics, 25, 255–286.
Simon, H. A. (1955). On a class of skew distribution functions. Biometrika, 42, 425–440.
Sneppen, K., Rosvall, M., Trusina, A., & Minnhagen, P. (2004). A simple model for self-organization of bipartite networks. Europhysics Letters, 67, 349–354.
Souma, W., Fujiwara, Y., & Aoyama, H. (2003). Complex networks and economics. Physica A, 324, 396–401.
Strogatz, S. H. (2001). Exploring complex networks. Nature, 410, 268–276.
Trubetzkoy, N. (1931). Die phonologischen systeme. TCLP, 4, 96–116.
Trubetzkoy, N. (1969). Principles of phonology. Berkeley: University of California Press.
Wang, W. S.-Y. (1971). The basis of speech. In C. E. Reed (Ed.), The learning of language. New York: Appleton-Century-Crofts
Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442.
Zipf, G. K. (1949). Human behaviour and the principle of least effort. Cambridge, MA: Addison-Wesley.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix: Derivation of the Analytical Solution
Appendix: Derivation of the Analytical Solution
We shall solve the model for μ = 1 and then generalize for the case μ > 1. Please refer to Sects. 5 and 6 for explanation of the model and the notations used.
1.1 Solution for μ = 1
Since μ = 1, at each time step a node in the V L partition essentially brings a single incoming edge as it enters the system. The evolution of p k, t can be expressed as
where \(\widetilde{P}(k,t)\) refers to the probability that the incoming edge lands on a consonant node of degree k at time t. \(\widetilde{P}(k,t)\) can be easily derived for μ = 1 using together the Eqs. 2 and 3 and takes the form
for t > 0 while for t = 0, \(\widetilde{P}(k,t) = \frac{1} {N}{\delta }_{k,0}\).
Equation 6 can be explained as follows. The probability of finding a consonant node with degree k at time t + 1 decreases due to those nodes, which have a degree k at time t and receive an edge at time t + 1 therefore acquiring degree k + 1, i.e., \(\widetilde{P}(k,t){p}_{k,t}\). Similarly, this probability increases due to those nodes that at time t have degree k − 1 and receive an edge at time t + 1 to have a degree k, i.e., \(\widetilde{P}(k - 1,t){p}_{k-1,t}\). Hence, the net increase in the value of p k, t + 1 can be expressed by the Eq. 6.
In order to have an exact analytical solution of the Eq. 6 we express it as a product of matrices
where p t denotes the degree distribution at time t and is defined as \({\mathbf{p}}_{t} = {[{p}_{0,t}\ {p}_{1,t}\ {p}_{2,t}\ \ldots ]}^{T}\) (T stands for the standard transpose notation for a matrix), p 0 is the initial condition expressed as p 0 = [1 0 0 …]T and M τ is the evolution matrix at time τ which is defined as
Let us further define a matrix H t as follows.
Thus we have,
Since our initial condition (i.e., p 0) is a matrix of zeros at all positions except the first row therefore, all the relevant information about the degree distribution of the consonant nodes is encoded by the first column of the matrix H t . The (k + 1)th element of this column essentially corresponds to p k, t . Let the entry corresponding to the ith row and the jth column of H t and M t be denoted by \({h}_{i,j}^{t}\) and \({m}_{i,j}^{t}\) respectively. On successive expansion of H t using the recursive definition provided in Eq. 11, we get (see Fig. 7 for an example)
or,
Since the first column of the matrix H t encodes the degree distribution, it suffices to calculate the values of \({h}_{i,1}^{t}\) in order to estimate p k, t . In fact, p k, t (i.e., the \({(k + 1)}^{\mathrm{th}}\) entry of H t ) is equal to \({h}_{k+1,1}^{t}\). In the following, we shall attempt to expand certain values of \({h}_{k+1,1}^{t}\) in order to detect the presence of a pattern (if any) in these values. In particular, let us investigate two cases of \({h}_{2,1}^{1}\) and \({h}_{2,1}^{2}\) from Fig. 7. We have
or,
Similarly,
or,
A closer inspection of Eqs. 16 and 18 reveals that the pattern of evolution of this row, in general, can be expressed as
for 0 ≤ k ≤ t and p k, t  = 0 otherwise. Further, we define the special case \(\prod \limits _{z=0}^{-1}(\ldots \,) = 1\). Note that if we now put t = 2, k = 1 and t = 3, k = 1 in (19) we recover Eqs. 16 and 18 respectively.
Equation 19 is the exact solution of the Eq. 6 for the initial condition \({p}_{k,t=0} = {\delta }_{k,0}\). Therefore, this is the analytical expression for the degree distribution of the consonant nodes in PlaNet theo for μ = 1.
In the limit \(\gamma \rightarrow 0\) (i.e. when the attachments are completely random) Eq. 19 takes the form
for \(0 \leq k \leq t\) and p k, t  = 0 otherwise.
On the other hand, when \(\gamma \rightarrow \infty \) (i.e., when the attachments are completely preferential) the degree distribution of the consonant nodes reduces to
1.2 Solution for μ > 1
In the previous section, we have derived an analytical solution for the degree distribution of the consonant nodes in PlaNet theo specifically for μ = 1. However, note that the value of μ is greater than 1 (approximately 21) for the real network (i.e., PlaNet). Therefore, one needs to analytically solve for the degree distribution for values of μ greater than 1 in order to match the results with the empirical data. Here we attempt to generalize the derivations of the earlier section for μ > 1.
We assume that \(\mu \ll N\) (which is true for PlaNet) and expect Eq. 6 to be a good approximation for the case of μ > 1 after replacing \(\widetilde{P}(k,t)\) by \(\widehat{P}(k,t)\) where \(\widehat{P}(k,t)\) is defined as
The term μ appears in the denominator of the Eq. 22 for \(0 \leq k \leq \mu t\) because, in this case the total degree of the consonant nodes in PlaNet theo at any point in time is μt rather than t as in Eq. 7. The numerator contains a μ since at each time step there are μ edges that are being incorporated into the network rather than a single edge.
The solution of Eq. 6 with the attachment kernel defined in Eq. 22 can be expressed as
for \(0 \leq k \leq \mu t\) and p k, t  = 0 otherwise.
Given that \(\mu \ll N\) we can neglect the term containing μ ∕ N in the Eq. 23 and express the rest using factorials as
where \(\eta = N/\mu \gamma \). Approximating the factorials using Stirling’s formula (see [1] for a reference), we get
where
is a term independent of k.
Since we are interested in the asymptotic behavior of the network such that t is very large, we may assume that \(t \gg k \gg \eta > {\gamma }^{-1}\). Under this assumption, we can re-write the Eq. 25 in terms of the fraction k ∕ t and this immediately reveals that the expression is approximately a β-distribution in k ∕ t. More specifically, we have
where B(z; α, β) refers to a β-distribution over variable z. We can generate different distributions by varying the value of γ in Eq. 27. We can further compute P k, t (i.e. the cumulative degree distribution) using Eqs. 1 and 27 together.
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mukherjee, A., Choudhury, M., Ganguly, N., Basu, A. (2013). Language Dynamics in the Framework of Complex Networks: A Case Study on Self-Organization of the Consonant Inventories. In: Villavicencio, A., Poibeau, T., Korhonen, A., Alishahi, A. (eds) Cognitive Aspects of Computational Language Acquisition. Theory and Applications of Natural Language Processing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31863-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31863-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31862-7
Online ISBN: 978-3-642-31863-4
eBook Packages: Computer ScienceComputer Science (R0)