𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Implementing an efficient part-of-speech tagger

✍ Scribed by Johan Carlberger; Viggo Kann


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
131 KB
Volume
29
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

✦ Synopsis


An efficient implementation of a part-of-speech tagger for Swedish is described. The stochastic tagger uses a well-established Markov model of the language. The tagger tags 92 per cent of unknown words correctly and up to 97 per cent of all words. Several implementation and optimization considerations are discussed. The main contribution of this paper is the thorough description of the tagging algorithm and the addition of a number of improvements. The paper contains enough detail for the reader to construct a tagger for his own language.


πŸ“œ SIMILAR VOLUMES


An efficient concurrent implementation o
✍ R. Andonie; A. T. Chronopoulos; D. Grosu; H. Galmeanu πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

The focus of this study is how we can efficiently implement the neural network backpropagation algorithm on a network of computers (NOC) for concurrent execution. We assume a distributed system with heterogeneous computers and that the neural network is replicated on each computer. We propose an arc

Implementation of an efficient shooting
✍ Fatih Dikmen; A.Arif Ergin; A. Levent Sevgili; Bilgin Terzi πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 631 KB

## Abstract Implementation of the shooting and bouncing rays (SBR) method for radar cross section or scattering center prediction of complex electrically large objects is studied with a focus on the computational efficiency. A triangulated CAD model is assumed and SBR is processed by a ray‐triangle

An efficient implementation of an algori
✍ Hadjiconstantinou, E.; Christofides, N. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 263 KB πŸ‘ 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho

Design, implementation and evaluation of
✍ A.-M. Kermarrec; C. Morin; M. BanΓ’tre πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 348 KB πŸ‘ 2 views

In the light of the increasing throughput of local area networks, Networks Of Workstations (NOWs) which provide a Distributed Shared Memory (DSM) have become a convenient and cheaper alternative to parallel architectures in the framework of parallel scientific applications. However, the probability