๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Evaluating evolutionary algorithms

โœ Scribed by W. Whitney; S. Rana; J. Dzubera; K.E. Mathias


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
165 KB
Volume
84
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis


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-model taggers are quite adequate for the task. First of all, parsing accuracy, as measured by the correct assignment of parts of speech to words, does not increase significantly when parsers select the tags themselves. In addition, the work required to parse a sentence goes up with increasing tag ambiguity, though not as much as one might expect. Thus, for the moment, single taggers are the best taggers.


๐Ÿ“œ SIMILAR VOLUMES


Immune-based evolutionary algorithm for
โœ Caihong Hou; Yongsheng Ding; Xianyi Zeng ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 369 KB

Evaluation on the performance and quality of textile products is very important in textile industry, for example, clustering-based fabric evaluation. Classical clustering methods have some disadvantages, one of which is that the parameters of fabrics are straightly clustered without extracting their

Backward-chaining evolutionary algorithm
โœ Riccardo Poli; William B. Langdon ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 376 KB
Evolutionary graph drawing algorithms
โœ Huang Jing-wei; Wei Wen-fang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Wuhan University ๐ŸŒ English โš– 389 KB
Evaluating GLR parsing algorithms
โœ Adrian Johnstone; Elizabeth Scott; Giorgios Economopoulos ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 495 KB

We describe the behaviour of three variants of GLR parsing: (i) Farshi's original correction to Tomita's non-general algorithm; (ii) the Right Nulled GLR algorithm which provides a more efficient generalisation of Tomita and (iii) the Binary Right Nulled GLR algorithm, on three types of LR table. We