Limits...
Lewis Carroll's Doublets net of English words: network heterogeneity in a complex system.

Fushing H, Chen C, Hsieh YC, Farrell P - PLoS ONE (2014)

Bottom Line: Phonological communities are seen at the network level.And a balancing act between the language's global efficiency and redundancy is seen at the system level.Because the Doublets net is a modular complex cognitive system, the community geometry and computable multi-scale structural information may provide a foundation for understanding computational learning in many systems whose network structure has yet to be fully analyzed.

View Article: PubMed Central - PubMed

Affiliation: Department of Statistics, University of California Davis, Davis, California, United States of America.

ABSTRACT
Lewis Carroll's English word game Doublets is represented as a system of networks with each node being an English word and each connectivity edge confirming that its two ending words are equal in letter length, but different by exactly one letter. We show that this system, which we call the Doublets net, constitutes a complex body of linguistic knowledge concerning English word structure that has computable multiscale features. Distributed morphological, phonological and orthographic constraints and the language's local redundancy are seen at the node level. Phonological communities are seen at the network level. And a balancing act between the language's global efficiency and redundancy is seen at the system level. We develop a new measure of intrinsic node-to-node distance and a computational algorithm, called community geometry, which reveal the implicit multiscale structure within binary networks. Because the Doublets net is a modular complex cognitive system, the community geometry and computable multi-scale structural information may provide a foundation for understanding computational learning in many systems whose network structure has yet to be fully analyzed.

Show MeSH
Path length and degree distributions.Histogram of path length of the 4-letter giant clique given in Fig. 1 (c) (a) and its histogram of degree (b).
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4269387&req=5

pone-0114177-g002: Path length and degree distributions.Histogram of path length of the 4-letter giant clique given in Fig. 1 (c) (a) and its histogram of degree (b).

Mentions: The average path length of the 4-letter word giant clique is calculated as around 5. So, in general, this game is not particularly difficult with a 4-letter word setting. But, as shown in Fig. 2(a), Doublets can be extremely difficult for some 4-letter words. The most difficult ones are those pairs involving ending nodes of dendrites, such as the aforementioned “ADIT” and “INCA” pair. Here we attempt to answer the question of how a dendrite is formed, in order to shed light on some special characteristics of the Doublets net.


Lewis Carroll's Doublets net of English words: network heterogeneity in a complex system.

Fushing H, Chen C, Hsieh YC, Farrell P - PLoS ONE (2014)

Path length and degree distributions.Histogram of path length of the 4-letter giant clique given in Fig. 1 (c) (a) and its histogram of degree (b).
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4269387&req=5

pone-0114177-g002: Path length and degree distributions.Histogram of path length of the 4-letter giant clique given in Fig. 1 (c) (a) and its histogram of degree (b).
Mentions: The average path length of the 4-letter word giant clique is calculated as around 5. So, in general, this game is not particularly difficult with a 4-letter word setting. But, as shown in Fig. 2(a), Doublets can be extremely difficult for some 4-letter words. The most difficult ones are those pairs involving ending nodes of dendrites, such as the aforementioned “ADIT” and “INCA” pair. Here we attempt to answer the question of how a dendrite is formed, in order to shed light on some special characteristics of the Doublets net.

Bottom Line: Phonological communities are seen at the network level.And a balancing act between the language's global efficiency and redundancy is seen at the system level.Because the Doublets net is a modular complex cognitive system, the community geometry and computable multi-scale structural information may provide a foundation for understanding computational learning in many systems whose network structure has yet to be fully analyzed.

View Article: PubMed Central - PubMed

Affiliation: Department of Statistics, University of California Davis, Davis, California, United States of America.

ABSTRACT
Lewis Carroll's English word game Doublets is represented as a system of networks with each node being an English word and each connectivity edge confirming that its two ending words are equal in letter length, but different by exactly one letter. We show that this system, which we call the Doublets net, constitutes a complex body of linguistic knowledge concerning English word structure that has computable multiscale features. Distributed morphological, phonological and orthographic constraints and the language's local redundancy are seen at the node level. Phonological communities are seen at the network level. And a balancing act between the language's global efficiency and redundancy is seen at the system level. We develop a new measure of intrinsic node-to-node distance and a computational algorithm, called community geometry, which reveal the implicit multiscale structure within binary networks. Because the Doublets net is a modular complex cognitive system, the community geometry and computable multi-scale structural information may provide a foundation for understanding computational learning in many systems whose network structure has yet to be fully analyzed.

Show MeSH