Mathematical approaches to comparative linguistics.

The inference of the evolutionary history of a set of languages is a complex problem. Although some languages are known to be related through descent from common ancestral languages, for other languages determining whether such a relationship holds is itself a difficult problem. In this paper we report on new methods, developed by linguists Johanna Nichols (University of California, Berkeley), Donald Ringe and Ann Taylor (University of Pennsylvania, Philadelphia), and me, for answering some of the most difficult questions in this domain. These methods and the results of the analyses based on these methods were presented in November 1995 at the Symposium on the Frontiers of Science held by the National Academy of Sciences.

[1]  A. Meillet,et al.  La méthode comparative en linguistique historique , 1925 .

[2]  E. H. Sturtevant,et al.  A comparative grammar of the Hittite language , 1934 .

[3]  Henry M. Hoenigswald.  Language Change and Linguistic Reconstruction , 1960 .

[4]  H. Hoenigswald,et al.  Italie and Celtic Superlatives and the Dialects of Indo-European , 1970 .

[5]  J. Tischler.  Glottochronologie und Lexikostatistik , 1973 .

[6]  Proceedings of the Eleventh International Congress of Linguists : Bologna-Florence, Aug. 28-Sept. 2, 1972 , 1974 .

[7]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[8]  James F. O'Connell,et al.  A prehistory of Australia, New Guinea, and Sahul , 1982 .

[9]  J. Felsenstein.  Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.

[10]  David Sankoff,et al.  COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .

[11]  Johanna Nichols,et al.  AND THE FIRST SETTLEMENT OF THE NEW WORLD , 1990 .

[12]  Rhys Jones,et al.  Thermoluminescence dating of a 50,000-year-old human occupation site in northern Australia , 1990, Nature.

[13]  Sampath Kannan,et al.  Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  J. Nichols.  Linguistic Diversity in Space and Time , 1992 .

[15]  Michael R. Fellows,et al.  Two Strikes Against Perfect Phylogeny , 1992, ICALP.

[16]  Donald A. Ringe join.  On Calculating the Factor of Chance in Language Comparison , 1992 .

[17]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[18]  Tandy Warnow,et al.  Constructing phylogenetic trees efficiently using compatibility criteria , 1993 .

[19]  David Fernández-Baca,et al.  A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed , 1993, FOCS.

[20]  Fred R. McMorris,et al.  Triangulating vertex colored graphs , 1994, SODA '93.

[21]  David Fernández-Baca,et al.  Fast Algorithms for Inferring Evolutionary Trees , 1995, J. Comput. Biol..

[22]  Cynthia A. Phillips,et al.  Constructing evolutionary trees in the presence of polymorphic characters , 1996, STOC '96.

[23]  David Fernández-Baca,et al.  Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs , 1996, Int. J. Found. Comput. Sci..

[24]  Tandy J. Warnow,et al.  Reconstructing the evolutionary history of natural languages , 1996, SODA '96.

[25]  Gary L. Miller,et al.  Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , 1996, STOC 1996.

[26]  Éva Tardos,et al.  Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA , 1996, SODA.