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

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

AI - Jazykověda

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

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

Název statě ve sborníku

Methods and Applications of Quantitative Linguistics

ISBN

978-86-7466-465-0

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

1-193

Název nakladatele

University: Academic Mind

Místo vydání

Bělehrad

Místo konání akce

Bělehrad

Datum konání akce

26. 4. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—