Subject: Re: [xsl] Re: Efficient dictionary lookup From: David Carlisle <davidc@xxxxxxxxx> Date: Fri, 23 Mar 2012 09:12:41 +0000 |
the spellcheck dictionary is big
It depends on what you are doing of course, but if the dictionary doesn't change much and you need to process a lot of documents against it, it is possible to just parse and index the dictionary key once and so that cost is shared out across all the documents. the details are highly processor specific of course so probably best to ask on the product lists about that, rather than this one.
-- google plus: https:/profiles.google.com/d.p.carlisle
________________________________________________________________________ The Numerical Algorithms Group Ltd is a company registered in England and Wales with company number 1249803. The registered office is: Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom.
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
[xsl] Re: Efficient dictionary look, Martin Holmes | Thread | [xsl] Re: Efficient dictionary look, Martin Holmes |
Re: [xsl] loop without switching co, Michael Kay | Date | [xsl] Re: Efficient dictionary look, Martin Holmes |
Month |