|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
DictionaryMetadata.encoding.
DictionaryMetadata.separator.
DictionaryMetadata.usesInfixes.
DictionaryMetadata.usesPrefixes.
CFSA2.BIT_TARGET_NEXT applicable on all arcs, not necessarily the last one.FSA graphs to CFSA2.Object.clone() that returns a deep copy of
this object.
FSABuilder.FSA automaton and metadata describing the
internals of dictionary entries' coding (DictionaryMetadata.WordData entries of a Dictionary.DictionaryMetadata.
FSA automaton with the compiled dictionary data.
FSA graphs to a binary format compatible with
Jan Daciuk's fsa's package FSA5 format.ConstantArcSizeFSA (a tradeoff between construction
speed and memory consumption).FSABuildTool.Formats.FSA
dictionary.arc.
arc.
arc.
arc.
arc.
arc.
arc.
arc.
FSA.iterator() directly (FSA is also
Iterable).
true if there are still elements in this iterator.
MatchResult.kind.
MorphEncoder.infixEncode(byte[], byte[], byte[]).
true if the destination node at the end of this
arc corresponds to an input sequence created when building
this automaton.
true if the destination node at the end of this
arc corresponds to an input sequence created when building
this automaton.
true if the destination node at the end of this
arc corresponds to an input sequence created when building
this automaton.
true if the destination node at the end of this
arc corresponds to an input sequence created when building
this automaton.
true if this arc has NEXT bit set.
true if this arc has NEXT bit set.
true if this arc has LAST bit set.
true if this arc does not have a
terminating node (@link FSA.getEndNode(int) will throw an
exception).
true if this arc does not have a
terminating node (@link FSA.getEndNode(int) will throw an
exception).
true if this arc does not have a
terminating node (@link FSA.getEndNode(int) will throw an
exception).
true if this arc does not have a
terminating node (@link FSA.getEndNode(int) will throw an
exception).
true if the label is compressed inside flags byte.
true if the corresponding flag is set in the bit set.
WordData entries available in the
embedded Dictionary.
FSABuilder.compare(byte[], int, int, byte[], int, int).
word,
followed by a separator.
WordData entries for a given word.
WordData entries for a given word.
FSATraversal.match(byte[], int, int, int), but allows passing
a reusable MatchResult object so that no intermediate garbage is
produced.
sequence and starting at node node.
FSATraversal.MatchResult.kind.
NUMBERS option).
NUMBERS option).
MorphEncoder.prefixEncode(byte[], byte[], byte[]) This
method converts wordform, wordLemma and the tag to the form:
inflected_form + LKending + tags
where '+' is a separator, L is the number of characters to be deleted
from the beginning of the word ("A" means none, "B" means one, "C" - 2,
etc.), K is a character that specifies how many characters should be
deleted from the end of the inflected form to produce the lexeme by
concatenating the stripped string with the ending ("A" means none,
"B' - 1, "C" - 2, and so on).
array If there are not enough
bytes, throw an exception.
node.
state.
FSA to CFSA2 stream.
s to an output stream in
FSA5 format.
MorphEncoder.standardEncode(byte[], byte[], byte[]) This
method converts the wordForm, wordLemma and tag to the form:
wordForm + Kending + tags
where '+' is a separator, K is a character that specifies how many
characters should be deleted from the end of the inflected form to
produce the lexeme by concatenating the stripped string with the ending.
dot
language).
dot
language), to the given writer.
FSA.visitInPostOrder(StateVisitor, int),
starting from root automaton node.
node in postorder.
FSA.visitInPreOrder(StateVisitor, int), starting from root automaton node.
System.err.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||