Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/823
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | EGGHE, Leo | - |
dc.date.accessioned | 2005-06-14T08:00:11Z | - |
dc.date.available | 2005-06-14T08:00:11Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 58(5). p. 702-709 | - |
dc.identifier.issn | 1532-2882 | - |
dc.identifier.uri | http://hdl.handle.net/1942/823 | - |
dc.description.abstract | Herdan’s law in linguistics and Heaps’ law in information retrieval are different formulations of the same phenomenon. Stated briefly and in linguistical terms they state that vocabularies’ sizes are concave increasing power laws of texts’ sizes. This paper investigates these laws from a purely mathematical and informetric point of view. A general informetric argument shows that the problem of proving these laws is in fact ill-posed: using the more general terminology of sources and items, we show, by presenting exact formulas from Lotkaian informetrics, that the total number T of sources is not only a function of the total number A of items but is also a function of several parameters (e.g. the parameters occurring in Lotka’s law) and consequently we show that a fixed T (or A) value can lead to different possible A (respectively T) values. Limiting the T(A)-variability to increasing samples (in e.g. a text as done in linguistics) we then show, in a purely mathematical way, that, for large sample sizes [formule] where θ is a constant, θ<1 but close to 1, hence roughly, Heaps’ or Herdan’s law can be proved without using any lingusitical or informetric argument! We also show that for smaller samples, θ is not a constant but essentially decreases as confirmed by practical examples. Finally, an exact informetric argument on random sampling in the items shows that, in most cases, T=T(A) is a concavely increasing function, in accordance with practical examples. | - |
dc.format.extent | 226798 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | WILEY-V C H VERLAG GMBH | - |
dc.subject.other | Heaps’ law; Herdan’s law; power law; Lotka’s law; sample | - |
dc.title | Untangling Herdan’s law and Heaps’ law: mathematical and informetric arguments | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 709 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 702 | - |
dc.identifier.volume | 58 | - |
local.bibliographicCitation.jcat | A1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.doi | 10.1002/asi.20524 | - |
dc.identifier.isi | 000246379700006 | - |
item.accessRights | Closed Access | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2008 | - |
item.contributor | EGGHE, Leo | - |
item.fullcitation | EGGHE, Leo (2007) Untangling Herdan’s law and Heaps’ law: mathematical and informetric arguments. In: JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 58(5). p. 702-709. | - |
crisitem.journal.issn | 1532-2882 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Untangling.pdf Restricted Access | 221.48 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
31
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
36
checked on Mar 29, 2024
Page view(s)
62
checked on Jun 16, 2023
Download(s)
44
checked on Jun 16, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.