Package org.apache.lucene.analysis.morph

package org.apache.lucene.analysis.morph

Abstract classes for morphological analyzers.

Class	Description
BinaryDictionary<T extends MorphData>	Abstract dictionary base class.
BinaryDictionaryWriter<T extends BinaryDictionary<? extends MorphData>>	Abstract base dictionary writer class.
CharacterDefinition	Character category data.
CharacterDefinition.LookupCharacterClass	Functional interface to lookup character class
CharacterDefinitionWriter<T extends CharacterDefinition>	Writes character definition file
ConnectionCosts	n-gram connection cost data
ConnectionCostsWriter<T extends ConnectionCosts>	Writes connection costs
Dictionary<T extends MorphData>	High-level dictionary interface for morphological analyzers.
DictionaryEntryWriter	Abstract writer class to write dictionary entries.
GraphvizFormatter<T extends MorphData>	Outputs the dot (graphviz) string for the viterbi lattice.
GraphvizFormatter.DictionaryProvider<T extends MorphData>	Dictionary provider
MorphData	High-level interface that represents morphological information in a dictionary
Token	Analyzed token with morphological data.
TokenInfoFST	Thin wrapper around an FST with root-arc caching.
TokenType	Token type reflecting the original source of this token
Viterbi<T extends Token,U extends Viterbi.Position>	Performs Viterbi algorithm for morphological Tokenizers, which split texts by Hidden Markov Model or Conditional Random Fields.
Viterbi.Position	Holds all back pointers arriving to this position.
Viterbi.WrappedPositionArray<U extends Viterbi.Position>	Holds partial graph (array of positions) for calculating the minimum cost path
ViterbiNBest<T extends Token,U extends MorphData>	Viterbi subclass for n-best path calculation.
ViterbiNBest.Lattice<U extends MorphData>	Yet another lattice data structure for keeping n-best path.
ViterbiNBest.PositionNBest	Viterbi.Position extension; this holds all forward pointers to calculate n-best path.