Thanks for this suggestion. This coincide what Karl Wettin suggested
ngram approach.
This is a good alternative and very simple. However, two drawbacks:
extra indexing and non-linear index size.
A more complicated alternative solution can combine this approach with
wildcard query. For the first
Hi,
I wonder if this is possible:
Return all Terms of a Field in the Index together with the number of
occurances
in all documents.
E.g. have 10 Documents with the Field "author" in the index, 5 of them
having
the value "foo" and 5 "bar" I would like to build a map with:
[foo] -> 5
[bar] -> 5
You can work like with lucene spelling.
A specific Index with word as Document, boost with something
proportionnal of number of occurences (with log and math magic)
The magical stuff is n Fields with starting ngram, not stored, no
tokenized.
For example, if you wont to index the word "carott",
thanks the apprach you and Donna Gresh suggested worked out fine. I now have
a much better understanding of the Document class.
here is the create Document code in case another newie is interested. as
more mine types are added I will expand the in if
thanks again
jim s
public class KcmiDo