A Maximum Entropy Approach to Identifying Sentence Boundaries

Details A Maximum Entropy Approach to Identifying Sentence Boundaries A Maximum Entropy Approach to Identifying Sentence Boundaries

1997-04-09

arxiv.org/abs/cmp-lg/9704002v1

Proceedings of the 5th ANLP Conference, 1997

Computer Science

Computation and Language

4 pages, uses aclap.sty and covingtn.sty

Scientific paper

We present a trainable model for identifying sentence boundaries in raw text. Given a corpus annotated with sentence boundaries, our model learns to classify each occurrence of ., ?, and ! as either a valid or invalid sentence boundary. The training procedure requires no hand-crafted rules, lexica, part-of-speech tags, or domain-specific information. The model can therefore be trained easily on any genre of English, and should be trainable on any other Roman-alphabet language. Performance is comparable to or better than the performance of similar systems, but we emphasize the simplicity of retraining for new domains.

Affiliated with

Also associated with

No associations

Rating

A Maximum Entropy Approach to Identifying Sentence Boundaries 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 A Maximum Entropy Approach to Identifying Sentence Boundaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Maximum Entropy Approach to Identifying Sentence Boundaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289305