Models of Grammar Evolution I Biosequence Applications
ثبت نشده
چکیده
A language evolves by modification and cultural inheritance. This legitimizes the attempt to reconstruct language history and describe the processes governing language evolution. The techniques developed in linguistics are also used in sequence analysis, where inheritance is genetic instead of cultural. These problems are exciting and hard. For sake of realism the project will entail major simplifications to allow focus on basic conceptual issues.
منابع مشابه
The design principles and algorithms of a weighted grammar library
We present the software design principles, algorithms, and utilities of a general weighted grammar library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. Several of the algorithms and utilities of this library are described, including in some cases their pseudocodes and pointers to their use in applications. The algorithms and the ut...
متن کاملA General Weighted Grammar Library
We present a general weighted grammar software library, the GRM Library, that can be used in a variety of applications in text, speech, and biosequence processing. The underlying algorithms were designed to support a wide variety of semirings and the representation and use of very large grammars and automata of several hundred million rules or transitions. We describe several algorithms and uti...
متن کاملA sensorimotor characterisation of syntax, and its implications for models of language evolution
In this paper I consider the possibility that language is more strongly grounded in sensorimotor cognition than is normally assumed—a scenario which would be providential for language evolution theorists. I argue that the syntactic theory most compatible with this scenario, perhaps surprisingly, is generative grammar. I suggest that there may be a way of interpreting the syntactic structures po...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملMinimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution
In this paper, we propose algorithms that extend a given regular tree grammar G0 to a new grammar G respecting the following two properties: (i) G belongs to the sub-class of local or single-type tree grammars and (ii) G is the least grammar (in the sense of language inclusion) that contains the language of G0. Our algorithms give rise to important tools in the context of web service compositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007