|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
Counter.remove() defined to throw an
UnsupportedOperationException.LinearClassifier.TreebankLangParserParams implementing class.ADMath was created to extend the
current calculations of gradient to automatically include a calculation of the
hessian vector product with another vector v.Alignment objects for acronym alignment.height nodes up from the current node.
StreamTokenizer.destNode,
and returns the Set of Objects which
label those arcs.
destNode,
or null if no such arc exists.
StringUtils.argsToMap(java.lang.String[]).
CoreMap backed by Java Arrays.TreeVisitor for raw ATB trees.labelAnnotationIntroducingCharacters().
child can be converted to another encoding.
CategoryWordTag object acts as a complex Label
which contains a category, a head word, and a tag.CategoryWordTagFactory is a factory that makes
a Label which is a CategoryWordTag triplet.t1 and t2 which are
dominated by this node, returns true iff
t1 c-commands t2.
false to get per-iteration progress reports
(to stderr).
Comparator which is the result of chaining the
given Comparators.
Comparator which is the result of chaining the
given Comparators.
properties
are known to the program by checking that each simply overrides
a default value
ChineseGrammaticalRelations is a
set of GrammaticalRelation objects for the Chinese language.GrammaticalStructure from an
existing parse tree.
List of something that extendsCoreMap.
outputEncoding is defined, the output is written in that
character encoding, otherwise in the system default character encoding.
flags.inferenceType.
String to classified character offset
spans.
String to one of several String
representations that shows the classes.
List of something that extends CoreMap using as
additional information whatever is stored in the document and sentence.
String.
Treebank.
Treebank.
Treebank.
Treebank.
IdentityHashSet instance:
the elements themselves are not cloned.
TreeReader.
Reader used to create this
class.
TreeReader.
Collection<TypedDependency>
by collapsing several types of transitive pairs of dependencies.
Collection<TypedDependency> to collapse
language-dependent transitive dependencies.
Collection<TypedDependency>
by collapsing several types of transitive pairs of dependencies, but
keeping the tree structure.
Collection<TypedDependency> to collapse
language-dependent transitive dependencies but keeping a tree structure.
Collections.CollocationFinder over the Tree t.
CollocationFinder over the Tree t.
CollocationFinder over the Tree t.
value()'s lexicographic ordering.
MutableDouble objects numerically.
MutableInteger objects numerically.
Pair to another object.
PascalTemplate using the fields it contains which are relevant to the score.
List argument.
Constituent object defines a generic edge in a graph.ConstituentFactory is a factory for creating objects
of class Constituent, or some descendent class.ClassicCounter, this currently returns true if the count is
explicitly 0.0 for something
CoreMap,
parameterized by the type of the value associated with the annotation.CoreMaps.CoreLabels from Strings optionally with
beginning and ending (character after the end) offset positions in
an original text.TypedDependencyGraph to correct
language-dependent dependencies.
Counters.this as a ClassicCounter.
ClassifierFactory that incrementally
builds a more memory-efficient representation of a List of
Datum objects for the purposes of training a Classifier
with a ClassifierFactory.PascalTemplate.GrammaticalStructure.
DependencyTyper.
DiskTreebank is a Collection of
Trees.Counters.SequenceClassifiers.this dominates the Tree passed in
as an argument.
this and the dominated node itself.
DoubleAD was created to extend the
current calculations of gradient to automatically include a calculation of the
hessian vector product with another vector v.FileReader
but allows for the specification of input encoding.System.err (without stopping timer).
EnglishGrammaticalRelations is a
set of GrammaticalRelation objects for the English language.GrammaticalStructure from an existing parse
tree.
GrammaticalStructure from an existing parse
tree.
ValueLabels is defined in the first instance
as equality of their String value().
TreeGraphNodes.
Objects
to their equivalence classes.Tree and a TregexMatcher
that has been successfully matched against the tree.
TreeFactory that produces trees of the
LabeledScoredTree{Node|Leaf} type.
TreeFactory that produces trees of the
LabeledScoredTree{Node|Leaf} type, with
the Label made with the supplied
LabelFactory.
TreeFactory that produces trees of the
SimpleTree type.
TreeFactory that produces trees of type
TreeGraphNode.
TreeFactory that produces trees of type
TreeGraphNode, with the Label made
by the supplied LabelFactory.
FilePathProcessor traverses a directory structure and
applies the processFile method to files meeting some
criterion.accept method.FilteringTreeReader filters the output of another TreeReader.node is
the root of the match.
null if none.
TreeGraphNode to which there
exists an arc bearing the specified label from this node, or
null if no such node exists.
Set of TreeGraphNodes to
which there exist arcs bearing the specified label from this
node, or null if no such nodes exist.
Dataset and RVFDataset.Lists of a
prespecified length.Function object that maps Strings to Strings according
to this TreebankLanguagePack's basicCategory() method.
Function object that maps Strings to Strings according
to this TreebankLanguagePack's basicCategory method.
parse was
called, or null if none exists.
Function object that maps Strings to Strings according
to this TreebankLanguagePack's categoryAndFunction() method.
Function object that maps Strings to Strings according
to this TreebankLanguagePack's categoryAndFunction method.
Collection of the features
calculated for the word at the specified position in info (the list of
words) for the specified Clique.
GeneralizedCounter.getCounts(java.util.List) ({o})GeneralizedCounter.getCounts(java.util.List) ({o1,o2})GeneralizedCounter.getCounts(java.util.List) ({o1,o2,o3})double[] array of length
depth+1, containing the conditional counts on a
depth-length list given each level of conditional
distribution from 0 to depth.
Set of leaf (terminal) nodes
which are the DEPENDENTt.
Dataset.build().
GOVERNORt.
AbstractEval.evaluate(edu.stanford.nlp.trees.Tree, edu.stanford.nlp.trees.Tree).
name in the pattern.
ith node in the tree, with node numbers defined
as in Tree.nodeNumber(Tree).
Distribution instead of using this method.
GrammaticalRelation.
nth preterminal in tree.
Tree node t, attempts to
return a list of nodes to which node t has this
grammatical relation.
SUBJECT (whether
nominal or clausal) of the given node t.
nth terminal in tree.
PTBTokenizer.
GrammaticalRelation is used to define a
standardized, hierarchical set of grammatical relations,
together with patterns for identifying them in
parse trees.GrammaticalStructure is a TreeGraphGrammaticalStructure objects.HasCategory interface
knows about categories.ArrayCoreMap with an immutable set of key,value
pairs that is used for equality and hashcode comparisons.HasLemma interface
knows about lemmas.true if this Tokenizer has more elements.
true if and only if this Tokenizer has more elements.
HasOffset interface
bears a offset reference to the original textHasTag interface
knows about part-of-speech tags.HasWord interface
knows about words.head (transitively) heads node.
null if none), as recorded in this node's CyclicCoreLabelnull if none), as recorded in this node's CyclicCoreLabelscorer.
headWordNode as this node.
IdentityHashMap-backed
implementation of the Set interface.GeneralizedCounter.depth()-dimensional key l.
GeneralizedCounter.incrementCount(java.util.List, K) ({o}, count)Tree, starting with 1.
TreeGraphNode.
PascalTemplate.dtr after position existing
daughters in this.
Set such that each element in the returned set
is a unique object e' that .equals the corresponding element e in the
original set.
Set such that each element in the returned set
is a unique object e' that .equals the corresponding element e in the
original set.
true iff the value of Tree
node t matches the sourcePattern for
this GrammaticalRelation, indicating that this
GrammaticalRelation is one that could hold between
Tree node t and some other node.
true if this set contains no elements.
String is the end-of-line token for
this tokenizer.
Collection with the given glue.
t1 and t2 which are
dominated by this node, returns their "join node": the node
j such that j dominates both
t1 and t2, and every other node which
dominates both t1 and t2
dominates j.
Lists of size
equal to the depth of the GeneralizedCounter.
Label interface can act as a
constituent, node, or word label with linguistic attributes.Label.LabeledConstituent object represents a single bracketing in
a derivation, including start and end points and Label
information, but excluding probabilistic information.LabeledConstituent object.
LabeledConstituent object with given
values.
LabeledConstituent object with given values.
LabeledConstituent object with given values.
LabeledScoredTreeFactory acts as a factory for creating
trees with labels and scores.LabeledScoredTreeNode represents a tree composed of a root
label, a score,
and an array of daughter parse trees.TreeReaderFactory that produces
labeled, scored array-based Trees, which have been cleaned up to
delete empties, etc.LabeledWord object contains a word and its tag.TaggedWord.
TaggedWord.
TaggedWord.
CategoryWordTag).
TaggedWord).
LabelFactory object acts as a factory for creating
objects of class Label, or some descendant class.StringLabel).
TaggedWord).
Word).
TaggedWord).
TaggedWord).
Labels,
null or otherwise, contained in the tree.
null if none.
SequenceClassifiers.WordLemmaTag .
Lexicon object suitable to the particular language/treebank combination of interest.
loadFromFilename, and is intended to be included in a routine
that unpacks a text-serialized form of an object that incorporates an Index.
Trees that ares the local trees
of the tree.
fromIndex, inclusive, and
toIndex, exclusive, of an array of numbers, which are
themselves input in log form.
fromIndex, inclusive, and
toIndex, exclusive, of an array of numbers, which are
themselves input in log form.
List of size one less than the depth of the GeneralizedCounter, and
each value is a ClassicCounter.
java edu.stanford.nlp.process.WordShapeClassifier
[-wordShape name] string+ name is an argument to lookupShaper.
labelIndices which give the
empirically legal label sequences (of length (order) at most
windowSize) and the classIndex, which indexes
known answer classes.
TregexMatcher for this pattern on this tree.
node.
int values.
float values.
double values.
head in
root given a HeadFinder
MemoryTreebank object stores a corpus of examples with
given tree structures in memory (as a List).float values.
double values.
function starting at initial, within
functionTolerance.
function starting at initial, within
functionTolerance.
GrammaticalStructure based on the given Tree.
String as the "name".
String as the value.
String objects passed in.
CategoryWordTag Label, where the label is
formed from
the Label object passed in.
String as the
value.
String as the value, and
the type determined in an implementation-dependent way from the
options value.
Label, where the label is formed from
the Label object passed in.
String as the "name".
String as the "name".
StringLabel, where the label is
formed from
the Label object passed in.
String as the value (word).
String as a value component.
TaggedWord Label, where the label is
formed from
the Label object passed in.
String passed in.
String passed in.
Word Label, where the label is
formed from
the Label object passed in.
String as the value (word).
String as a value component.
WordLemmaTag Label, where the label is
formed from the Label object passed in.
String as the value (word).
String as a value component.
WordTag Label, where the label is
formed from
the Label object passed in.
String as the "name".
String as the "name".
String passed in.
String passed in.
String passed in.
String passed in.
String passed in.
String passed in.
TreeReader using the provided
Reader.
TreeReaderFactory interface.
TreeReader using the provided
Reader.
root and ending at this.
Tree.
daughter in parent by ==.
Collection.
Collection.
List of indexed objects, in the order of their indices.
List of indexed objects, in the order of their indices.
this as a ClassicCounter.
null for
elements outside the real list.
TsurgeonPattern.
Constituents for PARSEVAL.
Constituents for
PARSEVAL evaluation.
t1 and t2 which are
dominated by this node, returns a list of all the nodes on the
path from t1 to t2, inclusive, or null if none found.
pcfgThresholdValue, then -Inf is returned as the
outside Score by oScore() (while otherwise the true
outside score is returned).
pennPrint() and saves output to a String
TreeReader interface to read Penn Treebank-style
files.Reader.
Reader.
PennTreeReader objects.LabeledScoredTreeFactory,
with StringLabels, a PennTreebankTokenizer,
and a TreeNormalizer.
TreeFactory;
uses a PennTreebankTokenizer, and a TreeNormalizer.
TreeNormalizer;
uses a PennTreebankTokenizer, and a LabeledScoredTreeFactory.
TreeFactory;
uses a PennTreebankTokenizer, and a TreeNormalizer.
HeadFinderCyclicCoreLabelCyclicCoreLabels of all its descendants.
System.out.
PrintWriter.
PrintWriter in the specified format.
PrintWriter.
Tree as strings.
List of something that extends CoreMap and prints
the likelihood of each possible label at each point.
List of documents and prints the likelihood of each
possible label at each point.
PrintWriter.
List of something that extends CoreMap and prints
the likelihood of each possible label at each point.
List of documents and prints the likelihood of each
possible label at each point.
Dataset.printSparseFeatureMatrix()
to System.out.
RVFDataset.printSparseFeatureMatrix(PrintWriter) to System.out.
add(), changePriority(),
removeFirst(), and getFirst() method calls.File.
Pattern.Pattern.
UnupportedOperationException.
System.err (without stopping timer).
System.err and restart timer.
num
num
num
String array.
String.
String array.
String.
String array.
String.
IOException.ClassifierFactory that incrementally builds
a more memory-efficient representation of a List of RVFDatum
objects for the purposes of training a Classifier with a
ClassifierFactory.Random number generator.
Random
number generator
ith child of this with the tree t.
Tree.
Tree.
TreeGraphNode.
String returned when the inner tokenizer
returns an end-of-line token.
LogConditionalObjectiveFunction.
String
representing the
complete contents of the label.
String
representing the
complete contents of the label.
String passed in.
String passed in.
String as the "name", perhaps
by doing some appropriate decoding of the string.
LineSearcher to be used in LinearClassifierFactory.heldOutSetSigma(GeneralDataset, GeneralDataset).
QNMinimizer.
TreeGraph of which this node
is a part.
tuneSigmaCV flag: when turned on,
the sigma is tuned by cross-validation.
tuneSigmaHeldOut flag: when turned on,
the sigma is tuned by means of held-out (70%-30%).
map.
useSum flag: when turned on,
the Summed Conditional Objective Function is used.
CGMinimizer.
SimpleConstituent object defines a generic edge in a graph.SimpleConstituent object.
SimpleConstituent object with given values.
ConstituentFactory acts as a factory for creating objects
of class Constituent, or some descendent class.SimpleTree is a minimal concrete implementation of an
unlabeled, unscored Tree.SimpleTreeFactory acts as a factory for creating objects
of class SimpleTree.TreeFactory.
Datums) in the Dataset.
Constituent
SloppyMath contains methods for performing basic
numeric operations.ann to the given CoreLabel.
System.err and stop timer.
StringLabel object acts as a Label by containing a
single String, which it sets or returns in response to requests.StringLabel with a null content (i.e., str).
StringLabel with the given content.
StringLabel with the given content.
StringLabel with the
value() of another label as its label.
StringLabelFactory object makes a simple
StringLabel out of a String.Collection.
fromIndex, inclusive, and toIndex, exclusive.
TaggedWord object contains a word and its tag.TaggedWord.
TaggedWord.
TaggedWord.
TaggedWord.
TaggedWord.
TaggedWordFactory acts as a factory for creating objects of
class TaggedWord.TaggedWordFactory.
TaggedWordFactory.
TreeGraphSystem.err and restart (static) timer.
java.io.StreamTokenizer
and a edu.stanford.nlp.process.Tokenizer.TokenizerAdaptor.
String representation of this node and
its subtree as a one-line parenthesized list.
List key in the GeneralizedCounter.
String representation of this
GrammaticalRelation and the hierarchy below
it, with one node per line, indented according to level.
String representation of this node and
its subtree with one node per line, indented according to
indentLevel.
PriorityQueue whose elements are
the keys of Counter c, and the score of each key in c becomes its priority.
Constituent.
String representation of the label.
String representation of the label.
String containing the value (and index,
if any) of this label.
Constituent.
GrammaticalRelation.
String representing this treegraph.
Appendable, such as a StringBuffer.
Appendable, such as a StringBuffer.
TaggedWord from two
lists of String, one for the words, and the second for
the tags.
Word from a
list of String.
Word objects from
an array of String objects.
String representation of the k keys
with the largest counts in the given Counter, using the given
format string.
Collection of Datum objects and gives you back a
Classifier trained on it.
Reference to a Collection of Datum
objects and gives you back a Classifier trained on them
Classifier on a Dataset.
Tree is used to collect all of the
tree types, and acts as a generic extendable type.Treebank object provides access to a corpus of examples with
given tree structures.CoreMaps
that require classes from the trees package.TreeFactory that produces trees of the
same type as the current Tree.
TreeFactory that produces trees of the
SimpleTree type.
TreeFactory that produces trees of the
appropriate type.
TreeFactory acts as a factory for creating objects of
class Tree, or some descendant class.TreeFactory that produces
TreeGraphNodes.
TreeGraph is a tree with additional directed,
labeled arcs between arbitrary pairs of nodes.TreeGraph having the same tree
structure and label values as an existing tree (but no shared
storage).
TreeGraph of which this node is a
part.
TreeGraphNode.
TreeGraphNode with the supplied
label.
TreeGraphNode with the supplied
label and list of child nodes.
TreeGraphNode having the same tree
structure and label values as an existing tree (but no shared
storage).
TreeGraphNode having the same tree
structure and label values as an existing tree (but no shared
storage).
TreeGraphNodeFactory acts as a factory for creating
nodes in a TreeGraphTreeFactory that produces
TreeGraphNodes.
edu.stanford.nlp.trees.Tree as the output of the
parser.TreeReader adds functionality to another Reader
by reading in Trees, or some descendant class.TreeReaderFactory for a Treebank --
this method is provided in order to make the
TreeReaderFactory available to subclasses.
TreeReaderFactory is a factory for creating objects of
class TreeReader, or some descendant class.Tree class.Tree.Tree.TregexPattern against a Tree.tgrep-type pattern for matching tree
node configurations.Trees when
successfully matched on with a TregexMatcher.TypedDependency is a relation between two words in a
GrammaticalStructure.CliqueTemplates object.
CGMinimizer, with the passed verbose flag.
CGMinimizer.
ValueLabel object acts as a Label with linguistic
attributes.toString(),
pennPrint(), or as in the Penn Treebank).
toString(),
pennPrint(), or as in the Penn Treebank.
Word object acts as a Label by containing a String.null value.
Label interface.
WordFactory acts as a factory for creating objects of
class Word.WordLemmaTag.
WordLemmaTag.
WordLemmaTag from a Label.
WordLemmaTagFactory acts as a factory for creating
objects of class WordLemmaTag.WordLemmaTagFactory.
WordLemmaTagFactory.
WordTag.
WordTag from a Label.
WordTagFactory acts as a factory for creating
objects of class WordTag.WordTagFactory.
WordTagFactory.
WordToSentenceProcessor using a sensible default
list of tokens to split on.
Counter[], each entry of which
keeps scores for possibilities in that template slot.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||