Contextual tagger utilizing deterministic finite state transduce

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395794, G06F 727

Patent

active

056108125

ABSTRACT:
A system for assigning part-of-speech tags to English text includes an improved contextual tagger which utilizes a deterministic finite state transducer to improve tagging speed such that large documents can have its sentences accurately tagged as to parts of speech to permit fast grammar checking, spell checking, information retrieval, text indexing and optical character recognition. The subject system performs by first acquiring a set of rules by examining a training corpus of tagged text. Then, these rules are transformed into a deterministic finite-state transducer through the utilization of non-deterministic transducers, a composer and a determiniser. In order to tag an input sentence, the sentence is initially tagged by first assigning each word in the sentence with its most likely part of speech tag regardless of the surrounding words in the sentences. The deterministic finite-state transducer is then applied on the resulting sequence of part of speech tags using the surrounding words and obtains the final part of speech tags. The Subject System requires an amount of time to compute the part-of-speech tags which is proportional to the number of words in the input sentence and which is independent of the number of rules it has applied.

REFERENCES:
patent: 4579533 (1986-04-01), Anderson et al.
patent: 4661942 (1987-04-01), Okamoto et al.
patent: 4674065 (1987-06-01), Lange et al.
patent: 4830521 (1989-05-01), Sakai et al.
patent: 4864501 (1989-09-01), Kucera et al.
patent: 4864502 (1989-09-01), Kucera et al.
patent: 4868750 (1989-09-01), Kucera et al.
patent: 5146405 (1992-09-01), Church
patent: 5297040 (1994-03-01), Hu
patent: 5333313 (1994-07-01), Heising
Karttunen; "Finite-State Constraints"; International Conference on Current ssues in Computational Linguistics; Jun. 10-14, 1991.
Kupiec; "Robust Part-of-Speech Tagging Using a Hidden Markov Model"; Computer Speech and Language (1992) 6; 225-242.
Dialog Abstract; File 2, Acc#04284972; Moisl; "Connectionist Finite State Natural language Processing"; Connection Science; v4 n2; pp. 67-91.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Contextual tagger utilizing deterministic finite state transduce does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Contextual tagger utilizing deterministic finite state transduce, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Contextual tagger utilizing deterministic finite state transduce will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-448411

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