Serialized Form
Package edu.stanford.nlp.international.arabic |
serialVersionUID: 1L
outputUnicodeValues
boolean outputUnicodeValues
- If true (include flag "-outputUnicodeValues"), outputs space separated
unicode values (e.g., "ء" rather than the character version of those values.
Only applicable for Buckwalter to Arabic conversion.
arabicChars
char[] arabicChars
buckChars
char[] buckChars
u2b
boolean u2b
a2b
java.util.HashMap<K,V> a2b
b2a
java.util.HashMap<K,V> b2a
unmappable
ClassicCounter<E> unmappable
serialVersionUID: 1L
b
Buckwalter b
Package edu.stanford.nlp.international.arabic.pipeline |
serialVersionUID: -197782849766133026L
parentTagsToEscape
java.util.Set<E> parentTagsToEscape
Package edu.stanford.nlp.io |
serialVersionUID: -8572218999165094626L
Package edu.stanford.nlp.io.ui |
serialVersionUID: -7987625449997527926L
jfc
javax.swing.JFileChooser jfc
status
int status
urlTextField
javax.swing.JTextField urlTextField
openButton
javax.swing.JButton openButton
jLabel1
javax.swing.JLabel jLabel1
jPanel3
javax.swing.JPanel jPanel3
jLabel2
javax.swing.JLabel jLabel2
jPanel2
javax.swing.JPanel jPanel2
cancelButton
javax.swing.JButton cancelButton
browseButton
javax.swing.JButton browseButton
jPanel1
javax.swing.JPanel jPanel1
Package edu.stanford.nlp.ling |
serialVersionUID: -24171720584352262L
title
java.lang.String title
- title of this document (never null).
originalText
java.lang.String originalText
- original text of this document (may be null).
labels
java.util.List<E> labels
- Label(s) for this document.
tokenizerFactory
TokenizerFactory<T> tokenizerFactory
- TokenizerFactory used to convert the text into words inside
BasicDocument.parse(String)
.
serialVersionUID: -745085381666943254L
word
java.lang.String word
tag
java.lang.String tag
serialVersionUID: 2L
serialVersionUID: 1L
serialVersionUID: -7252006452127051085L
tag
Label tag
serialVersionUID: 4659879214203680767L
serialVersionUID: -4153619273767524247L
str
java.lang.String str
beginPosition
int beginPosition
- Start position of the word in the original input string
endPosition
int endPosition
- End position of the word in the original input string
serialVersionUID: 1143434026005416755L
serialVersionUID: -7252006452127051085L
tag
java.lang.String tag
serialVersionUID: -1413303679077285530L
serialVersionUID: -4817252915997034058L
serialVersionUID: -5993410244163988138L
word
java.lang.String word
lemma
java.lang.String lemma
tag
java.lang.String tag
serialVersionUID: -1859527239216813742L
word
java.lang.String word
tag
java.lang.String tag
Package edu.stanford.nlp.movetrees |
serialVersionUID: 77798427030716852L
movedTree
Tree movedTree
emptyType
java.lang.Object emptyType
Package edu.stanford.nlp.objectbank |
serialVersionUID: 1L
oper
Function<T1,T2> oper
serialVersionUID: -4030295596701541770L
rif
ReaderIteratorFactory rif
ifrf
IteratorFromReaderFactory<T> ifrf
contents
java.util.List<E> contents
keepInMemory
boolean keepInMemory
Package edu.stanford.nlp.parser.lexparser |
serialVersionUID: 2L
readObject
private void readObject(java.io.ObjectInputStream ois)
throws java.io.IOException,
java.lang.ClassNotFoundException
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
tagProjection
TagProjection tagProjection
numTagBins
int numTagBins
tagBin
int[] tagBin
tlp
TreebankLanguagePack tlp
directional
boolean directional
useDistance
boolean useDistance
useCoarseDistance
boolean useCoarseDistance
lex
Lexicon lex
serialVersionUID: 4299501909017975915L
evalGF
boolean evalGF
- If true, then evaluation is over grammatical functions as well as the labels
If false, then grammatical functions are stripped for evaluation. This really
only makes sense if you've trained with grammatical functions but want to evaluate without them.
inputEncoding
java.lang.String inputEncoding
outputEncoding
java.lang.String outputEncoding
tlp
TreebankLanguagePack tlp
serialVersionUID: 1L
optionsString
java.lang.String optionsString
retainNPTmp
boolean retainNPTmp
retainNPSbj
boolean retainNPSbj
retainPRD
boolean retainPRD
retainPPClr
boolean retainPPClr
changeNoLabels
boolean changeNoLabels
collinizerRetainsPunctuation
boolean collinizerRetainsPunctuation
collinizerPruneRegex
java.util.regex.Pattern collinizerPruneRegex
discardX
boolean discardX
activeAnnotations
java.util.HashMap<K,V> activeAnnotations
annotationPatterns
java.util.Map<K,V> annotationPatterns
serialVersionUID: 4825624957364628771L
UNKNOWN_WORD
java.lang.String UNKNOWN_WORD
BOUNDARY_TAG
java.lang.String BOUNDARY_TAG
smartMutation
boolean smartMutation
unknownSuffixSize
int unknownSuffixSize
unknownPrefixSize
int unknownPrefixSize
serialVersionUID: 40L
uwModel
UnknownWordModel uwModel
smoothInUnknownsThreshold
int smoothInUnknownsThreshold
- If a word has been seen more than this many times, then relative
frequencies of tags are used for POS assignment; if not, they are smoothed
with tag priors.
smartMutation
boolean smartMutation
- Have tags changeable based on statistics on word types having various
taggings.
seenCounter
ClassicCounter<E> seenCounter
- Records the number of times word/tag pair was seen in training data.
Includes word/tag pairs where one is a wildcard not a real word/tag.
smooth
double[] smooth
flexiTag
boolean flexiTag
useSignatureForKnownSmoothing
boolean useSignatureForKnownSmoothing
tagsToBaseTags
int[] tagsToBaseTags
serialVersionUID: 6355171148751673822L
useFirst
boolean useFirst
useEnd
boolean useEnd
useGT
boolean useGT
useFirstCap
boolean useFirstCap
endLength
int endLength
unknownLevel
int unknownLevel
- What type of equivalence classing is done in getSignature
unSeenCounter
ClassicCounter<E> unSeenCounter
- Has counts for taggings in terms of unseen signatures. The IntTagWords are
for (tag,sig), (tag,null), (null,sig), (null,null). (None for basic UNK if
there are signatures.)
tagHash
java.util.HashMap<K,V> tagHash
- This maps from a tag (as a label) to a Counter from word signatures to
their P(sig|tag), as estimated in the model. For Chinese, the word
signature is just the first character or its unicode type for things
that aren't Chinese characters.
seenEnd
java.util.Set<E> seenEnd
- This is the set of all signatures that we have seen.
unknownGT
java.util.HashMap<K,V> unknownGT
lex
Lexicon lex
- All classes that implement UnknownWordModel must call the constructor that initializes this variable.
serialVersionUID: 1L
readObject
private void readObject(java.io.ObjectInputStream stream)
throws java.io.IOException,
java.lang.ClassNotFoundException
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
stateSpace
java.lang.String stateSpace
numStates
int numStates
allRules
java.util.List<E> allRules
serialVersionUID: 1L
leftChild
int leftChild
rightChild
int rightChild
hashCode
int hashCode
serialVersionUID: -5357655683145854069L
charDistributions
java.util.Map<K,V> charDistributions
knownChars
java.util.Set<E> knownChars
POSDistribution
Distribution<E> POSDistribution
serialVersionUID: -7836464391021114960L
probRandomWalk
edu.stanford.nlp.parser.lexparser.RandomWalk probRandomWalk
serialVersionUID: -6554995189795187918L
readObject
private void readObject(java.io.ObjectInputStream in)
throws java.io.IOException,
java.lang.ClassNotFoundException
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
chineseLexicon
ChineseLexicon chineseLexicon
wordSegmenter
WordSegmenter wordSegmenter
op
Options op
serialVersionUID: 1559606198270645508L
initialPOSDist
Distribution<E> initialPOSDist
markovPOSDists
java.util.Map<K,V> markovPOSDists
lex
ChineseCharacterBasedLexicon lex
POSes
java.util.Set<E> POSes
serialVersionUID: -1845503582705055342L
simSmooth
double simSmooth
simArgMap
java.util.Map<K,V> simArgMap
simHeadMap
java.util.Map<K,V> simHeadMap
debug
boolean debug
verbose
boolean verbose
statsCounter
ClassicCounter<E> statsCounter
serialVersionUID: 2L
ctlp
ChineseTreebankLanguagePack ctlp
- The variable ctlp stores the same thing as the tlp variable in
AbstractTreebankParserParams, but pre-cast to be a
ChineseTreebankLanguagePack.
charTags
boolean charTags
useCharacterBasedLexicon
boolean useCharacterBasedLexicon
useMaxentLexicon
boolean useMaxentLexicon
useMaxentDepGrammar
boolean useMaxentDepGrammar
segmentMarkov
boolean segmentMarkov
segmentMaxMatch
boolean segmentMaxMatch
sunJurafskyHeadFinder
boolean sunJurafskyHeadFinder
bikelHeadFinder
boolean bikelHeadFinder
discardFrags
boolean discardFrags
useSimilarWordMap
boolean useSimilarWordMap
lex
Lexicon lex
segmenter
WordSegmenter segmenter
depGramFeatureLevel
int depGramFeatureLevel
serialVersionUID: 221L
useUnicodeType
boolean useUnicodeType
seenFirst
java.util.Set<E> seenFirst
serialVersionUID: 4153878351331522581L
headFinder
HeadFinder headFinder
serialVersionUID: 4825624957364628770L
smartMutation
boolean smartMutation
unknownSuffixSize
int unknownSuffixSize
unknownPrefixSize
int unknownPrefixSize
serialVersionUID: 221L
serialVersionUID: 1L
head
IntTaggedWord head
arg
IntTaggedWord arg
leftHeaded
boolean leftHeaded
distance
short distance
serialVersionUID: 1L
word
int word
tag
short tag
serialVersionUID: 5135076134500512556L
constraints
java.util.List<E> constraints
edges
java.util.List<E> edges
nodes
java.util.Set<E> nodes
edgeStartsAt
java.util.Map<K,V> edgeStartsAt
maxNode
int maxNode
serialVersionUID: 4416189959485854286L
word
java.lang.String word
label
java.lang.String label
weight
double weight
start
int start
end
int end
attrs
java.util.Map<K,V> attrs
serialVersionUID: 1L
readObject
private void readObject(java.io.ObjectInputStream stream)
throws java.io.IOException,
java.lang.ClassNotFoundException
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
writeObject
private void writeObject(java.io.ObjectOutputStream stream)
throws java.io.IOException
- Throws:
java.io.IOException
numWordTokens
int numWordTokens
argCounter
ClassicCounter<E> argCounter
- Stores all the counts for dependencies (with and without the word
being a wildcard) in the reduced tag space.
stopCounter
ClassicCounter<E> stopCounter
smooth_aT_hTWd
double smooth_aT_hTWd
- Bayesian m-estimate prior for aT given hTWd against base distribution
of aT given hTd.
TODO: Note that these values are overwritten in the constructor. Find what is best and then maybe remove these defaults!
smooth_aTW_hTWd
double smooth_aTW_hTWd
- Bayesian m-estimate prior for aTW given hTWd against base distribution
of aTW given hTd.
smooth_stop
double smooth_stop
interp
double interp
- Interpolation between model that directly predicts aTW and model
that predicts aT and then aW given aT. This percent of the mass
is on the model directly predicting aTW.
smooth_aTW_aT
double smooth_aTW_aT
smooth_aTW_hTd
double smooth_aTW_hTd
smooth_aT_hTd
double smooth_aT_hTd
smooth_aPTW_aPT
double smooth_aPTW_aPT
smoothTP
TagProjection smoothTP
smoothTPNumberer
Numberer smoothTPNumberer
serialVersionUID: 2L
markRC
boolean markRC
markZuVP
boolean markZuVP
markLP
boolean markLP
markColon
boolean markColon
markKonjParent
boolean markKonjParent
markHDParent
boolean markHDParent
markContainsV
boolean markContainsV
nodeCleanup
int nodeCleanup
- Node cleanup is how node names are normalized. The known values are:
0 = do nothing;
1 = keep category and function;
2 = keep only category
treeNormalizerInsertNPinPP
boolean treeNormalizerInsertNPinPP
treeNormalizerLeaveGF
boolean treeNormalizerLeaveGF
treeReaderFactory
NegraPennTreeReaderFactory treeReaderFactory
serialVersionUID: 4L
numStates
int numStates
lexOptions
Options.LexOptions lexOptions
tlpParams
TreebankLangParserParams tlpParams
- The treebank-specific parser parameters to use.
forceCNF
boolean forceCNF
- Forces parsing with strictly CNF grammar -- unary chains are converted
to XP&YP symbols and back
doPCFG
boolean doPCFG
- Do a PCFG parse of the sentence. If both variables are on,
also do a combined parse of the sentence.
doDep
boolean doDep
- Do a dependency parse of the sentence.
freeDependencies
boolean freeDependencies
- if true, any child can be the head (seems rather bad!)
directional
boolean directional
- Whether dependency grammar considers left/right direction. Good.
genStop
boolean genStop
distance
boolean distance
- Use distance bins in the dependency calculations
coarseDistance
boolean coarseDistance
- Use coarser distance (4 bins) in dependency calculations
dcTags
boolean dcTags
- "double count" tags rewrites as word in PCFG and Dep parser. Good for
combined parsing only (it used to not kick in for PCFG parsing). This
option is only used at Test time, but it is now in Options, so the
correct choice for a grammar is recorded by a serialized parser.
You should turn this off for a vanilla PCFG parser.
nodePrune
boolean nodePrune
- If true, inside the factored parser, remove any node from the final
chosen tree which improves the PCFG score. This was added as the
dependency factor tends to encourage 'deep' trees.
serialVersionUID: 2805351374506855632L
useUnknownWordSignatures
int useUnknownWordSignatures
- Whether to use suffix and capitalization information for unknowns.
Within the BaseLexicon model options have the following meaning:
0 means a single unknown token. 1 uses suffix, and capitalization.
2 uses a variant (richer) form of signature. Good.
Use this one. Using the richer signatures in versions 3 or 4 seems
to have very marginal or no positive value.
3 uses a richer form of signature that mimics the NER word type
patterns. 4 is a variant of 2. 5 is another with more English
specific morphology (good for English unknowns!).
6-9 are options for Arabic. 9 codes some patterns for numbers and
derivational morophology, but also supports unknownPrefixSize and
unknownSuffixSize.
For German, 0 means a single unknown token, and non-zero means to use
capitalization of first letter and a suffix of length
unknownSuffixSize.
smoothInUnknownsThreshold
int smoothInUnknownsThreshold
- Words more common than this are tagged with MLE P(t|w). Default 100. The
smoothing is sufficiently slight that changing this has little effect.
But set this to 0 to be able to use the parser as a vanilla PCFG with
no smoothing (not as a practical parser but for exposition or debugging).
smartMutation
boolean smartMutation
- Smarter smoothing for rare words.
useUnicodeType
boolean useUnicodeType
- Make use of unicode code point types in smoothing.
unknownSuffixSize
int unknownSuffixSize
- For certain Lexicons, a certain number of word-final letters are
used to subclassify the unknown token. This gives the number of
letters.
unknownPrefixSize
int unknownPrefixSize
- For certain Lexicons, a certain number of word-initial letters are
used to subclassify the unknown token. This gives the number of
letters.
uwModel
java.lang.String uwModel
- Model for unknown words that the lexicon should use
flexiTag
boolean flexiTag
useSignatureForKnownSmoothing
boolean useSignatureForKnownSmoothing
- Whether to use signature rather than just being unknown as prior in
known word smoothing. Currently only works if turned on for English.
serialVersionUID: 1L
lex
Lexicon lex
bg
BinaryGrammar bg
ug
UnaryGrammar ug
dg
DependencyGrammar dg
numbs
java.util.Map<K,V> numbs
pt
Options pt
serialVersionUID: 5672415342334265614L
tagNumberer
Numberer tagNumberer
wordNumberer
Numberer wordNumberer
wordCounter
ClassicCounter<E> wordCounter
tagCounter
ClassicCounter<E> tagCounter
unseenTagCounter
ClassicCounter<E> unseenTagCounter
tagAndWordCounter
ClassicCounter<E> tagAndWordCounter
unseenTagAndSignatureCounter
ClassicCounter<E> unseenTagAndSignatureCounter
smoothInUnknownsThreshold
int smoothInUnknownsThreshold
smooth
double smooth
rulesWithWord
java.util.List<E>[] rulesWithWord
lastWord
int lastWord
lastSignature
int lastSignature
serialVersionUID: 2L
parent
int parent
score
float score
serialVersionUID: 4955237758572202093L
start
int start
end
int end
state
java.util.regex.Pattern state
serialVersionUID: 7303189408025355170L
hf
HeadFinder hf
nodeCleanup
int nodeCleanup
- How to clean up node labels: 0 = do nothing, 1 = keep category and
function, 2 = just category.
markKonjParent
boolean markKonjParent
markContainsV
boolean markContainsV
markZu
boolean markZu
markColons
boolean markColons
leftPhrasal
boolean leftPhrasal
markHDParent
boolean markHDParent
leaveGF
boolean leaveGF
serialVersionUID: 1L
readObject
private void readObject(java.io.ObjectInputStream stream)
throws java.io.IOException,
java.lang.ClassNotFoundException
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
numStates
int numStates
- The number of "states" (nonterms) in the grammar, used to index rules.
stateSpace
java.lang.String stateSpace
- The name of the Numberer state space for unary rules. Usually "states"
coreRules
java.util.Map<K,V> coreRules
- The basic list of UnaryRules. Really this is treated as a set
serialVersionUID: 1L
child
int child
Package edu.stanford.nlp.parser.ui |
serialVersionUID: 7179757799978939358L
parserPanel
ParserPanel parserPanel
untokEngItem
javax.swing.JCheckBoxMenuItem untokEngItem
tokChineseItem
javax.swing.JCheckBoxMenuItem tokChineseItem
untokChineseItem
javax.swing.JCheckBoxMenuItem untokChineseItem
jMenu2
javax.swing.JMenu jMenu2
loadParserItem
javax.swing.JMenuItem loadParserItem
loadDataItem
javax.swing.JMenuItem loadDataItem
jSeparator1
javax.swing.JSeparator jSeparator1
jMenu1
javax.swing.JMenu jMenu1
exitItem
javax.swing.JMenuItem exitItem
jMenuBar1
javax.swing.JMenuBar jMenuBar1
serialVersionUID: -2118491857333662471L
encoding
java.lang.String encoding
segmentWords
boolean segmentWords
jfc
javax.swing.JFileChooser jfc
pageDialog
OpenPageDialog pageDialog
normalStyle
javax.swing.text.SimpleAttributeSet normalStyle
highlightStyle
javax.swing.text.SimpleAttributeSet highlightStyle
startIndex
int startIndex
endIndex
int endIndex
treePanel
TreeJPanel treePanel
parser
LexicalizedParser parser
lpThread
edu.stanford.nlp.parser.ui.ParserPanel.LoadParserThread lpThread
parseThread
edu.stanford.nlp.parser.ui.ParserPanel.ParseThread parseThread
timer
javax.swing.Timer timer
count
int count
glassPane
java.awt.Component glassPane
scrollWhenDone
boolean scrollWhenDone
- Whether to scroll one sentence forward after parsing.
dataFileLabel
javax.swing.JLabel dataFileLabel
treeContainer
javax.swing.JPanel treeContainer
topPanel
javax.swing.JPanel topPanel
textScrollPane
javax.swing.JScrollPane textScrollPane
backButton
javax.swing.JButton backButton
statusLabel
javax.swing.JLabel statusLabel
loadFileButton
javax.swing.JButton loadFileButton
loadButtonPanel
javax.swing.JPanel loadButtonPanel
buttonsAndFilePanel
javax.swing.JPanel buttonsAndFilePanel
parseButton
javax.swing.JButton parseButton
parseNextButton
javax.swing.JButton parseNextButton
forwardButton
javax.swing.JButton forwardButton
parserFileLabel
javax.swing.JLabel parserFileLabel
clearButton
javax.swing.JButton clearButton
splitPane
javax.swing.JSplitPane splitPane
statusPanel
javax.swing.JPanel statusPanel
dataFilePanel
javax.swing.JPanel dataFilePanel
buttonPanel
javax.swing.JPanel buttonPanel
textPane
javax.swing.JTextPane textPane
progressBar
javax.swing.JProgressBar progressBar
parserFilePanel
javax.swing.JPanel parserFilePanel
loadParserButton
javax.swing.JButton loadParserButton
VERTICAL_ALIGN
int VERTICAL_ALIGN
HORIZONTAL_ALIGN
int HORIZONTAL_ALIGN
maxFontSize
int maxFontSize
minFontSize
int minFontSize
tree
Tree tree
Package edu.stanford.nlp.process |
Package edu.stanford.nlp.stats |
serialVersionUID: 4L
map
java.util.Map<K,V> map
mapFactory
MapFactory<K,V> mapFactory
totalCount
double totalCount
defaultValue
double defaultValue
serialVersionUID: 6707148234288637809L
numberOfKeys
int numberOfKeys
reservedMass
double reservedMass
counter
Counter<E> counter
serialVersionUID: 1L
map
java.util.Map<K,V> map
depth
int depth
total
double total
serialVersionUID: 4L
map
java.util.Map<K,V> map
mapFactory
MapFactory<K,V> mapFactory
totalCount
int totalCount
defaultValue
int defaultValue
serialVersionUID: 1L
map
java.util.Map<K,V> map
total
double total
outerMF
MapFactory<K,V> outerMF
innerMF
MapFactory<K,V> innerMF
defaultValue
double defaultValue
Package edu.stanford.nlp.trees |
serialVersionUID: -6540278059442931087L
tlp
TreebankLanguagePack tlp
nonTerminalInfo
java.util.HashMap<K,V> nonTerminalInfo
defaultRule
java.lang.String[] defaultRule
- Default direction if no rule is found for category.
Subclasses can turn it on if they like.
If they don't it is an error if no rule is defined for a category
(null is returned).
serialVersionUID: -6506749780512708352L
gfCharacter
char gfCharacter
- Default character for indicating that something is a grammatical fn; probably should be overridden by
lang specific ones
punctTagStringAcceptFilter
Filter<T> punctTagStringAcceptFilter
punctWordStringAcceptFilter
Filter<T> punctWordStringAcceptFilter
sFPunctTagStringAcceptFilter
Filter<T> sFPunctTagStringAcceptFilter
eIPunctTagStringAcceptFilter
Filter<T> eIPunctTagStringAcceptFilter
startSymbolAcceptFilter
Filter<T> startSymbolAcceptFilter
serialVersionUID: -1005188028979810143L
tlp
TreebankLanguagePack tlp
emptyFilter
Filter<T> emptyFilter
aOverAFilter
Filter<T> aOverAFilter
serialVersionUID: 1L
serialVersionUID: 8914098359495987617L
serialVersionUID: -8747319554557223437L
serialVersionUID: -7732189363171164852L
tagRejectFilter
Filter<T> tagRejectFilter
serialVersionUID: 1166489968248785287L
wordRejectFilter
Filter<T> wordRejectFilter
serialVersionUID: -1866362375001969402L
serialVersionUID: -2270472762938163327L
nodeCleanup
int nodeCleanup
- How to clean up node labels: 0 = do nothing, 1 = keep category and
function, 2 = just category.
root
java.lang.String root
tlp
TreebankLanguagePack tlp
serialVersionUID: 892618003417550128L
language
GrammaticalRelation.Language language
shortName
java.lang.String shortName
longName
java.lang.String longName
parent
GrammaticalRelation parent
children
java.util.List<E> children
sourcePattern
java.util.regex.Pattern sourcePattern
targetPatterns
java.util.List<E> targetPatterns
specific
java.lang.String specific
serialVersionUID: 2286294455343892678L
dependencies
java.util.Set<E> dependencies
typedDependencies
java.util.List<E> typedDependencies
allTypedDependencies
java.util.List<E> allTypedDependencies
serialVersionUID: 7626389793561604973L
label
Label label
- The string representing the word that is the yield of the parse tree.
score
double score
- The score for the leaf
serialVersionUID: -8992385140984593817L
label
Label label
- Label of the parse tree.
score
double score
- Score of
TreeNode
daughterTrees
Tree[] daughterTrees
- Daughters of the parse tree.
serialVersionUID: 8453889846239508208L
serialVersionUID: -5870387458902637256L
serialVersionUID: 5L
regent
Label regent
dependent
Label dependent
name
java.lang.Object name
serialVersionUID: 7548777133196579107L
temporalAnnotation
int temporalAnnotation
doSGappedStuff
boolean doSGappedStuff
leaveItAll
int leaveItAll
doAdverbialNP
boolean doAdverbialNP
headFinder
HeadFinder headFinder
serialVersionUID: 326L
tns
java.util.List<E> tns
serialVersionUID: 9081305982861675328L
serialVersionUID: 5721799188009249808L
verbalAuxiliaries
java.util.HashSet<E> verbalAuxiliaries
copulars
java.util.HashSet<E> copulars
passiveAuxiliaries
java.util.HashSet<E> passiveAuxiliaries
verbalTags
java.util.HashSet<E> verbalTags
serialVersionUID: -8075763706877132926L
daughterTrees
Tree[] daughterTrees
- Daughters of the parse tree.
serialVersionUID: 5441849457648722744L
score
double score
serialVersionUID: 1L
root
TreeGraphNode root
- The root node of this treegraph.
indexMap
java.util.Map<K,V> indexMap
- A map from arbitrary integer indices to nodes.
serialVersionUID: 5080098143617475328L
label
CyclicCoreLabel label
- Label for this node.
parent
TreeGraphNode parent
- Parent of this node.
children
TreeGraphNode[] children
- Children of this node.
tg
TreeGraph tg
- The
TreeGraph
of which this
node is part.
serialVersionUID: 1540681875853883387L
serialVersionUID: -7690294213151279779L
reln
GrammaticalRelation reln
gov
TreeGraphNode gov
dep
TreeGraphNode dep
extra
boolean extra
serialVersionUID: 5L
regent
Label regent
dependent
Label dependent
Package edu.stanford.nlp.trees.international.arabic |
serialVersionUID: 6203368998430280740L
tagSet
ArabicHeadFinder.TagSet tagSet
predPattern
java.util.regex.Pattern predPattern
serialVersionUID: 6759533831515214642L
eolIsSignificant
boolean eolIsSignificant
serialVersionUID: 9081305982861675328L
detPlusNounIsBasicCategory
boolean detPlusNounIsBasicCategory
serialVersionUID: -1592231121068698494L
retainNPTmp
boolean retainNPTmp
retainNPSbj
boolean retainNPSbj
markPRDverb
boolean markPRDverb
changeNoLabels
boolean changeNoLabels
retainPPClr
boolean retainPPClr
lexMapper
DefaultLexicalMapper lexMapper
prdPattern
java.util.regex.Pattern prdPattern
prdVerbPattern
TregexPattern prdVerbPattern
npSbjPattern
TregexPattern npSbjPattern
rootLabel
java.lang.String rootLabel
serialVersionUID: 7417844982953945964L
serialVersionUID: 1973767605277873017L
retainNPTmp
boolean retainNPTmp
retainNPSbj
boolean retainNPSbj
retainPRD
boolean retainPRD
retainPPClr
boolean retainPPClr
changeNoLabels
boolean changeNoLabels
filterX
boolean filterX
noNormalization
boolean noNormalization
serialVersionUID: -5693371540982097793L
serialVersionUID: -2028631608727725548L
Package edu.stanford.nlp.trees.international.negra |
serialVersionUID: 2847331882765391095L
edge
java.lang.String edge
features
java.util.Map<K,V> features
serialVersionUID: 9081305982861675328L
leaveGF
boolean leaveGF
limitedGF
boolean limitedGF
serialVersionUID: 8529514903815041064L
nodeCleanup
int nodeCleanup
- How to clean up node labels: 0 = do nothing, 1 = keep category and
function, 2 = just category
root
java.lang.String root
tlp
TreebankLanguagePack tlp
leaveGF
boolean leaveGF
insertNPinPP
boolean insertNPinPP
prepositionTags
java.util.List<E> prepositionTags
postpositionTags
java.util.List<E> postpositionTags
serialVersionUID: 1L
nodeCleanup
int nodeCleanup
tlp
TreebankLanguagePack tlp
treeNormalizerInsertNPinPP
boolean treeNormalizerInsertNPinPP
serialVersionUID: 4307594629124896496L
coordSwitch
boolean coordSwitch
left
java.lang.String left
right
java.lang.String right
Package edu.stanford.nlp.trees.international.pennchinese |
serialVersionUID: -5445795668059315082L
serialVersionUID: 7893996593626523700L
serialVersionUID: 7655332268578049993L
map
java.util.Map<K,V> map
normalized
boolean normalized
serialVersionUID: 8877651855167458256L
serialVersionUID: 6143632784691159283L
serialVersionUID: 2L
serialVersionUID: 5757403475523638802L
serialVersionUID: -8203853817025401845L
tagExtender
TreeTransformer tagExtender
splitNPTMP
boolean splitNPTMP
splitPPTMP
boolean splitPPTMP
splitXPTMP
boolean splitXPTMP
chineseEmptyFilter
Filter<T> chineseEmptyFilter
serialVersionUID: -7942375587642755210L
Package edu.stanford.nlp.trees.international.tuebadz |
serialVersionUID: 1L
left
java.lang.String left
right
java.lang.String right
coordSwitch
boolean coordSwitch
headMarkedPattern
java.util.regex.Pattern headMarkedPattern
headMarkedPattern2
java.util.regex.Pattern headMarkedPattern2
serialVersionUID: 2697418320262700673L
limitedGF
boolean limitedGF
leaveGF
boolean leaveGF
serialVersionUID: 8009544230321390490L
nodeCleanup
int nodeCleanup
- How to clean up node labels: 0 = do nothing, 1 = keep category and
function, 2 = just category.
root
java.lang.String root
tlp
TreebankLanguagePack tlp
tns
java.util.List<E> tns
serialVersionUID: 1614799885744961795L
tlp
TreebankLanguagePack tlp
nodeCleanup
int nodeCleanup
Package edu.stanford.nlp.trees.tregex |
specialConstructor
boolean specialConstructor
- This variable determines which constructor was used to create
this object and thereby affects the semantics of the
"getMessage" method (see below).
currentToken
Token currentToken
- This is the last token that has been consumed successfully. If
this object has been created due to a parse error, the token
followng this token will (therefore) be the first error token.
expectedTokenSequences
int[][] expectedTokenSequences
- Each entry in this array is an array of integers. Each array
of integers represents a sequence of tokens (by their ordinal
values) that is expected at this point of the parse.
tokenImage
java.lang.String[] tokenImage
- This is a reference to the "tokenImage" array of the generated
parser within which the parse error occurred. This array is
defined in the generated ...Constants interface.
eol
java.lang.String eol
- The end of line string for this machine.
errorCode
int errorCode
- Indicates the reason why the exception is thrown. It will have
one of the above 4 values.
serialVersionUID: 5060298043763944913L
neg
boolean neg
opt
boolean opt
patternString
java.lang.String patternString
Package edu.stanford.nlp.trees.tregex.tsurgeon |
specialConstructor
boolean specialConstructor
- This variable determines which constructor was used to create
this object and thereby affects the semantics of the
"getMessage" method (see below).
currentToken
Token currentToken
- This is the last token that has been consumed successfully. If
this object has been created due to a parse error, the token
followng this token will (therefore) be the first error token.
expectedTokenSequences
int[][] expectedTokenSequences
- Each entry in this array is an array of integers. Each array
of integers represents a sequence of tokens (by their ordinal
values) that is expected at this point of the parse.
tokenImage
java.lang.String[] tokenImage
- This is a reference to the "tokenImage" array of the generated
parser within which the parse error occurred. This array is
defined in the generated ...Constants interface.
eol
java.lang.String eol
- The end of line string for this machine.
errorCode
int errorCode
- Indicates the reason why the exception is thrown. It will have
one of the above 4 values.
Package edu.stanford.nlp.util |
serialVersionUID: 1L
writeObject
private void writeObject(java.io.ObjectOutputStream out)
throws java.io.IOException
- Overriden serialization method: compacts our map before writing.
- Throws:
java.io.IOException
- If IO error
keys
java.lang.Class<T>[] keys
- Array of keys
values
java.lang.Object[] values
- Array of values
size
int size
- Total number of elements actually in keys,values
serialVersionUID: 3711321773145894069L
serialVersionUID: 1L
serialVersionUID: -6268401669449458602L
serialVersionUID: -4236184979948498000L
serialVersionUID: -9064664153962599076L
map
java.util.Map<K,V> map
cf
CollectionFactory<T> cf
treatCollectionsAsImmutable
boolean treatCollectionsAsImmutable
mf
MapFactory<K,V> mf
emptySet
java.util.Set<E> emptySet
serialVersionUID: 1L
originalMap
CollectionValuedMap<K,V> originalMap
deltaMap
java.util.Map<K,V> deltaMap
serialVersionUID: 1L
size
int size
capacity
int capacity
elements
java.util.List<E> elements
priorities
double[] priorities
serialVersionUID: 1L
immutableKeys
java.util.Set<E> immutableKeys
- Set of immutable keys
hashcode
int hashcode
- Pre-computed hashcode
serialVersionUID: 1L
serialVersionUID: 5398562825928375260L
objects
java.util.ArrayList<E> objects
indexes
java.util.HashMap<K,V> indexes
locked
boolean locked
semaphore
java.util.concurrent.Semaphore semaphore
serialVersionUID: -5024744406713321676L
readObject
private void readObject(java.io.ObjectInputStream s)
throws java.io.IOException,
java.lang.ClassNotFoundException
- Deserialize this Object in a manner which is binary-compatible with
the JDK.
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
writeObject
private void writeObject(java.io.ObjectOutputStream s)
throws java.io.IOException
- Serialize this Object in a manner which is binary-compatible with the
JDK.
- Throws:
java.io.IOException
serialVersionUID: 1L
serialVersionUID: 7154973101012473479L
serialVersionUID: -3744404627253652799L
serialVersionUID: 7266305463893511982L
elements
int[] elements
serialVersionUID: -7182556672628741200L
serialVersionUID: 4529666940763477360L
serialVersionUID: 624465615824626762L
d
double d
serialVersionUID: 624465615824626762L
i
int i
serialVersionUID: 1L
total
int total
intToObject
java.util.Map<K,V> intToObject
objectToInt
java.util.Map<K,V> objectToInt
tempInt
MutableInteger tempInt
locked
boolean locked
serialVersionUID: 1360822168806852921L
first
java.lang.Object first
- Direct access is deprecated. Use first().
-
second
java.lang.Object second
- Direct access is deprecated. Use second().
-
hashCode
int hashCode
serialVersionUID: 1L
ascending
boolean ascending
serialVersionUID: -4182871682751645440L
first
java.lang.Object first
second
java.lang.Object second
third
java.lang.Object third
Stanford NLP Group