Rank-frequency Relation & Type-token Relation: Two Sides of the Same Coin

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11210%2F13%3A10194479" target="_blank" >RIV/00216208:11210/13:10194479 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Rank-frequency Relation & Type-token Relation: Two Sides of the Same Coin
Original language description
This paper shows that type-token relation, hapax-token relation and, generally, relation between types of certain frequency and tokens can be computed from the rank-frequency relation or from any type frequency §distribution and that type-token relationcan be computed from the hapax-token relation. This paper shows that there is no need for any approximation or assumption and that the formulae can be derived purely algebraically. The second part of the paper observes that, for a very large corpora, ratio between number of hapax legomena and types converges to a constant Z; Z>0. Under this assumption an approximation is built that enables us to predict type-token relation and other aforementioned relations from the single parameter Z. This approximation is only valid for very large corpora. As the last chapter shows, this assumption implies that for an infinitely increasing number of tokens, number of types increases beyond any limit.
Czech name
—
Czech description
—

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Methods and Applications of Quantitative Linguistics
ISBN
978-86-7466-465-0
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
1-193
Publisher name
University: Academic Mind
Place of publication
Bělehrad
Event location
Bělehrad
Event date
Apr 26, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)