Filters








9,453 Hits in 5.3 sec

Cumulative subject index

1978 Information and Control  
, plain and covariant, 39, 73 Function cost, finite automata with, 37, 40 entropy, and polymatroid, 39, 55 growth, of D0L systems, 36, 85 rate distortion, for source coding with side information  ...  in residue code, 39, 46 probability of, f-entropies and, 39, 227 protection, unequal: optimal encodings of linear block codes for, 37, 150 Events fuzzy, probability measures of: use in fuzzy decision  ... 
doi:10.1016/s0019-9958(78)90707-6 fatcat:3g6qa5hi2zc2lgyyvndbar65di

Page 4346 of Mathematical Reviews Vol. , Issue 2000f [page]

2000 Mathematical Reviews  
(RS-NNPD-CHC; Nizhnii Novgorod) On entropy and optimal coding cost for stochastic language. (English summary) Fund. Inform. 36 (1998), no. 2-3, 285-305.  ...  “For any stochastic language with a finite entropy we establish lower and upper bounds of the optimal coding cost, dependent only on the entropy, and we prove their unimprovability.  ... 

Page 2213 of Mathematical Reviews Vol. , Issue 88d [page]

1988 Mathematical Reviews  
They consider the optimal control problem (3) with the cost (4) E Io k(x(s), u(s)) ds. It is proved that an optimal control of (3), (4) is d-optimal for (1), (2) (6 > 0).  ...  (I-PADV) Nearly optimal state feedback controls for stochastic systems with wideband noise disturbances. SIAM J. Control Optim. 25 (1987), no. 2, 298-315.  ... 

Page 2695 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
(RS-NNPU; Nizhnii Novgorod) A lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages. (Russian. Russian summary) Diskretn. Anal. Issled. Oper.  ...  For such a language we obtain an unimprovable lower bound for the binary coding cost.  ... 

Page 1178 of Mathematical Reviews Vol. , Issue 94b [page]

1994 Mathematical Reviews  
(GE-TBIL-PB; Tbilisi) Optimal transmission of Gaussian signals involving cost for transmission and feedback.  ...  Under an average power constraint, the optimal coding and decoding functions are constructed to minimize the sum of the mean square transmission error of the signal and the cost for the transmission and  ... 

How (Non-)Optimal is the Lexicon? [article]

Tiago Pimentel, Irene Nikkarinen, Kyle Mahowald, Ryan Cotterell, Damián Blasi
2021 arXiv   pre-print
Examining corpora from 7 typologically diverse languages, we use those upper bounds to quantify the lexicon's optimality and to explore the relative costs of major constraints on natural codes.  ...  We find that (compositional) morphology and graphotactics can sufficiently account for most of the complexity of natural codes -- as measured by code length.  ...  Blasi's research was also executed within the framework of the HSE University Basic Research Program and funded by the Russian Academic Excellence Project '5-100'.  ... 
arXiv:2104.14279v2 fatcat:qs26nmi3ejc3hcptn7hl4kkk7q

Cumulative subject index volumes 30–32

1976 Information and Control  
context-free and context-sensitive, on kolam array grammars, 32, 272 feedback near-optimum, for nonlinear systems, 32, 75 Control signals optimal bandlimlted, without con- vexity condition, 31,201  ...  stochastic languages, 30, 96 reconstruction, computer implementa- tion of Bayesian analysis, 31, 364 Information measures, directed divergence of type 8, 31, 185 useful, and questionnaires, 32  ... 
doi:10.1016/s0019-9958(76)90300-4 fatcat:6uhmar7mq5bq3emjcviioes64a

Page 353 of Mathematical Reviews Vol. , Issue 86a [page]

1986 Mathematical Reviews  
Martin d’Héres) 86a:68074 Phan Dinh Diéu 86a:68075 Notes on the recursiveness of stochastic languages and on noncontextfree stochastic languages. Elektron. Informationsverarb.  ...  Shyr and Thierrin (“Codes and com- patible partial orders on free monoids” , Astérisque, to appear]).  ... 

Information Theory as a Bridge Between Language Function and Language Form

