Euclidean distance between syntactically linked words

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 70, Issue 5 2, 2004, Pages

  Cancho, Ramon Ferrer I ^a,b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITÀ DI ROMA LA SAPIENZA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; BRAIN; COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; ENTROPY; MATHEMATICAL MODELS; PROBLEM SOLVING; STATISTICAL METHODS;

COMPLEX NETWORKS; EUCLIDEAN DISTANCE; SENTENCE LENGTH;

LARGE SCALE SYSTEMS;

ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; EVALUATION; LINGUISTICS; METHODOLOGY; NATURAL LANGUAGE PROCESSING; NOMENCLATURE; SEMANTICS; STATISTICAL MODEL; STATISTICS;

ARTIFICIAL INTELLIGENCE; LINEAR MODELS; NATURAL LANGUAGE PROCESSING; PATTERN RECOGNITION, AUTOMATED; SEMANTICS; STATISTICS; TERMINOLOGY; VOCABULARY, CONTROLLED;

EID: 37649030306     PISSN: 15393755     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.70.056135     Document Type: Article

References (30)

1. I. Melčuk, Dependency Syntax: Theory and Practice (SUNY, Albany, 1988).
2. R. Hudson, Word Grammar (Blackwell, Oxford, 1984).
3. D. Sleator and D. Temperley, Tech. Rep., Carnegie Mellon University (1991).
4. I. Melčuk, in International Encyclopedia of the Social and Behavioral Sciences, edited by N. J. Smelser and P. B. Baltes (Pergamon, Oxford, 2002), pp. 8336-8344.
5. R. Ferrer i Cancho, R. V. Solé, and R. Köhler, Phys. Rev. E 69, 051915 (2004).
6. A. Baddeley, Working Memory (Clarendon, Oxford, 1986).
7. M. D. Hauser, N. Chomsky, and W. T. Fitch, Science 298, 1569 (2002).
8. R. Ferrer i Cancho (unpublished).
9. E. Gibson, Image, Language, Brain (MIT Press, Cambridge, MA, 2000), pp. 95-126.
10. J. A. Hawkins, A Performance Theory of Order and Constituency (Cambridge University Press, New York, 1994).
11. G. K. Zipf, Human Behaviour and the Principle of Least Effort: An Introduction to Human Ecology (Hafner, New York, 1972).
12. R. Ferrer i Cancho and R. V. Solé, Proc. Natl. Acad. Sci. U.S.A. 100, 788 (2003).
13. R. Ferrer i Cancho, Physica A (to be published), (to be published).
14. R. Ferrer i Cancho and R. V. Sole, in Statistical Physics of Complex Networks, Lecture Notes in Physics (Springer, Berlin, 2003).
15. V. Venkatasubramanian, S. Katare, P. R. Patkar, and F.-P. Mu, Comput. Chem. Eng. (to be published).
16. T. Nishikawa, A. E. Motter, Y.-C. Lai, and F. C. Hoppensteadt, Phys. Rev. E 66, 046139 (2002).
17. N. Mathias and V. Gopal, Phys. Rev. E 63, 021117 (2001).
18. A. K. S. S. Manna, J. Phys. A 36, L279 (2003).
19. M. Barthélemy, Europhys. Lett. 63, 915 (2003).
20. J. Díaz, J. Petit, and M. Serna, ACM Comput. Surv. 34, 313 (2002).
21. The Dependency Grammar Annotator website is http://phobos.cs.unibuc.ro/roric/DGA/dga.html
22. L. Uhlírova, I. Nebeská, and J. Králík, in COLING 82, Proceedings of the Ninth International Conference on Computational Linguistics, Prague, 1982, edited by J. Horecký (North-Holland, Amsterdam, 1982), pp. 391-396.
23. M. Těšitelová, Academia Praha 249s (1985).
24. R. Ferrer i Cancho and R. V. Solé, Optimization in Complex Networks, Lecture Notes in Physics Vol. 625 (Springer, Berlin, 2003), pp. 114-125.
25. Y. Koren and D. Harel, in Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02), Lecture Notes in Computer Science Vol. 2573 (Springer Verlag, Berlin, 2002), pp. 293-306.
26. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
27. Y. Shiloach, SIAM J. Comput. 8, 15 (1979).
28. F. R. K. Chung, Comput. Math. Appl. 10, 43 (1984).
29. J. N. Kapur, Maximum Entropy Models in Science and Engineering (Wiley, New Delhi, 1989), pp. 30-43.
30. E. W. Montroll and M. F. Shlesinger, J. Stat. Phys. 32, 209 (1983).