2013
DOI: 10.1371/journal.pone.0070284
|View full text |Cite
|
Sign up to set email alerts
|

At Grammatical Faculty of Language, Flies Outsmart Men

Abstract: Using a symbolic dynamics and a surrogate data approach, we show that the language exhibited by common fruit flies Drosophila (‘D.’) during courtship is as grammatically complex as the most complex human-spoken modern languages. This finding emerges from the study of fifty high-speed courtship videos (generally of several minutes duration) that were visually frame-by-frame dissected into 37 fundamental behavioral elements. From the symbolic dynamics of these elements, the courtship-generating language was dete… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(11 citation statements)
references
References 11 publications
0
11
0
Order By: Relevance
“…However we do claim that the male behaviour network and the male and female behaviour network are inconsistent with a scale-free structure. This observation is particularly interesting in light of an earlier result [17] which showed not only that DPC language often exhibits recursion (making it to the best of our knowledge the only known animal example of a Context-Free or Context-Sensitive language in the Chomsky hierarchy) but that this recursive property is predominantly exhibited in male DPC. It seems possible that the inclusion of such high level grammar precludes a scale-free network structure.…”
Section: Results Modeling Discussionmentioning
confidence: 75%
See 2 more Smart Citations
“…However we do claim that the male behaviour network and the male and female behaviour network are inconsistent with a scale-free structure. This observation is particularly interesting in light of an earlier result [17] which showed not only that DPC language often exhibits recursion (making it to the best of our knowledge the only known animal example of a Context-Free or Context-Sensitive language in the Chomsky hierarchy) but that this recursive property is predominantly exhibited in male DPC. It seems possible that the inclusion of such high level grammar precludes a scale-free network structure.…”
Section: Results Modeling Discussionmentioning
confidence: 75%
“…With the introduction of significant recursion however, the power law fit breaks down, and instead a network growth algorithm which includes a second process (internal preferential linking with saturation, breaking the scale-free preferential attachment process), is able to match these network structures (but not the scale-free one) without fitting. Recursion is essential for higher level abstract reasoning [17], and requires a secondary "book keeping" function to keep track of the references between elements. It appears from the above evidence that such a second process is neccessary for the male behaviour, and incompatible with a critical state.…”
Section: Results Modeling Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Formal languages, first used to classify computer and human spoken languages [10][11][12][13], have recently added important insight in dynamical systems, in theory and in applications [14][15][16][17]. Dynamical systems map a generically chosen initial condition into a sequence S = {s(t 1 ), s(t 2 ), .…”
Section: Excess Entropy Analysismentioning
confidence: 99%
“…f (N; N, p) does not embrace the order by which the states are visited and therefore does not retain information regarding the underlying system dynamics. To capture the latter aspect, we consider at each position n of the sequence the walkthrough probability [17] which evaluates for each symbol s j (n) the probability that a random walk starting with symbol s 1 will pass through symbol s j (i.e. P in (s j )), times the probability that a random walk starting at s j will end with symbol x L (ie, P out (s j )) P (n, N; n, N, p) = f (n; n, p)f (N − n; N − n, p) = n!…”
Section: Excess Entropy Analysismentioning
confidence: 99%