Richard Futrell, Michael Hahn
2022 Frontiers in Communication  
We illustrate this principle using recently-obtained results on universals of word and morpheme order.  ...  to constrained optimization problems.  ...  A code is any (stochastic) function from messages to signals: we have not yet imposed any restrictions whatsoever on that function.  ... 
doi:10.3389/fcomm.2022.657725 fatcat:r62rmtfypvbevnbrnzoasg452y

An Entropic Relevance Measure for Stochastic Conformance Checking in Process Mining [article]

Artem Polyvyanyy, Alistair Moffat, Luciano García-Bañuelos
2020 arXiv   pre-print
Here we present an entropic relevance measure for stochastic conformance checking, computed as the average number of bits required to compress each of the log's traces, based on the structure and information  ...  Recent approaches to conformance checking acknowledge that the elements being compared are inherently stochastic - for example, some traces occur frequently and others infrequently - and seek to incorporate  ...  Hanan Alkhammash and Thomas Vogelgesang provided assistance with the preparation of the datasets used in Section V.  ... 
arXiv:2007.09310v2 fatcat:tvlzf66au5cijlqgvte5ijcz3y

Estimating Predictive Rate–Distortion Curves via Neural Variational Inference

Michael Hahn, Richard Futrell
2019 Entropy  
Based on the results, we argue that the Predictive Rate–Distortion curve is more useful than the usual notion of statistical complexity for characterizing highly complex processes such as natural language  ...  The Predictive Rate–Distortion curve quantifies the trade-off between compressing information about the past of a stochastic process and predicting its future accurately.  ...  Understanding the complexity of prediction in language holds promise for enabling a deeper understanding of the nature of language as a stochastic process, and to human language processing.  ... 
doi:10.3390/e21070640 pmid:33267354 pmcid:PMC7515133 fatcat:kbnidve5v5aknmz5yumzdrl34i

Page 4097 of Mathematical Reviews Vol. , Issue 91G [page]

1991 Mathematical Reviews  
We present a new metric for de- coding in such a channel that is a generalization of the correlation metric and in many cases turns out to be close to the optimal met- ric.  ...  Systems of equations of the antiprefix property in words are used to describe codes that are decipherable with finite delay for various structural models of languages.  ... 

Entropy Minimization In Emergent Languages [article]

Eugene Kharitonov and Rahma Chaabouni and Diane Bouchacourt and Marco Baroni
2020 arXiv   pre-print
We investigate here the information-theoretic complexity of such languages, focusing on the basic two-agent, one-exchange setup.  ...  We conclude by discussing the implications of our findings for the study of natural and artificial communication systems.  ...  Acknowledgements The authors thank Emmanuel Dupoux for discussions and the anonymous reviewers for their feedback.  ... 
arXiv:1905.13687v3 fatcat:dugglhpaofgdrmagoxsfhevwpm

The morphospace of language networks [article]

Luís F Seoane, Ricard Solé
2018 arXiv   pre-print
Here we present a detailed analysis of network properties on a generic model of a communication code, which reveals a rather complex and heterogeneous morphospace of language networks.  ...  Most studies of language evolution deal in a way or another with such theoretical contraption and explore the outcome of diverse forms of selection on the communication matrix that somewhat optimizes communication  ...  Fortunately, those classes reach deeper inside the morphospace and do not seem to depend so much on Pareto optimal solutions.  ... 
arXiv:1803.01934v1 fatcat:t4pbvakijncybhbqlwd4cbkply

An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL

Valentin Zhikov, Hiroya Takamura, Manabu Okumura
2013 Transactions of the Japanese society for artificial intelligence  
An evaluation with corpora in Japanese, Thai, English, and the "CHILDES" corpus for research in language development reveals that the algorithm achieves an accuracy, comparable to that of the state-of-the-art  ...  The model uses branching entropy as a means of constraining the hypothesis space, in order to efficiently obtain a solution that minimizes the length of a two-part MDL code.  ...  On one hand, the correspondence between description length and F-score is not absolutely perfect, and this may pose an obstacle to the optimization process for relatively small language samples.  ... 
doi:10.1527/tjsai.28.347 fatcat:rtiphm7djna7reljotxxch4kye
« Previous Showing results 1 — 15 out of 9,453 results