RE: A really hairy token graph case

2014-10-24 Thread Will Martin
ugh the kb info captured there. https://github.com/OpenSextant/SolrTextTagger/issues/10 -Original Message- From: Benson Margulies [mailto:ben...@basistech.com] Sent: Friday, October 24, 2014 5:54 PM To: java-user@lucene apache. org; Richard Barnes Subject: Re: A really hairy token gra

Re: A really hairy token graph case

2014-10-24 Thread Benson Margulies
I don't think so ... Let me be specific: First, consider the case of one 'analysis': an input token maps to a lemma and a sequence of components. So, we product surface form lemmaPI 0 comp1PI 0 comp2PI 1 . with PL set appropriately to cover the pieces. A

RE: A really hairy token graph case

2014-10-24 Thread Will Martin
HI Benson: This is the case with n-gramming (though you have a more complicated start chooser than most I imagine). Does that help get your ideas unblocked? Will -Original Message- From: Benson Margulies [mailto:bimargul...@gmail.com] Sent: Friday, October 24, 2014 4:43 PM To: java-us