#include <lexemgraph.h>
Collaboration diagram for GraphemNodeStruct:
The field no is an index into the field graphemnodes of the enclosing lexeme graph.
The field lexemgraph points to this graph.
The field arcpoints to the corresponding Arc.
The field lexicalEntries contains a List of all known lexical entries with the same phonetic form as the word on the Arc.
The field lexemes contains all lexeme nodes built from the elements of lexicalEntries.
The field ambiguity counts how many of these lexeme nodes are currently undeleted.
Definition at line 113 of file lexemgraph.h.
Data Fields | |
Arc | arc |
Chunk | chunk |
List | lexemes |
LexemGraph | lexemgraph |
Boolean | live |
int | no |
|
arc in word lattice Definition at line 116 of file lexemgraph.h. Referenced by cmpChunks(), cmpGraphemes(), cnBuildLevelValues(), cnBuildTriple(), cnGetGraphemNodeFromArc(), cnOptimizeNode(), cnPrintEdge(), cnPrintNode(), compareChunks(), computeNoOfPathsFromStart(), computeNoOfPathsToEnd(), embedChunk(), evalChunker(), evalTerm(), findChunk(), findGrapheme(), getChunks(), getFakeChunksAt(), gnClone(), lgComputeDistances(), lgComputeNoOfPaths(), lgContains(), lgIsEndNode(), lgIsStartNode(), lgNewIter(), mergeChunk(), postProcessChunks(), and printChunk(). |
|
to which chunk do we belong Definition at line 119 of file lexemgraph.h. Referenced by chunkerChunk(), evalTerm(), gnClone(), lgCopyTagScores(), and lgNewIter(). |
|
list of disambiguated lexeme nodes Definition at line 117 of file lexemgraph.h. Referenced by cnBuildIter(), cnBuildNodes(), cnBuildUpdateArcs(), cnOptimizeNode(), cnPrint(), cnPrintNode(), getCategories(), gnClone(), lgAreDeletableNodes(), lgComputeDistances(), lgComputeNoOfPaths(), lgDelete(), lgMayModify(), lgMostProbablePath(), lgNewIter(), lgPartitions(), and lgQueryCat(). |
|
pointer back to the lexem graph Definition at line 115 of file lexemgraph.h. Referenced by getCategories(), gnClone(), lgIsEndNode(), lgIsStartNode(), and lgNewIter(). |
|
are there any lexemes left undeleted? Definition at line 118 of file lexemgraph.h. Referenced by computeNoOfPathsFromStart(), computeNoOfPathsToEnd(), and lgComputeNoOfPaths(). |
|
index in lg->graphemnodes Definition at line 114 of file lexemgraph.h. Referenced by cnOptimizeNode(), computeNoOfPathsFromStart(), computeNoOfPathsToEnd(), gnClone(), lgAreDeletableNodes(), lgClone(), lgComputeNoOfPaths(), lgDistanceOfNodes(), and lgNewIter(). |