A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Our mechanism relies on the Minimum Message Length Principle for the selection of an interpretation among candidate options. ... We describe a mechanism which receives as input a segmented argument composed of NL sentences, and generates an interpretation. ... We present a mechanism for the interpretation of NL arguments which is based on the application of the Minimum Message Length (MML) Principle for the evaluation of candidate interpreta-tions (Wallace ...doi:10.3115/1118121.1118148 dblp:conf/sigdial/ZukermanG02 fatcat:3vm5u2l4y5gqdeqsb6f7xpaqce
Lecture Notes in Computer Science
We describe an argument-interpretation mechanism based on the Minimum Message Length Principle , and investigate the incorporation of a model of the user's beliefs into this mechanism. ... This interpretation may differ from the user's argument in its structure and in its beliefs in the argument propositions. ... The basic discourse-interpretation mechanism relies on the Minimum Message Length (MML) Principle  to evaluate candidate discourse interpretations  . ...doi:10.1007/3-540-44963-9_15 fatcat:vs2hnorwvnhdbexr5ads6eeewq
We present theoretical arguments and empirical evidence for compressibility, and discuss the matter in the framework of Minimum Message Length (MML) inference, which shows that the theory which best compresses ... Yet in our work we compress empirical data all the time, using Wallace's Minimum Message Length principle to choose the best explanation of the data. ... The Minimum Message Length principle Minimum Message Length encoding shares some of the central insights of algorithmic information theory, but adds to them techniques from optimal coding theory. ...doi:10.1016/j.shpsa.2005.04.004 fatcat:jx2ukya2rzambhli74jf42xswi
The R Journal
However, this flexibility has its price: As the R interpreter has no information about the expected variable type, many base functions automatically convert the input instead of raising an exception. ... The package checkmate provides a plethora of functions to check the type and related properties of the most frequently used R objects and variable types. ... More examples can be found in Table 2 Base R DSL Single string is.character(x) && length(x) == 1 "s1" Factor with minimum length 1, no missing values is.factor(x) && length(x) >= 1 && all(! ...doi:10.32614/rj-2017-028 fatcat:lik2urrm5bgenh2f3wbrkyfgka
The ideas are shown to apply to a number of commonly used text models. ... This algorithm allows us to cluster Markov states, and thereby base our compression algorithm on a smaller number of probability distributions than would otherwise have been required. ... The interpretation of the above approximation formula is important enough to merit a more detailed argument. ...doi:10.1145/78915.78917 fatcat:xyh4u47kkjhgxeafyhgedklqne
., generating your own arguments) is often more persuasive than direct persuasion (i.e., being provided with arguments), even when the technique is applied in media messages by framing the message as a ... Contrary to expectations, both posters failed to affect alcohol consumption, regardless of exposure length. ... Factors were coded using sum-to-zero contrasts and covariates were mean-centered for interpretation purposes. ...doi:10.1371/journal.pone.0211030 pmid:30677084 pmcid:PMC6345482 fatcat:gnmy34mm2zha7afpo2q5qg43s4
Lecture Notes in Computer Science
This paper examines the Behrens-Fisher-type problem within the minimum message length framework of inductive inference. ... The minimum message length procedure is then compared against well-known methods on the Behrens-Fisher hypothesis testing problem and the estimation of the common mean problem showing excellent performance ... This paper examines the Behrens-Fisher problem using the minimum message length (MML) principle of inductive inference. ...doi:10.1007/978-3-642-44958-1_19 fatcat:tp4kqprojza6rj3bohid5h73nm
Yet just two messages suffice to reduce communication to almost the minimum: for all random pairs, C< 4C,. + 3. ... It is known that one-message communication may require exponentially more bits than the minimum possible: for some random pairs, C; = 2°='. ...
The purpose of the initial sections appears to be to provide a justification for the authors' principle minimum message length (MML) within the theory of algorithmic complexity. ... The authors' other version, the strict MML estimator, also fails to minimize the message length. ...doi:10.1093/comjnl/42.4.327 fatcat:kpg7yetlrffk7mld3ehjw6fcve
The remaining three parameters denote the minimum packet length, the maximum packet length and the length of the frame information (header and trailer), respectively. ... A protocol may impose restrictions on the maximum and/or minimum length of the packet's information part. ... We assign symbolic names for all actions of the protocol processes: The last macro is used to check whether a station has a packet to transmit, and if so, to place the packet in the buffer (call to get_packet ...doi:10.1002/spe.4380210105 fatcat:mi5it7snxff7bftdz7icmjyqa4
The Modern Language Journal
The sound arguments he is able to use in favor of this thought have been supplied by science, but the patience and fervor with which he repeats these arguments, and the tact with which he often succeeds ... should be selected and clearly announced as the minimum result of the course and that the attempt to accomplish too much always results in nothing. ...
Rissanen's method of parameter truncation is contrasted with that employed in various versions of Wallace's minimum message length criteria. ... We then introduce the concepts underlying Rissanen's minimum description length principle via a Bayesian scenario with a known prior; this provides the groundwork for understanding his more complex non-Bayesian ... Inference via the minimization of (20) has been studied most in depth by Rissanen, who uses term "minimum description length," and Wallace, who prefers the name "minimum message length." ...doi:10.1111/j.1751-5823.2001.tb00456.x fatcat:5i5bvei455bmhc5u5ishhlww3m
Rissanen's method of parameter truncation is contrasted with that employed in various versions of Wallace's minimum message length criteria. ... We then introduce the concepts underlying Rissanen's minimum description length principle via a Bayesian scenario with a known prior; this provides the groundwork for understanding his more complex non-Bayesian ... Inference via the minimization of (20) has been studied most in depth by Rissanen, who uses term "minimum description length," and Wallace, who prefers the name "minimum message length." ...doi:10.2307/1403813 fatcat:fvq7a5vdkjcodp2apguaf6djei
constitute the message of a text. ... Each of the core and use-specific parameters is given a weighting as well as a minimum requirement for that text (using 10=excellent, 8=very satisfactory, and so on). ...doi:10.7202/013278ar fatcat:3ghcaqwkbfgkzm4ywg54zr3aze
Lecture Notes in Computer Science
We propose that Solomonoff induction is complete in the physical sense via several strong physical arguments. We also argue that Solomonoff induction is fully applicable to quantum mechanics. ... We show how to choose an objective reference machine for universal induction by defining a physical message complexity and physical message probability, and argue that this choice dissolves some well-known ... This was achieved by adopting a physical definition of complexity, wherein program length was interpreted as physical length. ...doi:10.1007/978-3-319-21365-1_14 fatcat:i4dnvmfkczh7bhb64rnqfxmajy
« Previous Showing results 1 — 15 out of 65,408 results