arXiv Open Access 1994

Probabilistic Tagging with Feature Structures

Andre Kempe

Lihat Sumber

Abstrak

The described tagger is based on a hidden Markov model and uses tags composed of features such as part-of-speech, gender, etc. The contextual probability of a tag (state transition probability) is deduced from the contextual probabilities of its feature-value-pairs. This approach is advantageous when the available training corpus is small and the tag set large, which can be the case with morphologically rich languages.

Topik & Kata Kunci

cs.CL

Penulis (1)

Andre Kempe

Format Sitasi

APA MLA BibTeX

Kempe, A. (1994). Probabilistic Tagging with Feature Structures. https://arxiv.org/abs/cmp-lg/9410027

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 1994
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