Logo of Humboldt-Universität zu BerlinLogo of Humboldt-Universität zu Berlin
edoc-Server
Open-Access-Publikationsserver der Humboldt-Universität
de|en
Header image: facade of Humboldt-Universität zu Berlin
View Item 
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Informatik
  • Informatik-Berichte
  • View Item
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Informatik
  • Informatik-Berichte
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
All of edoc-ServerCommunity & CollectionTitleAuthorSubjectThis CollectionTitleAuthorSubject
PublishLoginRegisterHelp
StatisticsView Usage Statistics
View Item 
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Informatik
  • Informatik-Berichte
  • View Item
  • edoc-Server Home
  • Schriftenreihen und Sammelbände
  • Fakultäten und Institute der HU
  • Institut für Informatik
  • Informatik-Berichte
  • View Item
2008-01-01Buch DOI: 10.18452/2481
Simulating and reconstructing language change
Hochmuth, Mirko
Lüdeling, Anke
Leser, Ulf cc
In this work we probe phylogenetic algorithms for their ability to reconstruct historic language relationships. We present a formal model for the development of languages incorporating vertical (genealogical) and horizontal (language contact) effects. As a distinctive feature, we also added a geographic model to mimic the effects of constrained population movements. Using our model, we generated a large number of simulated language histories whose results were analyzed by a variety of established phylogenetic algorithms. Therein, we systematically investigated the effects of different contact intensities and of geographic as well as genealogic topologies. We found that tree-based algorithms are robust under a variety of different settings and are capable of inferring (parts of) the relationships correctly even under high levels of network-like influences. We also studied the SplitsTree algorithm which should be more appropriate to cope with network-like effects. However, although SplitsTree clearly performs better in some settings, it generally shows a rather erratic behavior.
Files in this item
Thumbnail
220.pdf — Adobe PDF — 4.730 Mb
MD5: 13458b439e3e0c259e6b695385f1fa6f
Cite
BibTeX
EndNote
RIS
InCopyright
Details
DINI-Zertifikat 2019OpenAIRE validatedORCID Consortium
Imprint Policy Contact Data Privacy Statement
A service of University Library and Computer and Media Service
© Humboldt-Universität zu Berlin
 
DOI
10.18452/2481
Permanent URL
https://doi.org/10.18452/2481
HTML
<a href="https://doi.org/10.18452/2481">https://doi.org/10.18452/2481</a>