Ted, thanks very much.
Thoughts in response to both of your messages:
1: alpha-beta is being used here in the sense of E+M. Or, to be
specific, alpha is the path sum from the beginning to the current
'time', and beta is the path sum from the current 'time' to the end.
2: I had read about that
Benson,
One more thing. I forget the actual reference, but the best Chinese
segmenter that I have seen in practice (whose name I forget) was able to get
away with a simple unweighted lexicon and 2-3 word look-ahead + average word
length for score. This indicates to me that you can depth bound
On Sun, Feb 14, 2010 at 4:47 PM, Ted Dunning ted.dunn...@gmail.com wrote:
Benson,
One more thing. I forget the actual reference, but the best Chinese
segmenter that I have seen in practice (whose name I forget) was able to get
away with a simple unweighted lexicon and 2-3 word look-ahead +
I should rephrase one thing. Our current product \started out/ a lot
like that. It wasn't good enough for the Google's of the world, so it
started to grow hair. We're looking at a statistical retread because
the hair gets harder and harder to comb.
On Sun, Feb 14, 2010 at 4:47 PM, Ted Dunning
Folks,
Here's one of my occasional questions in which I am, in essence,
bartering my code wrangling efforts for expertise on hard stuff.
Consider a sequence problem addressed with a perceptron model with an
ordinary Viterbi decoder. There's a standard confidence estimation
technique borrowed
Benson,
Are you using techniques related to this:
http://www.it.usyd.edu.au/~james/pubs/pdf/dlp07perc.pdf ?
On Sat, Feb 13, 2010 at 9:38 AM, Benson Margulies bimargul...@gmail.comwrote:
Folks,
Here's one of my occasional questions in which I am, in essence,
bartering my code wrangling