You are viewing a plain text version of this content. The canonical link for it is here.
Posted to java-user@lucene.apache.org by jcrowell <jc...@dsg.harvard.edu> on 2003/03/31 19:45:18 UTC
I need a list of the indexed words
I have a very simple problem: I need to get a list of the words that will
result in a hit if searched on. Should be simple, but I'm not quite sure
where to start.
Thanks,
Jon
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
RE: usage of prohibit operator '-'
Posted by Lixin Meng <li...@fulldegree.com>.
Thanks. That helps.
Lixin
-----Original Message-----
From: Scott Ganyo [mailto:scott.ganyo@etapestry.com]
Sent: Thursday, April 17, 2003 11:35 AM
To: Lucene Users List
Subject: Re: usage of prohibit operator '-'
Lucene only searches for positive results, not negative. If you think
of the "-" operator as a subtraction, then you'll understand that Lucene
requires that you also select something to subtract from.
Scott
Lixin Meng wrote:
>I am having some problems with the probhibit operator '-'. If anyone can
>shed some light on it, I certainly appreciate it.
>
>In the index, I have a field with field name 'ID'. It tried query like:
>
> ID:(+ID10)
>or
> ID:(+"ID10")
>
>It will returns some hits.
>
>However, if I try
>
> ID:(-ID10)
>or
> ID:(-"ID10")
>
>I got an empty result set, which should have some records.
>
>Any idea how to use this prohibit operator?
>
>Regards,
>Lixin
>
>
>---------------------------------------------------------------------
>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
>
--
"They who can give up essential liberty to obtain a little temporary safety
deserve neither liberty nor safety." - Benjamin Franklin
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
Re: usage of prohibit operator '-'
Posted by Scott Ganyo <sc...@etapestry.com>.
Lucene only searches for positive results, not negative. If you think
of the "-" operator as a subtraction, then you'll understand that Lucene
requires that you also select something to subtract from.
Scott
Lixin Meng wrote:
>I am having some problems with the probhibit operator '-'. If anyone can
>shed some light on it, I certainly appreciate it.
>
>In the index, I have a field with field name 'ID'. It tried query like:
>
> ID:(+ID10)
>or
> ID:(+"ID10")
>
>It will returns some hits.
>
>However, if I try
>
> ID:(-ID10)
>or
> ID:(-"ID10")
>
>I got an empty result set, which should have some records.
>
>Any idea how to use this prohibit operator?
>
>Regards,
>Lixin
>
>
>---------------------------------------------------------------------
>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
>
--
"They who can give up essential liberty to obtain a little temporary safety deserve neither liberty nor safety." - Benjamin Franklin
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
usage of prohibit operator '-'
Posted by Lixin Meng <li...@fulldegree.com>.
I am having some problems with the probhibit operator '-'. If anyone can
shed some light on it, I certainly appreciate it.
In the index, I have a field with field name 'ID'. It tried query like:
ID:(+ID10)
or
ID:(+"ID10")
It will returns some hits.
However, if I try
ID:(-ID10)
or
ID:(-"ID10")
I got an empty result set, which should have some records.
Any idea how to use this prohibit operator?
Regards,
Lixin
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
Re: I need a list of the indexed words
Posted by David Spencer <Da...@micromuse.com>.
Otis Gospodnetic wrote:
>That's a very handy class, David.
>
thanks
>Perhaps I should stick it in
>lucene-sandbox somewhere.
>
I have a handful of related utilities.
I'll try to post them as one group though it'll probably take a week to
get this
out the door.
They all take an index and then dump out the
terms/fields/docs/termdocs/termpositions
or whatnot.
>
>It depends on your Rammer class,
>
sorry, meant to sanitize it
> but for those interested in using
>this, all you need to do is pass 'name' variable to IndexReader instead
>of wrapping it in that Rammer call.
>
>Thanks,
>Otis
>
>--- David Spencer <Da...@micromuse.com> wrote:
>
>
>>jcrowell wrote:
>>
>>
>>
>>>Thanks for responding. Are you referring to the solution under the
>>>
>>>
>>title:
>>
>>
>>>"How do I retrieve all the values of a particular field that exists
>>>
>>>
>>within
>>
>>
>>>an index, across all documents" ?
>>>
>>>
>>>
>>Here's some code that might do what you want.
>>It's shows the frequency of each term also.
>>Args are "-i INDEX" and optional "-f FIELD".
>>I haven't tested it outside my tree (to see if it's clean of
>>dependencies) but
>>it looks reasonable at a glance.
>>
>>
>>
>>
>>
>>package com.tropo.lucene;
>>
>>import org.apache.lucene.analysis.*;
>>import org.apache.lucene.index.*;
>>import org.apache.lucene.document.*;
>>
>>import java.io.*;
>>import java.util.*;
>>
>>/**
>> * Call IndexReader.terms(), termPositions().
>> */
>>public class DumpTerms
>>{
>> private DumpTerms()
>> {
>> }
>>
>> /**
>> *
>> */
>> public static void main(String[] args)
>> throws Throwable
>> {
>> String name = "index";
>> String field = null;
>>
>> for ( int i = 0; i< args.length; i++)
>> {
>> if ( args[i].equals( "-i"))
>> name = args[ ++i];
>> else if ( args[i].equals( "-f"))
>> field = args[ ++i];
>> /*
>>
>> else if ( args[i].equals( "-v"))
>> v = args[ ++i];
>> */
>> }
>> o.println( "Opening "+ name);
>> final IndexReader r = IndexReader.open( Rammer.convertMaybe(
>>name));
>> final TermEnum te = r.terms();
>> final Set s =new TreeSet();
>> final List lis = new LinkedList();
>> final int docs = r.numDocs();
>> o.println( "Docs: " + docs);
>> while ( te.next())
>> {
>> Term t = te.term();
>> if ( field != null && ! field.equals( t.field()))
>>continue;
>> s.add( t.field());
>> /*
>> o.println( "field=" +t.field() +
>> " text=" + t.text() +
>> " freq="+ te.docFreq());
>> */
>> lis.add( new Object[] { t, new Integer( te.docFreq())});
>> /*
>> TermPositions tp = r.termPositions( t);
>> while ( tp.next())
>> {
>> int f = tp.freq();
>> o.println( "\t" + "doc=" + tp.doc() + " freq=" +f);
>> for ( int i = 0; i < f; i++)
>> o.println( "\t\tnextp=" + tp.nextPosition());
>> }
>> tp.close();
>> */
>> }
>> o.println( "Terms: " + lis.size());
>> Collections.sort( lis, new ICmp());
>> Iterator it = lis.iterator();
>> int[] lens = new int[ 30];
>> while ( it.hasNext())
>> {
>> Object[] ar = (Object[]) it.next();
>> Term t = (Term) ar[0];
>> int freq = ((Integer)ar[1]).intValue();
>> int len = t.text().length();
>> if ( len >= lens.length)
>> lens[ lens.length-1]++;
>> else
>> lens[ len]++;
>> o.print( fill( t.text(), 16) + " " + fill( "" + freq,
>>6));
>> int pc = (freq * 100); pc += (docs/2); pc /= docs;
>> o.print( " " +pc + "%");
>> if ( ! t.field().equals( "contents"))
>> o.println( " " + t.field());
>> else
>> o.println();
>> }
>> o.println();
>>
>> int tot_terms = lis.size();
>> for ( int i = 0; i< lens.length; i++)
>> {
>> int pc = lens[ i] * 100; pc += tot_terms/2; pc /=
>>tot_terms;
>> o.println( "" + i + ". " + lens[ i] + " " + pc + "%");
>> }
>>
>> r.close();
>> /*
>> o.println();
>> Iterator it = s.iterator();
>> while ( it.hasNext())
>> o.println( it.next());
>> */
>> }
>> /**
>> *
>> */
>> private static String fill( String s, int w)
>> {
>> int len = s.length();
>> for ( int i = len; i < w; i++)
>> s += " ";
>> return s;
>> }
>>
>> private static class ICmp
>> implements Comparator
>> {
>> public int compare( Object a, Object b)
>> {
>> Object[] a1 = (Object[]) a;
>> Object[] b1 = (Object[]) b;
>> int d1 = ((Integer)a1[1]).intValue();
>> int d2 = ((Integer)b1[1]).intValue();
>> if ( d1 < d2) return 1;
>> if ( d1 > d2) return -1;
>> return 0;
>> }
>> }
>>
>>
>> static PrintStream o = System.out;
>>
>>
>>}
>>
>>
>>
>>
>>>Thanks,
>>>
>>>Jon
>>>
>>>
>>>
>>>-----Original Message-----
>>>From: Otis Gospodnetic [mailto:otis_gospodnetic@yahoo.com]
>>>Sent: Monday, March 31, 2003 3:02 PM
>>>To: Lucene Users List
>>>Subject: Re: I need a list of the indexed words
>>>
>>>
>>>Please see the FAQ at jGuru, the answer is there.
>>>
>>>Otis
>>>
>>>--- jcrowell <jc...@dsg.harvard.edu> wrote:
>>>
>>>
>>>
>>>
>>>>I have a very simple problem: I need to get a list of the words
>>>>
>>>>
>>that
>>
>>
>>>>will result in a hit if searched on. Should be simple, but I'm not
>>>>
>>>>
>>>>quite sure
>>>>where to start.
>>>>
>>>>Thanks,
>>>>
>>>>Jon
>>>>
>>>>
>>>>
>>>>
>>>---------------------------------------------------------------------
>>>
>>>
>>>>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>>>>For additional commands, e-mail:
>>>>
>>>>
>>lucene-user-help@jakarta.apache.org
>>
>>
>>>>
>>>>
>>>>
>>>>
>>>__________________________________________________
>>>Do you Yahoo!?
>>>Yahoo! Platinum - Watch CBS' NCAA March Madness, live on your
>>>
>>>
>>desktop!
>>
>>
>>>http://platinum.yahoo.com
>>>
>>>
>>>
>>---------------------------------------------------------------------
>>
>>
>>>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>>>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>>>
>>>
>>>
>>>
>>---------------------------------------------------------------------
>>
>>
>>>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>>>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>>>
>>>
>>>
>>>
>>>
>>
>>
>
>
>__________________________________________________
>Do you Yahoo!?
>The New Yahoo! Search - Faster. Easier. Bingo
>http://search.yahoo.com
>
>---------------------------------------------------------------------
>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
>
>
Re: I need a list of the indexed words
Posted by Otis Gospodnetic <ot...@yahoo.com>.
That's a very handy class, David. Perhaps I should stick it in
lucene-sandbox somewhere.
It depends on your Rammer class, but for those interested in using
this, all you need to do is pass 'name' variable to IndexReader instead
of wrapping it in that Rammer call.
Thanks,
Otis
--- David Spencer <Da...@micromuse.com> wrote:
> jcrowell wrote:
>
> >Thanks for responding. Are you referring to the solution under the
> title:
> >
> >"How do I retrieve all the values of a particular field that exists
> within
> >an index, across all documents" ?
> >
> Here's some code that might do what you want.
> It's shows the frequency of each term also.
> Args are "-i INDEX" and optional "-f FIELD".
> I haven't tested it outside my tree (to see if it's clean of
> dependencies) but
> it looks reasonable at a glance.
>
>
>
>
>
> package com.tropo.lucene;
>
> import org.apache.lucene.analysis.*;
> import org.apache.lucene.index.*;
> import org.apache.lucene.document.*;
>
> import java.io.*;
> import java.util.*;
>
> /**
> * Call IndexReader.terms(), termPositions().
> */
> public class DumpTerms
> {
> private DumpTerms()
> {
> }
>
> /**
> *
> */
> public static void main(String[] args)
> throws Throwable
> {
> String name = "index";
> String field = null;
>
> for ( int i = 0; i< args.length; i++)
> {
> if ( args[i].equals( "-i"))
> name = args[ ++i];
> else if ( args[i].equals( "-f"))
> field = args[ ++i];
> /*
>
> else if ( args[i].equals( "-v"))
> v = args[ ++i];
> */
> }
> o.println( "Opening "+ name);
> final IndexReader r = IndexReader.open( Rammer.convertMaybe(
> name));
> final TermEnum te = r.terms();
> final Set s =new TreeSet();
> final List lis = new LinkedList();
> final int docs = r.numDocs();
> o.println( "Docs: " + docs);
> while ( te.next())
> {
> Term t = te.term();
> if ( field != null && ! field.equals( t.field()))
> continue;
> s.add( t.field());
> /*
> o.println( "field=" +t.field() +
> " text=" + t.text() +
> " freq="+ te.docFreq());
> */
> lis.add( new Object[] { t, new Integer( te.docFreq())});
> /*
> TermPositions tp = r.termPositions( t);
> while ( tp.next())
> {
> int f = tp.freq();
> o.println( "\t" + "doc=" + tp.doc() + " freq=" +f);
> for ( int i = 0; i < f; i++)
> o.println( "\t\tnextp=" + tp.nextPosition());
> }
> tp.close();
> */
> }
> o.println( "Terms: " + lis.size());
> Collections.sort( lis, new ICmp());
> Iterator it = lis.iterator();
> int[] lens = new int[ 30];
> while ( it.hasNext())
> {
> Object[] ar = (Object[]) it.next();
> Term t = (Term) ar[0];
> int freq = ((Integer)ar[1]).intValue();
> int len = t.text().length();
> if ( len >= lens.length)
> lens[ lens.length-1]++;
> else
> lens[ len]++;
> o.print( fill( t.text(), 16) + " " + fill( "" + freq,
> 6));
> int pc = (freq * 100); pc += (docs/2); pc /= docs;
> o.print( " " +pc + "%");
> if ( ! t.field().equals( "contents"))
> o.println( " " + t.field());
> else
> o.println();
> }
> o.println();
>
> int tot_terms = lis.size();
> for ( int i = 0; i< lens.length; i++)
> {
> int pc = lens[ i] * 100; pc += tot_terms/2; pc /=
> tot_terms;
> o.println( "" + i + ". " + lens[ i] + " " + pc + "%");
> }
>
> r.close();
> /*
> o.println();
> Iterator it = s.iterator();
> while ( it.hasNext())
> o.println( it.next());
> */
> }
> /**
> *
> */
> private static String fill( String s, int w)
> {
> int len = s.length();
> for ( int i = len; i < w; i++)
> s += " ";
> return s;
> }
>
> private static class ICmp
> implements Comparator
> {
> public int compare( Object a, Object b)
> {
> Object[] a1 = (Object[]) a;
> Object[] b1 = (Object[]) b;
> int d1 = ((Integer)a1[1]).intValue();
> int d2 = ((Integer)b1[1]).intValue();
> if ( d1 < d2) return 1;
> if ( d1 > d2) return -1;
> return 0;
> }
> }
>
>
> static PrintStream o = System.out;
>
>
> }
>
>
> >
> >Thanks,
> >
> >Jon
> >
> >
> >
> >-----Original Message-----
> >From: Otis Gospodnetic [mailto:otis_gospodnetic@yahoo.com]
> >Sent: Monday, March 31, 2003 3:02 PM
> >To: Lucene Users List
> >Subject: Re: I need a list of the indexed words
> >
> >
> >Please see the FAQ at jGuru, the answer is there.
> >
> >Otis
> >
> >--- jcrowell <jc...@dsg.harvard.edu> wrote:
> >
> >
> >>I have a very simple problem: I need to get a list of the words
> that
> >>will result in a hit if searched on. Should be simple, but I'm not
>
> >>quite sure
> >>where to start.
> >>
> >>Thanks,
> >>
> >>Jon
> >>
> >>
>
>>---------------------------------------------------------------------
> >>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
> >>For additional commands, e-mail:
> lucene-user-help@jakarta.apache.org
> >>
> >>
> >>
> >
> >
> >__________________________________________________
> >Do you Yahoo!?
> >Yahoo! Platinum - Watch CBS' NCAA March Madness, live on your
> desktop!
> >http://platinum.yahoo.com
> >
>
>---------------------------------------------------------------------
> >To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
> >For additional commands, e-mail: lucene-user-help@jakarta.apache.org
> >
> >
>
>---------------------------------------------------------------------
> >To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
> >For additional commands, e-mail: lucene-user-help@jakarta.apache.org
> >
> >
> >
>
>
__________________________________________________
Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo
http://search.yahoo.com
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
Re: I need a list of the indexed words
Posted by David Spencer <Da...@micromuse.com>.
jcrowell wrote:
>Thanks for responding. Are you referring to the solution under the title:
>
>"How do I retrieve all the values of a particular field that exists within
>an index, across all documents" ?
>
Here's some code that might do what you want.
It's shows the frequency of each term also.
Args are "-i INDEX" and optional "-f FIELD".
I haven't tested it outside my tree (to see if it's clean of
dependencies) but
it looks reasonable at a glance.
package com.tropo.lucene;
import org.apache.lucene.analysis.*;
import org.apache.lucene.index.*;
import org.apache.lucene.document.*;
import java.io.*;
import java.util.*;
/**
* Call IndexReader.terms(), termPositions().
*/
public class DumpTerms
{
private DumpTerms()
{
}
/**
*
*/
public static void main(String[] args)
throws Throwable
{
String name = "index";
String field = null;
for ( int i = 0; i< args.length; i++)
{
if ( args[i].equals( "-i"))
name = args[ ++i];
else if ( args[i].equals( "-f"))
field = args[ ++i];
/*
else if ( args[i].equals( "-v"))
v = args[ ++i];
*/
}
o.println( "Opening "+ name);
final IndexReader r = IndexReader.open( Rammer.convertMaybe( name));
final TermEnum te = r.terms();
final Set s =new TreeSet();
final List lis = new LinkedList();
final int docs = r.numDocs();
o.println( "Docs: " + docs);
while ( te.next())
{
Term t = te.term();
if ( field != null && ! field.equals( t.field())) continue;
s.add( t.field());
/*
o.println( "field=" +t.field() +
" text=" + t.text() +
" freq="+ te.docFreq());
*/
lis.add( new Object[] { t, new Integer( te.docFreq())});
/*
TermPositions tp = r.termPositions( t);
while ( tp.next())
{
int f = tp.freq();
o.println( "\t" + "doc=" + tp.doc() + " freq=" +f);
for ( int i = 0; i < f; i++)
o.println( "\t\tnextp=" + tp.nextPosition());
}
tp.close();
*/
}
o.println( "Terms: " + lis.size());
Collections.sort( lis, new ICmp());
Iterator it = lis.iterator();
int[] lens = new int[ 30];
while ( it.hasNext())
{
Object[] ar = (Object[]) it.next();
Term t = (Term) ar[0];
int freq = ((Integer)ar[1]).intValue();
int len = t.text().length();
if ( len >= lens.length)
lens[ lens.length-1]++;
else
lens[ len]++;
o.print( fill( t.text(), 16) + " " + fill( "" + freq, 6));
int pc = (freq * 100); pc += (docs/2); pc /= docs;
o.print( " " +pc + "%");
if ( ! t.field().equals( "contents"))
o.println( " " + t.field());
else
o.println();
}
o.println();
int tot_terms = lis.size();
for ( int i = 0; i< lens.length; i++)
{
int pc = lens[ i] * 100; pc += tot_terms/2; pc /= tot_terms;
o.println( "" + i + ". " + lens[ i] + " " + pc + "%");
}
r.close();
/*
o.println();
Iterator it = s.iterator();
while ( it.hasNext())
o.println( it.next());
*/
}
/**
*
*/
private static String fill( String s, int w)
{
int len = s.length();
for ( int i = len; i < w; i++)
s += " ";
return s;
}
private static class ICmp
implements Comparator
{
public int compare( Object a, Object b)
{
Object[] a1 = (Object[]) a;
Object[] b1 = (Object[]) b;
int d1 = ((Integer)a1[1]).intValue();
int d2 = ((Integer)b1[1]).intValue();
if ( d1 < d2) return 1;
if ( d1 > d2) return -1;
return 0;
}
}
static PrintStream o = System.out;
}
>
>Thanks,
>
>Jon
>
>
>
>-----Original Message-----
>From: Otis Gospodnetic [mailto:otis_gospodnetic@yahoo.com]
>Sent: Monday, March 31, 2003 3:02 PM
>To: Lucene Users List
>Subject: Re: I need a list of the indexed words
>
>
>Please see the FAQ at jGuru, the answer is there.
>
>Otis
>
>--- jcrowell <jc...@dsg.harvard.edu> wrote:
>
>
>>I have a very simple problem: I need to get a list of the words that
>>will result in a hit if searched on. Should be simple, but I'm not
>>quite sure
>>where to start.
>>
>>Thanks,
>>
>>Jon
>>
>>
>>---------------------------------------------------------------------
>>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>>
>>
>>
>
>
>__________________________________________________
>Do you Yahoo!?
>Yahoo! Platinum - Watch CBS' NCAA March Madness, live on your desktop!
>http://platinum.yahoo.com
>
>---------------------------------------------------------------------
>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
>
>---------------------------------------------------------------------
>To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
>For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
>
>
RE: I need a list of the indexed words
Posted by jcrowell <jc...@dsg.harvard.edu>.
Thanks for responding. Are you referring to the solution under the title:
"How do I retrieve all the values of a particular field that exists within
an index, across all documents" ?
Thanks,
Jon
-----Original Message-----
From: Otis Gospodnetic [mailto:otis_gospodnetic@yahoo.com]
Sent: Monday, March 31, 2003 3:02 PM
To: Lucene Users List
Subject: Re: I need a list of the indexed words
Please see the FAQ at jGuru, the answer is there.
Otis
--- jcrowell <jc...@dsg.harvard.edu> wrote:
> I have a very simple problem: I need to get a list of the words that
> will result in a hit if searched on. Should be simple, but I'm not
> quite sure
> where to start.
>
> Thanks,
>
> Jon
>
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
> For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
__________________________________________________
Do you Yahoo!?
Yahoo! Platinum - Watch CBS' NCAA March Madness, live on your desktop!
http://platinum.yahoo.com
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org
Re: I need a list of the indexed words
Posted by Otis Gospodnetic <ot...@yahoo.com>.
Please see the FAQ at jGuru, the answer is there.
Otis
--- jcrowell <jc...@dsg.harvard.edu> wrote:
> I have a very simple problem: I need to get a list of the words that
> will
> result in a hit if searched on. Should be simple, but I'm not quite
> sure
> where to start.
>
> Thanks,
>
> Jon
>
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
> For additional commands, e-mail: lucene-user-help@jakarta.apache.org
>
__________________________________________________
Do you Yahoo!?
Yahoo! Platinum - Watch CBS' NCAA March Madness, live on your desktop!
http://platinum.yahoo.com
---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-user-help@jakarta.apache.org