> Preface: I dont know how automaton is implemented deeply inside lucene ,
Well, you can take a look, it's open source. :) There are two
different finite state automata inside Lucene: one is pretty much a
"read-only" transducer from unique input seqences (of bytes) into an
output. This is the FST
*to @Uwe Schindler *
thanks , it is very interesting :)
*to @Dawid*
Preface: I dont know how automaton is implemented deeply inside lucene ,
but (considering automaton is built on the fly when index is already
present) i imagine that the automaton is scanning the lexicons/tokens
present in th
> Hi , it is possible to create a Automaton in lucene parsing not a string
> but a byte array?
Can you state what problem are you trying to solve? This seems to be a
question stripped of a more general context -- why do you need those
byte-based automata?
Dawid
--
Hi,
You can create your own parser and create the Automaton out of it. There are
many APIs to add different types of accept states/ You can then execute it
using AutomatonQuery. E.g., the Regex or Wildcard parsers are creating
automatons programmatically, first parsing the string and then c
Hi,
No, you must lookup the fields first and create separate TermQuery for all of
them. It may be helpful to use LeafReader methods to discover field names.
Uwe
-
Uwe Schindler
Achterdiek 19, D-28357 Bremen
http://www.thetaphi.de
eMail: u...@thetaphi.de
> -Original Message-
> From:
Hi
It there a way for searching all the documents where the field name starts
with "ABC" and value is Y?
