|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface NBestChunker
An NBestChunker is a chunker that is able to return
results iterating over scored chunkings or scored chunks in order
of decreasing likelihood.
For n-best chunkings, the method nBest(char[],int,int,int) returns the n-best chunkings as
an iterator. In list form, is often called an n-best list,
and represents the top n analyses. Scores are assumed to be
joint log probabilities of the chunking (i.e. the input string plus
chunks).
N-best chunkers may be used in an application directly, or the
n-best list may be rescored using the RescoringChunker.
| Method Summary | |
|---|---|
Iterator<ScoredObject<Chunking>> |
nBest(char[] cs,
int start,
int end,
int maxNBest)
Return the scored chunkings of the specified character sequence in order as an iterator in order of score. |
| Methods inherited from interface com.aliasi.chunk.Chunker |
|---|
chunk, chunk |
| Method Detail |
|---|
Iterator<ScoredObject<Chunking>> nBest(char[] cs,
int start,
int end,
int maxNBest)
cs - Underlying character array.start - Index of first character to analyze.end - Index of one past the last character to analyze.maxNBest - The maximum number of results to return.n
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||