Modeling Cross-linguistic Relationships Across Consonant Inventories: A Complex Network Approach.

Slides:



Advertisements
Similar presentations
The Robert Gordon University School of Engineering Dr. Mohamed Amish
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Mustafa Cayci INFS 795 An Evaluation on Feature Selection for Text Clustering.
How to Schedule a Cascade in an Arbitrary Graph F. Chierchetti, J. Kleinberg, A. Panconesi February 2012 Presented by Emrah Cem 7301 – Advances in Social.
Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna
BPT2423 – STATISTICAL PROCESS CONTROL
Analysis and Modeling of Social Networks Foudalis Ilias.
Week 5 - Models of Complex Networks I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
Phonotactic Restrictions on Ejectives A Typological Survey ___________________________ Carmen Jany
Self-Organization of the Sound Inventories: An Explanation based on Complex Networks.
Speech Group INRIA Lorraine
Structural Inference of Hierarchies in Networks BY Yu Shuzhi 27, Mar 2014.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.
Efficient Estimation of Emission Probabilities in profile HMM By Virpi Ahola et al Reviewed By Alok Datar.
Chapter Sampling Distributions and Hypothesis Testing.
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
6/29/20151 Efficient Algorithms for Motif Search Sudha Balla Sanguthevar Rajasekaran University of Connecticut.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Computer Science 1 Web as a graph Anna Karpovsky.
Usage vs Acquisition in Language Change Andrew Wedel and Clay Beckner Language as a Complex System Workshop University of Arizona, 2008.
Attack-Resistant Networks Allen G. Taylor Communication networks have four primary objectives: Minimize.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
Redundancy Ratio: An Invariant Property of the Consonant Inventories of the World’s Languages Animesh Mukherjee, Monojit Choudhury, Anupam Basu and Niloy.
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
Entropy in Machine Transliteration & Phonology Bhargava Reddy B.Tech Project.
Random Graph Models of Social Networks Paper Authors: M.E. Newman, D.J. Watts, S.H. Strogatz Presentation presented by Jessie Riposo.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
The Erdös-Rényi models
© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.
Connectionism. ASSOCIATIONISM Associationism David Hume ( ) was one of the first philosophers to develop a detailed theory of mental processes.
Popularity versus Similarity in Growing Networks Fragiskos Papadopoulos Cyprus University of Technology M. Kitsak, M. Á. Serrano, M. Boguñá, and Dmitri.
Organization of Railway Networks Animesh Mukherjee Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur Collaborators:
1 Speech Perception 3/30/00. 2 Speech Perception How do we perceive speech? –Multifaceted process –Not fully understood –Models & theories attempt to.
Theory of αBiNs: Alphabetic Bipartite Networks Animesh Mukherjee Dept. of Computer Science and Engineering Indian Institute of Technology, Kharagpur Collaborators:
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Chih-Ming Chen, Student Member, IEEE, Ying-ping Chen, Member, IEEE, Tzu-Ching Shen, and John K. Zao, Senior Member, IEEE Evolutionary Computation (CEC),
Motif finding with Gibbs sampling CS 466 Saurabh Sinha.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
Compression.  Compression ratio: how much is the size reduced?  Symmetric/asymmetric: time difference to compress, decompress?  Lossless; lossy: any.
© 2008 The McGraw-Hill Companies, Inc. Chapter 8: Cognition and Language.
The Goals of Phonology: to note and describe the sound patterns in language(s) to detect and taxonomize (classify) general patterns to explain these patterns.
Game Theory, Social Interactions and Artificial Intelligence Supervisor: Philip Sterne Supervisee: John Richter.
1 11 Channel Assignment for Maximum Throughput in Multi-Channel Access Point Networks Xiang Luo, Raj Iyengar and Koushik Kar Rensselaer Polytechnic Institute.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Improving Loss Resilience with Multi- Radio Diversity in Wireless Networks by Allen Miu, Hari Balakrishnan and C.E. Koksal Appeared in ACM MOBICOM 2005,
Community Detection Algorithms: A Comparative Analysis Authors: A. Lancichinetti and S. Fortunato Presented by: Ravi Tiwari.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Spatial Smoothing and Multiple Comparisons Correction for Dummies Alexa Morcom, Matthew Brett Acknowledgements.
Levels of Linguistic Analysis
To be presented by Maral Hudaybergenova IENG 513 FALL 2015.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
1 Distributed Vertex Coloring. 2 Vertex Coloring: each vertex is assigned a color.
James Hipp Senior, Clemson University.  Graph Representation G = (V, E) V = Set of Vertices E = Set of Edges  Adjacency Matrix  No Self-Inclusion (i.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Chap 14 Perceptual and linguistic phonetics
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Levels of Linguistic Analysis
Speech Perception (acoustic cues)
Presentation transcript:

Modeling Cross-linguistic Relationships Across Consonant Inventories: A Complex Network Approach

Sabda Bramha: Sound is Eternity sabda-brahma su-durbodham pranendriya-mano-mayam ananta-param gambhiram durvigahyam samudra-vat –S–Sound is eternal and as well very difficult to comprehend. It manifests within the life air, the senses, and the mind. It is unlimited and unfathomable, just like the ocean

Signals and Symbols Several living organisms can produce sound –They emit sound signals to communicate –These signals are mapped to certain symbols (meanings) in the brain –E.g., mating calls, danger alarms

Human Communication Human beings also produce sound signals Unlike other organisms, they can concatenate these sounds to produce new messages – Language Language is one of the primary cause/effect of human intelligence

Human Speech Sounds Human speech sounds are called phonemes – the smallest unit of a language Phonemes are characterized by certain distinctive features like I.Place of articulation II.Manner of articulation III.Phonation

Types of Phoneme Vowels /a/, /e/, /u/ … Consonants /p/, /t/, /k/ … Dipthongs /au/, /iu/ …

Choice of Phonemes How a language chooses a set of phonemes in order to build its sound inventory? Is the process arbitrary? Certainly Not What are the forces affecting this choice?

Forces of Choice /a/ Speaker Listener / Learner /a/ Desires “ease of articulation” Desires “perceptual contrast” / “ease of learnability” A Linguistic System The forces shaping the choice are opposing – Hence there is a non-trivial solution

Vowels: A Solved Mystery Languages choose vowels based only on maximal perceptual contrast. For instance if a language has three vowels then in more than 95% of the cases they are /a/,/i/ and /u/. /a/ /u//i/ Maximally Distinct

Consonants: A Jigsaw puzzle Research: From 1929 – Date No single satisfactory explanation of the organization of the consonant inventories –The set of features that characterize consonants is much larger than that of vowels –No single force is sufficient to explain this organization –Rather a complex interplay of forces goes on in shaping these inventories

Principle of Occurrence PlaNet – “Phoneme Language Network” –A bipartite network N=(V L,V C,E) –V L : Nodes representing languages of the world –V C : Nodes representing consonants –E : Set of edges which run between V L and V C –There is an edge e Є E between two nodes v l Є V L and v c Є V C if the consonant c occurs in language l. v l1 v l2 v l3 v l4 v c1 v c2 v c3 v c4

Construction of PlaNet Data Source : UCLA Phonological Inventory Database (UPSID) Number of nodes in V L is 317 Number of nodes in V C is 541 Number of edges is 7022

Degree Distribution of PlaNet DD of the nodes of V L An asymmetric β-distribution peaking at 21 – Most of the languages in UPSID tend to have a consonant inventory size of 21

Degree Distribution of PlaNet: A Two Regime Power Law DD of the nodes in V C Rank versus degree of the nodes in V C

Two Regime Power Law: An Explanation Power Law: –L–Languages preferentially choose consonants they have a tendency to choose a consonant which has been already chosen by many other languages. Two Regime: –H–Hypothesis: The typical distribution of the consonant inventory size over languages coupled with the principle of preferential attachment enforces the two distinct regimes to appear in the power law curves.

Why the Break?? Average consonant inventory size in UPSID is 21 –Principle of preferential attachment: The first 21 consonants (most frequent) are more preferred by languages than the rest. Hence the transition. The break shifts as the average inventory size is shifted.

Support Experiment Shift the inventory size form 21 to 25, 30 and 38 by neglecting the contribution of the consonant inventory size less than 15, 20 and 25 respectively. Break at 37 Break at 21 Break at 25 Break at 30

Simplified Theoretical Explanation Assumption: –Inventory size of all languages is fixed at 21. –Consonants are organized in a hierarchy of preference Model: –A language traverses the hierarchy of consonants –At each step decides with a probability p whether to choose the current consonant.

Simplified Theoretical Explanation Analysis: –Probability of choosing any one of the first 21 consonants is p (since languages must traverse through the first 21 consonants regardless of whether the previous consonants are chosen or not) –22 nd consonant is chosen only if 0, 1, 2 or at most 20 but not all 21 consonants are chosen –In general

Simplified Theoretical Explanation The plots for the function P(n) different values of p

The Synthesis Model (PlaNet syn ) Initialization –Degree distribution of the nodes in V L is known. V L ={L 1,L 2,…,L 317 } with degrees (consonant inventory size) {k 1,k 2,…,k 317 } –Nodes in V C are unlabelled. Algorithm –At every time step a node L j (j = 1 to 317) from V L tries to attach itself to a node i Є V C (to which L j is not already connected) with a probability Pr(i) given by where k i is the current degree of the node i and V j is the set of nodes in V C to which L j is not already connected and ε is the model parameter that inserts some randomness in the model –The above step is repeated until all L j Є V L gets connected to exactly k j nodes in V C

The Mechanism in Illustration

Simulation Results For PlaNet syn ε = and the results are averaged over 100 runs

Principle of Co-occurrence Consonants tend to co-occur in groups or communities The observed property can be explained by principle of feature economy –L–Languages tend to maximize the combinatorial possibilities of a few distinctive features in order to produce a large number of consonants. If a language has in its inventory Then it will also tend to have

Studies of this Co-occurrence PhoNet – “Phoneme Phoneme Network” –A weighted network N=(V C,E) –V C : Nodes representing consonants –E : Set of edges which run between the nodes in V C There is an edge e Є E between two nodes v c1,v c2 Є V C if the consonant c 1 and c 2 co-occur in a language. The number of languages in which c 1 and c 2 co-occurs defines the edge-weight of e. The number of languages in which c 1 occurs defines the node-weight of v c1.

Construction of PhoNet Data Source : UCLA Phonological Inventory Database (UPSID) Number of nodes in V C is 541 Number of edges is PhoNet

Communities in PhoNet Modified Radicchi et al. algorithm Basis –Edges running between communities are unlikely to belong to short-loops because to complete this loop there needs to be another edge running between these two communities and such edges are rare Modification for Weighted Networks –Rather than considering triangles, whether or not the weights on the edges of this triangle are comparable is to be considered. If they are, then the group of consonants co-occur highly else it is not so. –Measure strength S for each edge in PhoNet where S is, –Remove edges with S less than a threshold η

The Consonant Communities The formation of the retroflex community as η decreases Three different communities

Evaluation of the Communities Occurrence Ratio:, where N is the number of consonants (ranked by their frequency of occurrence) in a community C, M is the number of consonants that occur in a language L and R top is the rank of the highest ranking consonant (If a high-ranking consonant is present it is not necessary that the low- ranking should be present; but if a low ranker is present then it is expected that the high ranker must be present) Average Occurrence Ratio:, where L occur is the number of languages where at least one of the members of C has occurred

Evaluation of the Communities η > 0.3 O av > 0.8 Consonants show patterns of co-occurrence 80% or more of the world’s languages

The Binding Force of the Communities: Feature Economy Feature Entropy: The idea is borrowed from information theory For a community C of size N, let there be p f consonants having a particular feature f and q f other consonants lacking f – probability that a consonant chosen from C has f is p f /N and that it does have f is q f /N or (1- p f /N) Feature entropy can be therefore defined as where F is the set of all features present in the consonants in C Essentially the number of bits needed to transmit C through a channel.

For Instance Lower F E -> C economizes on the number of features Higher F E -> C does not economize on the number of features

Comparison with Random PhoNet (PhoNet rand ) Construction of PhoNet rand –For each consonant c let the frequency of occurrence in be denoted by f c. Let there be 317 bins each corresponding to a language in UPSID. f c bins are then chosen uniformly at random and the consonant c is packed into these bins. Thus the consonant inventories of the 317 languages corresponding to the bins are generated. Construct PhoNet rand from these new consonant inventories similarly as PhoNet. –Cluster by the PhoNet rand method proposed earlier

Comparison with Random PhoNet (PhoNet rand ) Average feature entropy of the communities of a particular size versus the community size (in log scale) Average feature entropy of the communities at a threshold η versus the threshold η Communities would not have emerged if inventories had evolved just by chance

Occurrence Ratio and Feature Entropy F E ≤ 4 O av > 0.7 The consonant communities that maximize feature economy tend to occur more frequently in the languages of the world.

The Future The quantification of Feature Economy can help in understanding the interplay of the forces like –Perceptual Contrast (will tend to increase feature economy by increasing the number of distinctive features required for better perception) –Ease of Learnability (will tend to decrease feature economy by decreasing the number of distinctive features to be learnt)

Implications to Language Evolution N speakers communicating with two consonants /k/ and /g/. Each speaker have l descendant m of them speak /k/ and the rest n of them speak /g/ After i generations there will be ml i /k/ speakers and nl i /g/ speakers. Now if If m > n then ml i >> nl i (something similar to the phenomenon of preferential attachment) How the initial disparity (m > n) comes is still to be explored (maybe phonetic reasons)

Thanks