We consider what tagging models are most appropriate as front ends for probabilistic context-free grammar parsers. In particular, we ask if using a "multiple tagger", a tagger that returns more than one tag, improves parsing performance. Our conclusion is somewhat surprising: single-tag Markov-mode
On transformations of belief functions to probabilities
β Scribed by Milan Daniel
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 281 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
β¦ Synopsis
Alternative approaches to the widely known pignistic transformation of belief functions are presented and analyzed. Pignistic, cautious, proportional, and disjunctive probabilistic transformations are examined from the point of view of their interpretation, of decision making and ~from the point of view! of their commutation with rules ~operators! for belief function combination. A relation to the plausibility probabilistic transformation is added.
π SIMILAR VOLUMES
Uncertainty has been treated in science for several decades. It always exists in real systems. Probability has been traditionally used in modeling uncertainty. Belief and plausibility functions based on the Dempster-Shafer theory ~DST! become another method of measuring uncertainty, as they have bee
## THE EVALUATION OF ROTATIONAL TRANSITION PROBAElLITlES FROM DISTRIEWTION FIJNCTIQNS A method is described for the evaluaiion of rolalional rransition probabilities from the nonequilibrium distributions posscssed by'the products of certain chemical reactions. Results obtained f'rom rite method ar