|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
DictionaryMetadata.encoding.
DictionaryMetadata.separator.
DictionaryMetadata.usesInfixes.
DictionaryMetadata.usesPrefixes.
CFSA).Object.clone() that returns a deep copy of
this object.
FSA automaton and metadata describing the
internals of dictionary entries' coding (DictionaryMetadata.WordData entries of a Dictionary.DictionaryMetadata.
FSA
dictionary.FSA automaton with the compiled dictionary data.
byte-labeled automata to FSA5 format.bytes to label transitions.chars to label transitions.Set of CharSequences, backed by a deterministic
finite state automaton.FSATraversalHelper.FSAMatch.Iterator of all subsequences available from the given
node to all reachable final states.
node and labeled
with label.
node and labeled
with label.
node and labeled
with label.
arc.
arc.
arc.
arc.
arc.
arc.
node or 0 if
the node has no outgoing arcs.
node or 0 if
the node has no outgoing arcs.
node or 0 if
the node has no outgoing arcs.
arc and leaving
node.
arc and leaving
node.
arc and leaving
node.
label.
label.
true if this state has any children (outgoing
transitions).
true if this state has any children (outgoing
transitions).
true if there are still elements in this iterator.
FSAMorphCoder.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 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 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.
word,
followed by a separator.
WordData entries for a given word.
WordData entries for a given word.
FSATraversalHelper.matchSequence(byte[], int, int, int), but allows passing
a reusable FSAMatch object so that no intermediate garbage is
produced.
sequence and starting at node node.
NUMBERS option).
NUMBERS option).
FSAMorphCoder.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.
state.
s to an output stream.
FSAMorphCoder.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.
byte labels on transitions.char labels on transitions.States.States.FSA5.dot
language).
dot
language).
dot
language).
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||