Constructing n-gram rules for natural language models through exploring the limitation of the Zipf-Mandelbrot law

DOI10.1007/S00607-010-0116-XMaRDI QIDQ644850zbMATH OpenOpenAlexFDO

Authors Harry M. Chang

Publication date 7 November 2011

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-010-0116-x

zbMATH Keywords

natural language processingquantitative linguistics\(n\)-gram statistical language modelsZipf-Mandelbrot law

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• ZIPF'S LAWS IN TEXT MODELING
• Zipf's law in natural languages, programming languages, and command languages: the Simon-Yule approach
• Analysis of Zipf's law: An index approach
• A statistical test for correspondence of texts to the Zipf-Mandelbrot law
• INTERPRETATION OF THE GENERALIZED ZIPF-MANDELBROT LAW PARAMETERS

Cites work

• scientific article; zbMATH DE number 1462670 (Why is no real title available?)
• A “Law≓ of occurrences for words of low frequency
• Beyond the Zipf-Mandelbrot law in quantitative linguistics
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• POPULATION DIFFERENCES BETWEEN SPECIES GROWING ACCORDING TO SIMPLE BIRTH AND DEATH PROCESSES
• The stretched exponential distribution of internet media access patterns

Cited in

(3)

• USING GRAPHEME n-GRAMS IN SPELLING CORRECTION AND AUGMENTATIVE TYPING SYSTEMS
• ZIPF'S LAWS IN TEXT MODELING
• Use of power law models in detecting region of interest

This page was built for publication: Constructing \(n\)-gram rules for natural language models through exploring the limitation of the Zipf-Mandelbrot law

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644850)