default search action
Ramon Ferrer-i-Cancho
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2003
- [b1]Ramon Ferrer-i-Cancho:
Language: universals, principles and origins. Polytechnic University of Catalonia, Spain, 2003
Journal Articles
- 2024
- [j45]Lluís Alemany-Puig
, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
The maximum linear arrangement problem for trees under projectivity and planarity. Inf. Process. Lett. 183: 106400 (2024) - [j44]Lluís Alemany-Puig
expected sum of edge lengths in planar linearizations of trees. J. Lang. Model. 12(1) (2024) - 2023
- [j43]Sonia Petrini
Direct and indirect evidence of compression of word lengths. Zipf's law of abbreviation revisited. Glottometrics 54: 58-87 (2023) - [j42]Ramon Ferrer-i-Cancho
Swap distance minimization in SOV languages. Cognitive and mathematical foundations. Glottometrics 55: 59-88 (2023) - 2022
- [j41]Lluís Alemany-Puig
Linear-Time Calculation of the Expected Sum of Edge Lengths in Random Projective Linearizations of Trees. Comput. Linguistics 48(3): 491-516 (2022) - [j40]Carlos Gómez-Rodríguez
Memory limitations are hidden in grammar. Glottometrics 52: 39-64 (2022) - [j39]Lluís Alemany-Puig
Minimum projective linearizations of trees in linear time. Inf. Process. Lett. 174: 106204 (2022) - [j38]Ramon Ferrer-i-Cancho
Optimal Coding and the Origins of Zipfian Laws. J. Quant. Linguistics 29(2): 165-194 (2022) - 2021
- [j37]Ramon Ferrer-i-Cancho
Anti Dependency Distance Minimization in Short Sequences. A Graph Theoretic Approach. J. Quant. Linguistics 28(1): 50-76 (2021) - 2019
- [j36]Bernardino Casas, Antoni Hernández-Fernández
Polysemy and brevity versus frequency in language. Comput. Speech Lang. 58: 19-50 (2019) - 2018
- [j35]Xinying Chen, Carlos Gómez-Rodríguez, Ramon Ferrer-i-Cancho:
A Dependency Look at the Reality of Constituency. Glottometrics 40: 104-106 (2018) - [j34]Antoni Hernández-Fernández, Ramon Ferrer-i-Cancho:
José María de Oleza Arredondo, S.J. (1887-1975). Glottometrics 41: 80-86 (2018) - [j33]Ramon Ferrer-i-Cancho
The origins of Zipf's meaning-frequency law. J. Assoc. Inf. Sci. Technol. 69(11): 1369-1379 (2018) - [j32]Ramon Ferrer-i-Cancho
Optimization Models of Natural Communication. J. Quant. Linguistics 25(3): 207-237 (2018) - 2017
- [j31]Christian Bentz, Dimitrios Alikaniotis, Michael Cysouw
The Entropy of Words - Learnability and Expressivity across More than 1000 Languages. Entropy 19(6): 275 (2017) - [j30]Ramon Ferrer-i-Cancho:
The optimality of attaching unlinked labels to unlinked meanings. Glottometrics 36: 1-16 (2017) - [j29]Ramon Ferrer-i-Cancho:
Random crossings in dependency trees. Glottometrics 37: 1-12 (2017) - [j28]Ramon Ferrer-i-Cancho:
A commentary on "The Now-Or-Never Bottleneck: A Fundamental Constraint on Language", by Christiansen and Chater (2016). Glottometrics 38: 107-111 (2017) - [j27]Ramon Ferrer-i-Cancho:
The Placement of the Head that Maximizes Predictability. An Information Theoretic Approach. Glottometrics 39: 38-71 (2017) - [j26]Juan Luis Esteban
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees. SIAM J. Comput. 46(3): 1146-1151 (2017) - 2016
- [j25]Ramon Ferrer-i-Cancho
Crossings as a side effect of dependency lengths. Complex. 21(S2): 320-328 (2016) - [j24]Ramon Ferrer-i-Cancho
Compression and the origins of Zipf's law for word frequencies. Complex. 21(S2): 409-411 (2016) - [j23]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez:
Liberating Language Research from Dogmas of the 20th Century. Glottometrics 33: 33-34 (2016) - [j22]Ramon Ferrer-i-Cancho:
The meaning-frequency law in Zipfian optimization models of communication. Glottometrics 35: 28-37 (2016) - [j21]Antoni Hernández-Fernández
The Infochemical Core. J. Quant. Linguistics 23(2): 133-153 (2016) - 2013
- [j20]Ramon Ferrer-i-Cancho
Erratum to "Random models of Menzerath-Altmann law in genomes" (BioSystems 107(3) (2012) 167-173). Biosyst. 111(3): 216-217 (2013) - [j19]Ramon Ferrer-i-Cancho
Compression as a Universal Principle of Animal Behavior. Cogn. Sci. 37(8): 1565-1578 (2013) - [j18]Ramon Ferrer-i-Cancho
The challenges of statistical patterns of language: The case of Menzerath's law in genomes. Complex. 18(3): 11-17 (2013) - [j17]Ramon Ferrer-i-Cancho:
Hubiness, length and crossings in syntactic dependencies. Glottometrics 25: 1-21 (2013) - [j16]Jaume Baixeries
The Parameters of the Menzerath-Altmann Law in Genomes. J. Quant. Linguistics 20(2): 94-104 (2013) - [j15]Stuart Semple
The Law of Brevity in Macaque Vocal Communication is not an Artefact of Analysing Mean Call Durations. J. Quant. Linguistics 20(3): 209-217 (2013) - 2012
- [j14]Jaume Baixeries
Random models of Menzerath-Altmann law in genomes. Biosyst. 107(3): 167-173 (2012) - 2011
- [j13]Antoni Hernández-Fernández
Size of the Whole versus Number of Parts in Genomes. Entropy 13(8): 1465-1480 (2011) - 2010
- [j12]Ramon Ferrer-i-Cancho
The self-organization of genomes. Complex. 15(5): 34-36 (2010) - 2009
- [j11]Ramon Ferrer-i-Cancho
Efficient coding in dolphin surface behavioral patterns. Complex. 14(5): 23-25 (2009) - [j10]Ramon Ferrer-i-Cancho
A Law of Word Meaning in Dolphin Whistle Types. Entropy 11(4): 688-701 (2009) - [j9]Ramon Ferrer-i-Cancho
The frequency spectrum of finite samples from the intermittent silence process. J. Assoc. Inf. Sci. Technol. 60(4): 837-843 (2009) - 2008
- [j8]Ramon Ferrer-i-Cancho
Some Word Order Biases from Limited Brain Resources: a Mathematical Approach. Adv. Complex Syst. 11(3): 393-414 (2008) - [j7]Ramon Ferrer-i-Cancho
Some Limits of Standard Linguistic Typology: the Case of Cysouw's Models for the Frequencies of the Six Possible Orderings of S, V and O. Adv. Complex Syst. 11(3): 421-432 (2008) - 2007
- [j6]Ramon Ferrer-i-Cancho
Spectral Methods Cluster Words of the Same Class in a Syntactic Dependency Network. Int. J. Bifurc. Chaos 17(7): 2453-2463 (2007) - 2005
- [j5]Ramon Ferrer-i-Cancho, Vito Servedio:
Can simple models explain Zipf's law for all exponents? Glottometrics 11: 1-8 (2005) - [j4]Ramon Ferrer-i-Cancho:
Hidden communication aspects in the exponent of Zipf's law. Glottometrics 11: 98-119 (2005) - 2002
- [j3]Ramon Ferrer-i-Cancho
Zipf's Law and Random Texts. Adv. Complex Syst. 5(1): 1-6 (2002) - [j2]Ramon Ferrer-i-Cancho
Quantifying the Semantic Contribution of Particles. J. Quant. Linguistics 9(1): 35-47 (2002) - 2001
- [j1]Ramon Ferrer-i-Cancho
Two Regimes in the Frequency of Words and the Origins of Complex Lexicons: Zipf's Law Revisited. J. Quant. Linguistics 8(3): 165-173 (2001)
Conference and Workshop Papers
- 2016
- [c4]Antoni Lozano, Bernardino Casas, Chris Bentz, Ramon Ferrer-i-Cancho:
Fast Calculation of Entropy with Zhang's Estimator. Issues in Quantitative Linguistics 4 (Dedicated to Reinhard Köhler on the occasion of his 65th birthday) 2016: 273-285 - [c3]Antoni Hernández-Fernández
Testing the Robustness of Laws of Polysemy and Brevity Versus Frequency. SLSP 2016: 19-29 - 2013
- [c2]Ramon Ferrer-i-Cancho, Lukasz Debowski:
Constant entropy rate and related hypotheses versus real language. CogSci 2013 - 2007
- [c1]Ramon Ferrer-i-Cancho:
On the universality of Zipf's law for word frequencies. Exact Methods in the Study of Language and Text 2007: 131-140
Informal and Other Publications
- 2024
- [i65]Ramon Ferrer-i-Cancho:
The optimal placement of the head in the noun phrase. The case of demonstrative, numeral, adjective and noun. CoRR abs/2402.10311 (2024) - [i64]Víctor Franco-Sánchez, Arnau Martí-Llobet, Ramon Ferrer-i-Cancho:
Swap distance minimization beyond entropy minimization in word order variation. CoRR abs/2404.14192 (2024) - [i63]Ramon Ferrer-i-Cancho:
Predictability maximization and the origins of word order harmony. CoRR abs/2408.16570 (2024) - 2023
- [i62]Sonia Petrini, Antoni Casas-i-Muñoz, Jordi Cluet-i-Martinell, Mengxue Wang, Chris Bentz, Ramon Ferrer-i-Cancho:
Direct and indirect evidence of compression of word lengths. Zipf's law of abbreviation revisited. CoRR abs/2303.10128 (2023) - [i61]Stuart Semple, Ramon Ferrer-i-Cancho, Morgan L. Gustison:
Linguistic laws in biology. CoRR abs/2310.07387 (2023) - [i60]Ramon Ferrer-i-Cancho, Savithry Namboodiripad:
Swap distance minimization in SOV languages. Cognitive and mathematical foundations. CoRR abs/2312.04219 (2023) - [i59]Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
On The Maximum Linear Arrangement Problem for Trees. CoRR abs/2312.04487 (2023) - 2022
- [i58]Lluís Alemany-Puig, Juan Luis Esteban
The Maximum Linear Arrangement Problem for trees under projectivity and planarity. CoRR abs/2206.06924 (2022) - [i57]Lluís Alemany-Puig, Ramon Ferrer-i-Cancho:
Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees. CoRR abs/2207.05564 (2022) - [i56]Sonia Petrini, Antoni Casas-i-Muñoz, Jordi Cluet-i-Martinell, Mengxue Wang, Christian Bentz, Ramon Ferrer-i-Cancho:
The optimality of word lengths. Theoretical foundations and an empirical study. CoRR abs/2208.10384 (2022) - [i55]Sonia Petrini, Ramon Ferrer-i-Cancho:
The distribution of syntactic dependency distances. CoRR abs/2211.14620 (2022) - 2021
- [i54]Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
Minimum projective linearizations of trees in linear time. CoRR abs/2102.03277 (2021) - [i53]David Carrera-Casado, Ramon Ferrer-i-Cancho:
The advent and fall of a vocabulary learning bias from communicative efficiency. CoRR abs/2105.11519 (2021) - [i52]Neus Català, Jaume Baixeries, Ramon Ferrer-i-Cancho, Lluís Padró, Antoni Hernández-Fernández:
Zipf's laws of meaning in Catalan. CoRR abs/2107.00042 (2021) - [i51]Lluís Alemany-Puig, Ramon Ferrer-i-Cancho:
Linear-time calculation of the expected sum of edge lengths in random projective linearizations of trees. CoRR abs/2107.03277 (2021) - [i50]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez:
Dependency distance minimization predicts compression. CoRR abs/2109.08900 (2021) - [i49]Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
The Linear Arrangement Library. A new tool for research on syntactic dependency structures. CoRR abs/2112.02512 (2021) - 2020
- [i48]Lluís Alemany-Puig, Ramon Ferrer-i-Cancho:
Fast calculation of the variance of edge crossings in random linear arrangements. CoRR abs/2003.03258 (2020) - [i47]Lluís Alemany-Puig, Mercè Mora, Ramon Ferrer-i-Cancho:
Reappraising the distribution of the number of edge crossings of graphs on a sphere. CoRR abs/2003.03353 (2020) - [i46]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban:
The variation of the sum of edge lengths in linear arrangements of trees. CoRR abs/2006.14069 (2020) - [i45]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban, Lluís Alemany-Puig:
The optimality of syntactic dependency distances. CoRR abs/2007.15342 (2020) - 2019
- [i44]Bernardino Casas, Antoni Hernández-Fernández, Neus Català, Ramon Ferrer-i-Cancho, Jaume Baixeries:
Polysemy and brevity versus frequency in language. CoRR abs/1904.00812 (2019) - [i43]Ramon Ferrer-i-Cancho, Christian Bentz:
Optimal coding and the origins of Zipfian laws. CoRR abs/1906.01545 (2019) - [i42]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez:
Anti dependency distance minimization in short sequences. A graph theoretic approach. CoRR abs/1906.05765 (2019) - [i41]Carlos Gómez-Rodríguez, Morten H. Christiansen, Ramon Ferrer-i-Cancho:
Memory limitations are hidden in grammar. CoRR abs/1908.06629 (2019) - [i40]Lluís Alemany-Puig, Ramon Ferrer-i-Cancho:
Edge crossings in random linear arrangements. CoRR abs/1910.03926 (2019) - 2018
- [i39]Ramon Ferrer-i-Cancho, Michael S. Vitevitch:
The origins of Zipf's meaning-frequency law. CoRR abs/1801.00168 (2018) - 2017
- [i38]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban:
Are crossing dependencies really scarce? CoRR abs/1703.08324 (2017) - [i37]Ramon Ferrer-i-Cancho:
The placement of the head that maximizes predictability. An information theoretic approach. CoRR abs/1705.09932 (2017) - [i36]Ramon Ferrer-i-Cancho:
Towards a theory of word order. Comment on "Dependency distance: a new perspective on syntactic patterns in natural language" by Haitao Liu et al. CoRR abs/1706.04872 (2017) - [i35]Antoni Lozano, Bernardino Casas, Chris Bentz, Ramon Ferrer-i-Cancho:
Fast calculation of entropy with Zhang's estimator. CoRR abs/1707.08290 (2017) - [i34]Xinying Chen, Carlos Gómez-Rodríguez, Ramon Ferrer-i-Cancho:
A dependency look at the reality of constituency. CoRR abs/1708.07722 (2017) - 2016
- [i33]Carlos Gómez-Rodríguez, Ramon Ferrer-i-Cancho:
The scarcity of crossing dependencies: a direct outcome of a specific constraint? CoRR abs/1601.03210 (2016) - [i32]Juan Luis Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez:
The scaling of the minimum sum of edge lengths in uniformly random trees. CoRR abs/1602.07940 (2016) - [i31]Ramon Ferrer-i-Cancho:
Compression and the origins of Zipf's law for word frequencies. CoRR abs/1605.01326 (2016) - [i30]Ramon Ferrer-i-Cancho, David Lusseau, Brenda McCowan:
Parallels of human language in the behavior of bottlenose dolphins. CoRR abs/1605.01661 (2016) - [i29]Antoni Hernández-Fernández, Ramon Ferrer-i-Cancho:
The infochemical core. CoRR abs/1610.05654 (2016) - [i28]Bernardino Casas, Neus Català, Ramon Ferrer-i-Cancho, Antoni Hernández-Fernández, Jaume Baixeries:
The polysemy of the words that children learn over time. CoRR abs/1611.08807 (2016) - 2015
- [i27]Ramon Ferrer-i-Cancho, Chris Bentz, Caio Seguin:
Compression and the origins of Zipf's law of abbreviation. CoRR abs/1504.04884 (2015) - [i26]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez:
Crossings as a side effect of dependency lengths. CoRR abs/1508.06451 (2015) - [i25]Ramon Ferrer-i-Cancho:
A commentary on "The now-or-never bottleneck: a fundamental constraint on language", by Christiansen and Chater (2015). CoRR abs/1509.01722 (2015) - [i24]Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez:
Liberating language research from dogmas of the 20th century. CoRR abs/1509.03295 (2015) - [i23]Juan Luis Esteban, Ramon Ferrer-i-Cancho:
A correction on Shiloach's algorithm for minimum linear arrangement of trees. CoRR abs/1511.01061 (2015) - [i22]Ramon Ferrer-i-Cancho:
Kauffman's adjacent possible in word order evolution. CoRR abs/1512.05582 (2015) - 2014
- [i21]Alvaro Corral, Gemma Boleda, Ramon Ferrer-i-Cancho:
Zipf's law for word frequencies: word forms versus lemmas in long texts. CoRR abs/1407.8322 (2014) - [i20]Ramon Ferrer-i-Cancho:
Beyond description. Comment on "Approaching human language with complex networks" by Cong & Liu. CoRR abs/1408.1774 (2014) - [i19]Ramon Ferrer-i-Cancho:
The meaning-frequency law in Zipfian optimization models of communication. CoRR abs/1409.7275 (2014) - [i18]Ramon Ferrer-i-Cancho:
A stronger null hypothesis for crossing dependencies. CoRR abs/1410.5485 (2014) - [i17]Ramon Ferrer-i-Cancho:
Non-crossing dependencies: least effort, not grammar. CoRR abs/1411.2645 (2014) - [i16]Ramon Ferrer-i-Cancho:
Optimization models of natural communication. CoRR abs/1412.2486 (2014) - [i15]Ramon Ferrer-i-Cancho:
Reply to the commentary "Be careful when assuming the obvious", by P. Alday. CoRR abs/1412.7186 (2014) - 2013
- [i14]Ramon Ferrer-i-Cancho, Antoni Hernández-Fernández, David Lusseau, Govindasamy Agoramoorthy, Minna J. Hsu, Stuart Semple:
Compression as a universal principle of animal behavior. CoRR abs/1303.6175 (2013) - [i13]Ramon Ferrer-i-Cancho, Haitao Liu:
The risks of mixing dependency lengths from sequences of different length. CoRR abs/1304.3841 (2013) - [i12]Ramon Ferrer-i-Cancho:
Hubiness, length, crossings and their relationships in dependency trees. CoRR abs/1304.4086 (2013) - [i11]Andrea Baronchelli, Ramon Ferrer-i-Cancho, Romualdo Pastor-Satorras, Nick Chater, Morten H. Christiansen:
Networks in Cognitive Science. CoRR abs/1304.6736 (2013) - [i10]Ramon Ferrer-i-Cancho, Lukasz Debowski, Fermín Moscoso del Prado Martín:
Constant conditional entropy and related hypotheses. CoRR abs/1304.7359 (2013) - [i9]Ramon Ferrer-i-Cancho:
Random crossings in dependency trees. CoRR abs/1305.4561 (2013) - [i8]Ramon Ferrer-i-Cancho:
The placement of the head that minimizes online memory: a complex systems approach. CoRR abs/1309.1939 (2013) - [i7]Ramon Ferrer-i-Cancho:
Why SOV might be initially preferred and then lost or recovered? A theoretical framework. CoRR abs/1309.4058 (2013) - [i6]Ramon Ferrer-i-Cancho:
The optimality of attaching unlinked labels to unlinked objects. CoRR abs/1310.5884 (2013) - 2012
- [i5]Ramon Ferrer-i-Cancho, Antoni Hernández-Fernández:
The failure of the law of brevity in two New World primates. Statistical caveats. CoRR abs/1204.3198 (2012) - [i4]Ramon Ferrer-i-Cancho, Núria Forns, Antoni Hernández-Fernández, Gemma Bel Enguix, Jaume Baixeries:
The challenges of Menzerath's law in genomes. CoRR abs/1207.0689 (2012) - [i3]Stuart Semple, Minna J. Hsu, Govindasamy Agoramoorthy, Ramon Ferrer-i-Cancho:
The law of brevity in macaque vocal communication is not an artifact of analyzing mean call durations. CoRR abs/1207.3169 (2012) - [i2]Ramon Ferrer-i-Cancho, Fermín Moscoso del Prado Martín:
Information content versus word length in random typing. CoRR abs/1209.1751 (2012) - 2009
- [i1]Alvaro Corral, Ramon Ferrer-i-Cancho, Gemma Boleda, Albert Díaz-Guilera:
Universal Complex Structures in Written Language. CoRR abs/0901.2924 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: