IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v50y1999i3p233-241.html
   My bibliography  Save this article

On the law of Zipf‐Mandelbrot for multi‐word phrases

Author

Listed:
  • L. Egghe

Abstract

This article studies the probabilities of the occurrence of multi‐word (m‐word) phrases (m = 2,3,…) in relation to the probabilities of occurrence of the single words. It is well known that, in the latter case, the law of Zipf is valid (i.e., a power law). We prove that in the case of m‐word phrases (m ≥ 2), this is not the case. We present two independent proofs of this. We furthermore show that, in case we want to approximate the found distribution by Zipf's law, we obtain exponents βm in this power law for which the sequence (βm)m∈N is strictly decreasing. This explains experimental findings of Smith and Devine (1985), Hilberg (1988), and Meyer (1989a,b). Our results should be compared with a heuristic finding of Rousseau who states that the law of Zipf‐Mandelbrot is valid for multi‐word phrases. He, however, uses other—less classical—assumptions than we do.

Suggested Citation

  • L. Egghe, 1999. "On the law of Zipf‐Mandelbrot for multi‐word phrases," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 50(3), pages 233-241.
  • Handle: RePEc:bla:jamest:v:50:y:1999:i:3:p:233-241
    DOI: 10.1002/(SICI)1097-4571(1999)50:33.0.CO;2-8
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(1999)50:33.0.CO;2-8
    Download Restriction: no

    File URL: https://libkey.io/10.1002/(SICI)1097-4571(1999)50:33.0.CO;2-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:50:y:1999:i:3:p:233-241. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.