Adjusting a hidden Markov model tagger for sentence fragments
First Claim
1. In a system for parsing information representative of a sequence of words having parts of speech, said sequence of words including at least one sentence fragment, a method for determining a part of speech of a word of said sequence of words, comprising the steps of:
- providing a hidden Markov model for determining the most likely part of speech of a selected word of said sequence of words, said hidden Markov model having an initial transition matrix and a subsequent transition matrix for storing probabilities of occurrence of said parts of speech, wherein said probabilities of occurrence within said initial transition matrix of said hidden Markov model are equal to each other; and
applying said hidden Markov model to said sequence of words to determine said most likely part of speech of said selected word within said sentence fragment with increased accuracy.
4 Assignments
0 Petitions
Accused Products
Abstract
A system for parsing information representative of a sequence of words having parts of speech. The sequence of words forms a sentence or sentence fragment. A hidden Markov model is provided for determining the most likely part of speech of a selected word of the sequence of words. The hidden Markov model has an initial transition matrix and a subsequent transition matrix for storing probabilities of occurrence of the parts of speech. The initial transition matrix of the hidden Markov model is removed to provide a modified hidden Markov model. The modified hidden Markov model is applied to the sequence of words to determine the most likely part of speech of a selected word within a sentence fragment with increased accuracy.
186 Citations
15 Claims
-
1. In a system for parsing information representative of a sequence of words having parts of speech, said sequence of words including at least one sentence fragment, a method for determining a part of speech of a word of said sequence of words, comprising the steps of:
-
providing a hidden Markov model for determining the most likely part of speech of a selected word of said sequence of words, said hidden Markov model having an initial transition matrix and a subsequent transition matrix for storing probabilities of occurrence of said parts of speech, wherein said probabilities of occurrence within said initial transition matrix of said hidden Markov model are equal to each other; and applying said hidden Markov model to said sequence of words to determine said most likely part of speech of said selected word within said sentence fragment with increased accuracy. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system for parsing information representative of a sequence of words having parts of speech, said sequence of words including at least one sentence fragment, said system having a probability system for determining a part of speech of a word of said sequence of words, comprising:
-
a hidden Markov model for determining the most likely part of speech of a selected word of said sequence of words, said hidden Markov model having an initial transition matrix and a subsequent transition matrix for storing probabilities of occurrence of said parts of speech; said probabilities of occurrence of said initial transition matrix of said hidden Markov model being equal to each other; and a part of speech tagger for applying said hidden Markov model to said sequence of words to determine said most likely part of speech of said selected word within said sentence fragment with increased accuracy. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
Specification