| Modifier and Type | Field and Description |
|---|---|
int |
cost
The cost of the best path through this
Node, comprising
this.prev, this Node, and
this.next. |
short |
dictionaryCost |
short |
lcAttr
Used in Viterbi path cost calculation
|
int |
length
The number of characters this
Node covers |
Node |
lnext
The next
Node returned for the same ending position
within the sentence by the Dictionary |
Morpheme |
morpheme
The
Morpheme that is contained within this Node |
Node |
next
The next node on the best path through the
Node lattice |
Node |
prev
The previous node on the best path through the
Node lattice |
short |
rcAttr1
Used in Viterbi path cost calculation
|
short |
rcAttr2
Used in Viterbi path cost calculation
|
Node |
rnext
The next
Node returned for the same starting position
within the sentence by the Dictionary |
int |
span
The number of characters between the end of the previous
Node
and the end of this one, including any ignored characters that do not
form part of the Morpheme |
int |
start
The index of the first character of this
Node within the
surface |
| Constructor and Description |
|---|
Node() |
public short rcAttr2
public short rcAttr1
public short lcAttr
public short dictionaryCost
public Node prev
Node latticepublic Node next
Node latticepublic Node lnext
Node returned for the same ending position
within the sentence by the Dictionarypublic Node rnext
Node returned for the same starting position
within the sentence by the Dictionarypublic Morpheme morpheme
Morpheme that is contained within this Nodepublic int start
Node within the
surfacepublic int length
Node coverspublic int span
Node
and the end of this one, including any ignored characters that do not
form part of the Morphemepublic int cost
Node, comprising
this.prev, this Node, and
this.next. Lower cost is more likely, higher cost less
likely