default search action
Lukasz Debowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j20]Lukasz Debowski:
Corrections of Zipf's and Heaps' Laws Derived from Hapax Rate Models. J. Quant. Linguistics 32(2): 128-165 (2025) - 2023
- [j19]Lukasz Debowski
:
Universal Densities Exist for Every Finite Reference Measure. IEEE Trans. Inf. Theory 69(8): 5277-5288 (2023) - [i24]Lukasz Debowski:
A Simplistic Model of Neural Scaling Laws: Multiperiodic Santa Fe Processes. CoRR abs/2302.09049 (2023) - [i23]Lukasz Debowski:
Recurrence and repetition times in the case of a stretched exponential growth. CoRR abs/2306.14703 (2023) - [i22]Lukasz Debowski:
Corrections of Zipf's and Heaps' Laws Derived from Hapax Rate Models. CoRR abs/2307.12896 (2023) - [i21]Lukasz Debowski:
Corrections to "Universal Densities Exist for Every Finite Reference Measure". CoRR abs/2311.08951 (2023) - 2022
- [j18]Lukasz Debowski
Universal coding and Prediction on Ergodic Random Points. Bull. Symb. Log. 28(3): 387-412 (2022) - [i20]Lukasz Debowski:
Universal Densities Exist for Every Finite Reference Measure. CoRR abs/2209.11981 (2022) - [i19]Lukasz Debowski:
Local Grammar-Based Coding Revisited. CoRR abs/2209.13636 (2022) - [i18]Lukasz Debowski:
There Are Fewer Facts Than Words: Communication With A Growing Complexity. CoRR abs/2211.01031 (2022) - 2021
- [j17]Lukasz Debowski
A Refutation of Finite-State Language Models through Zipf's Law for Factual Knowledge. Entropy 23(9): 1148 (2021) - 2020
- [j16]Lukasz Debowski
Approximating Information Measures for Fields. Entropy 22(1): 79 (2020) - [j15]Lukasz Debowski
Information Theory and Language. Entropy 22(4): 435 (2020) - [i17]Lukasz Debowski:
On a Class of Markov Order Estimators Based on PPM and Other Universal Codes. CoRR abs/2003.04754 (2020) - [i16]Lukasz Debowski, Tomasz Steifer:
Universal Coding and Prediction on Martin-Löf Random Points. CoRR abs/2005.03627 (2020) - [i15]Lukasz Debowski:
Bounds for Algorithmic Mutual Information and a Unifilar Order Estimator. CoRR abs/2011.12845 (2020)
2010 – 2019
- 2018
- [j14]Lukasz Debowski
Is Natural Language a Perigraphic Process? The Theorem about Facts and Words Revisited. Entropy 20(2): 85 (2018) - [j13]Lukasz Debowski
Maximal Repetition and Zero Entropy Rate. IEEE Trans. Inf. Theory 64(4): 2212-2219 (2018) - 2017
- [j12]Lukasz Debowski
Regular Hilberg Processes: An Example of Processes With a Vanishing Entropy Rate. IEEE Trans. Inf. Theory 63(10): 6538-6546 (2017) - [i14]Lukasz Debowski:
Is Natural Language Strongly Nonergodic? A Stronger Theorem about Facts and Words. CoRR abs/1706.04432 (2017) - 2016
- [j11]Ryosuke Takahira, Kumiko Tanaka-Ishii
Entropy Rate Estimates for Natural Language - A New Extrapolation of Compressed Large-Scale Corpora. Entropy 18(10): 364 (2016) - [c9]Ryosuke Takahira, Kumiko Tanaka-Ishii, Lukasz Debowski:
Upper Bound of Entropy Rate Revisited --A New Extrapolation of Compressed Large-Scale Corpora--. CL4LC@COLING 2016 2016: 213-221 - [c8]Lukasz Debowski
Consistency of the plug-in estimator of the entropy rate for ergodic processes. ISIT 2016: 1651-1655 - [p3]Lukasz Debowski
Estimation of Entropy from Subword Complexity. Challenges in Computational Statistics and Data Mining 2016: 53-70 - [i13]Lukasz Debowski:
Consistency of the Plug-In Estimator of the Entropy Rate for Ergodic Processes. CoRR abs/1601.06014 (2016) - [i12]Lukasz Debowski:
Maximal Repetition and Zero Entropy Rate. CoRR abs/1609.04683 (2016) - 2015
- [j10]Lukasz Debowski
Maximal Repetitions in Written Texts: Finite Energy Hypothesis vs. Strong Hilberg Conjecture. Entropy 17(8): 5903-5919 (2015) - [j9]Lukasz Debowski
The Relaxed Hilberg Conjecture: A Review and New Experimental Support. J. Quant. Linguistics 22(4): 311-337 (2015) - [j8]Lukasz Debowski
A Preadapted Universal Switch Distribution for Testing Hilberg's Conjecture. IEEE Trans. Inf. Theory 61(10): 5708-5715 (2015) - [j7]Lukasz Debowski
Hilberg Exponents: New Measures of Long Memory in the Process. IEEE Trans. Inf. Theory 61(10): 5716-5726 (2015) - [p2]Lukasz Debowski:
A New Universal Code Helps to Distinguish Natural Language from Random Texts. Recent Contributions to Quantitative Linguistics 2015: 41-50 - [i11]Lukasz Debowski:
Regular Hilberg Processes: An Example of Processes with a Vanishing Entropy Rate. CoRR abs/1508.06158 (2015) - 2014
- [i10]Lukasz Debowski:
Hilberg Exponents: New Measures of Long Memory in the Process. CoRR abs/1403.1757 (2014) - 2013
- [c7]Ramon Ferrer-i-Cancho, Lukasz Debowski:
Constant entropy rate and related hypotheses versus real language. CogSci 2013 - [i9]Ramon Ferrer-i-Cancho, Lukasz Debowski, Fermín Moscoso del Prado Martín:
Constant conditional entropy and related hypotheses. CoRR abs/1304.7359 (2013) - [i8]Lukasz Debowski:
A Preadapted Universal Switch Distribution for Testing Hilberg's Conjecture. CoRR abs/1310.8511 (2013) - 2012
- [j6]Lukasz Debowski
Mixing, Ergodic, and Nonergodic Processes With Rapidly Growing Information Between Blocks. IEEE Trans. Inf. Theory 58(6): 3392-3401 (2012) - [i7]Lukasz Debowski:
On Hidden Markov Processes with Infinite Excess Entropy. CoRR abs/1211.0834 (2012) - 2011
- [j5]Lukasz Debowski
On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts. IEEE Trans. Inf. Theory 57(7): 4589-4599 (2011) - [i6]Lukasz Debowski:
Mixing, Ergodic, and Nonergodic Processes with Rapidly Growing Information between Blocks. CoRR abs/1103.3952 (2011) - 2010
- [p1]Lukasz Debowski:
A link between the number of set phrases in a text and the number of described facts. Text and Language 2010: 31-36
2000 – 2009
- 2009
- [j4]Lukasz Debowski
Valence extraction using EM selection and co-occurrence matrices. Lang. Resour. Evaluation 43(4): 301-327 (2009) - [c6]Lukasz Debowski
Computable Bayesian Compression for Uniformly Discretizable Statistical Models. ALT 2009: 53-67 - [i5]Lukasz Debowski:
The Redundancy of a Computable Code on a Noncomputable Distribution. CoRR abs/0901.2321 (2009) - 2008
- [i4]Lukasz Debowski:
On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts. CoRR abs/0810.3125 (2008) - 2007
- [c5]Lukasz Debowski:
Menzerath's law for the smallest grammars. Exact Methods in the Study of Language and Text 2007: 77-86 - [c4]Lukasz Debowski
On vocabulary size of grammar-based codes. ISIT 2007: 91-95 - [i3]Lukasz Debowski:
Valence extraction using the EM selection and co-occurrence matrices. CoRR abs/0711.4475 (2007) - [i2]Lukasz Debowski:
On vocabulary size of grammar-based codes. CoRR abs/cs/0701047 (2007) - 2006
- [j3]Lukasz Debowski
On Hilberg's law and its links with Guiraud's law. J. Quant. Linguistics 13(1): 81-109 (2006) - 2005
- [i1]Lukasz Debowski:
On Hilberg's Law and Its Links with Guiraud's Law. CoRR abs/cs/0507022 (2005) - 2004
- [c3]Lukasz Debowski:
Trigram morphosyntactic tagger for Polish. Intelligent Information Systems 2004: 409-413 - [c2]Adam Przepiórkowski, Zygmunt Krynicki, Lukasz Debowski, Marcin Wolinski, Daniel Janus, Piotr Banski:
A Search Tool for Corpora with Positional Tagsets and Ambiguities. LREC 2004 - 2002
- [j2]Lukasz Debowski:
Zipf's law against the text size: a half-rational model. Glottometrics 4: 49-60 (2002) - [j1]Lukasz Debowski, Jan Hajic, Vladislav Kubon:
Testing the Limits - Adding a New Language to an MT System. Prague Bull. Math. Linguistics 78: 95-102 (2002) - 2001
- [c1]Lukasz Debowski
A Revision of Coding Theory for Learning from Language. FGMOL 2001: 53-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-13 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: