Euclidean distance between syntactically linked words
- 30 November 2004
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 70 (5) , 056135
- https://doi.org/10.1103/physreve.70.056135
Abstract
We study the Euclidean distance between syntactically linked words in sentences. The average distance is significantly small and is a very slowly growing function of sentence length. We consider two nonexcluding hypotheses: (a) the average distance is minimized and (b) the average distance is constrained. Support for (a) comes from the significantly small average distance real sentences achieve. The strength of the minimization hypothesis decreases with the length of the sentence. Support for (b) comes from the very slow growth of the average distance versus sentence length. Furthermore, (b) predicts, under ideal conditions, an exponential distribution of the distance between linked words, a trend that can be identified in real sentences.Keywords
This publication has 12 references indexed in Scilit:
- Patterns in syntactic dependency networksPhysical Review E, 2004
- Crossover from scale-free to spatial networksEurophysics Letters, 2003
- Scale-free network on Euclidean space optimized by rewiring of linksJournal of Physics A: General Physics, 2003
- The Faculty of Language: What Is It, Who Has It, and How Did It Evolve?Science, 2002
- Smallest small-world networkPhysical Review E, 2002
- A survey of graph layout problemsACM Computing Surveys, 2002
- Small worlds: How and whyPhysical Review E, 2001
- On optimal linear arrangements of treesComputers & Mathematics with Applications, 1984
- Maximum entropy formalism, fractals, scaling phenomena, and 1/f noise: A tale of tailsJournal of Statistical Physics, 1983
- A Minimum Linear Arrangement Algorithm for Undirected TreesSIAM Journal on Computing, 1979