Probabilistic Tagging with Feature Structures

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Coling-94, 85 KB, 5 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Probabilistic Tagging with Feature Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic Tagging with Feature Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Tagging with Feature Structures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-351653

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.