|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
TreebankLangParserParams implementing class.AFTErheight nodes up from the current node.
destNode,
and returns the Set of Objects which
label those arcs.
destNode,
or null if no such arc exists.
true iff o1 and o2 are equal by the desired
evaluation criterion.
StringUtils.argsToMap(java.lang.String[]).
Comparator.
labelAnnotationIntroducingCharacters().
PTBTokenizer.
BEFOREnull if
none), which is stored in the map under the key CATEGORY_KEYCategoryWordTag 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.
Treebank.
Treebank.
Treebank.
TreeReader.
TreeReader.
TypedDepedencyList by
collapsing two types of transitive pairs of dependencies:
prepositional dependencies
dep(cat, in) and
dep(in, hat) are collapsed to
in(cat, hat)
possessive dependencies
dep(revenge, 's) and
dep('s, Montezuma) are collapsed to
poss(revenge, Montezuma)
TypedDependencyList to collapse
language-dependent transitive dependencies.
CollocationFinder over the Tree t.
CollocationFinder over the Tree t.
value()'s lexicographic ordering.
MutableDouble objects numerically.
MutableDouble object to another object.
MutableInteger objects numerically.
MutableInteger object to another object.
Pair to another object.
TreePattern instance.
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.Counter, this currently returns true if the count is
explicitly 0.0 for something
Counters.this as a Counter.
Pairs
CURRENTObject.equals(java.lang.Object) to determine equality.
GrammaticalStructure.
DependencyTyper.
DiskTreebank is a Collection of
System.out.
System.out.
Counters.PTBTokenizer.
this dominates the Tree passed in
as an argument.
this and the dominated node itself.
System.err (without stopping timer).
EnglishGrammaticalRelations is a
set of GrammaticalRelation objects for the English language.GrammaticalStructure from an
existing parse tree.
List of size equal to the depth of the GeneralizedCounter, and
each value is a Double.
ValueLabels is defined in the first instance
as equality of their String value().
TreeGraphNodes.
Objects to their equivalence classes.Collections.Object.equals(java.lang.Object) as equality criterion
and grouping all items into the "null" equivalence class for reporting purposes
Object.equals(java.lang.Object) as equality criterion
and grouping all items according to the EquivalenceClasser argument.
Object.equals(java.lang.Object) as equality criterion
and grouping all items according to the EquivalenceClasser argument.
Objects.Collections to the tabulated statistics of
the evaluation.
MapLabels.
Tag).
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
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.
EquivalenceClassEval.Factory instance that vends new EquivalenceClassEval instances with
settings like this
FilePathProcessor traverses a directory structure and
applies the processFile method to files meeting some
criterion.accept method.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.
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.
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.
File from which trees are currently being
read by apply(), and pased to a
TreePprocessor.
Set of leaf (terminal) nodes
which are the DEPENDENTt.
GOVERNORt.
name in the pattern.
Distribution instead of using this method.
Distribution instead of using this method.
nth preterminal in tree.
Tree node t, attempts to
return a list of nodes to which node t has this
grammatical relation.
SUBJECTt.
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.GrammaticalStructure
objects of the given specific type
HasCategory interface
knows about categories.true if this Tokenizer has more elements.
true if and only if this Tokenizer has more elements.
HasTag interface
knows about part-of-speech tags.HasWord interface
knows about words.TueBaDZHeadFinder.
head (transitively) heads node
null if none), as recorded in this node's MapLabelnull if
none), which is stored in the map under the key HEAD_WORD_KEYnull if none), as recorded in this node's MapLabelGeneralizedCounter.depth()-dimensional key l.
GeneralizedCounter.incrementCount(java.util.List, java.lang.Object)({o}, count)INDEX_KEYTreeGraphNode.
dtr after position existing
daughters in this.
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.
String is the end-of-line token for
this tokenizer.
this is a leaf.
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 no other node which
also 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.
LabeledScoredConstituent object defines an edge in a graph
with a label and a score.LabeledScoredConstituent object.
LabeledScoredConstituent object with given
values.
LabeledScoredConstituent object with given
values.
LabeledScoredConstituentFactory acts as a factory for
creating objects of class LabeledScoredConstituent.LabeledScoredTreeFactory acts as a factory for creating
trees with labels and scores.LabeledScoredTreeLeaf represents the leaf of a tree
in a parse tree 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.CategoryWordTag).
LabelFactory object acts as a factory for creating
objects of class Label, or some descendent class.MapLabels.
StringLabel).
Tag).
TaggedWord).
Word).
TaggedWord).
TaggedWord).
Labels,
null or otherwise, contained in the tree.
null if none.
WordLemmaTag .
LexerTokenizer.Tokenizer designed to work with
Lexer implementing classes.edu.stanford.nlp.SerializedLexicalizedParser,
or a default file location.
edu.stanford.nlp.SerializedLexicalizedParser,
or a default file location
(/u/nlp/data/lexparser/englishPCFG.ser.gz).
List of size one less than the depth of the GeneralizedCounter, and
each value is a Counter.
Map contained in this label.
AbstractMapLabel implementation which uses Object equality and hashcode.MapLabel with null value.
MapLabel with the given value.
MapLabel with the value of another
Label as its value.
MapLabelFactory is a factory that makes a
Label which is a MapLabel.TreeMatcher that can match
this pattern to the specified input tree.
TregexMatcher for this pattern on this tree.
TreePattern against the
specified Tree, at the supplied Tree node t.
node.
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.
NERGrammaticalStructure 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 value.
String as the value.
MapLabel with the value of
oldLabel as its value.
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 value.
String as the "name".
String passed in.
String passed in.
String passed in.
String passed in.
String passed in.
String passed in.
TreeReaderFactory interface.
TreeReader.
TreeReaderFactory interface.
TreeReader using the provided
Reader.
Distribution instead.
Tree.
null
daughter in parent by ==.
this as a Counter.
Parser.Parser(String, String)
with both arguments being null.
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.
pennPrint() and saves output to a String
PennTreeReader is a TreeReader that
reads in Penn Treebank-style files.Reader.
Reader.
Reader.
HeadFinderMapLabelMapLabels of all its descendants.
System.out.
stdout.
PrintWriter.
stdout
in the specified format.
PrintWriter in the specified format.
Tree as strings.
File.
length character positions in the
lexer.
System.err (without stopping timer).
System.err and restart timer.
IOException.TaggedWord from two
lists of String, one for the words, and the second for
the tags.
Sentence.AFTERtrue, then multiple instances of the same item will not be merged.
BEFORE}.
ith child of this with the tree t.
Tree.
Tree.
TreeGraphNode.
CURRENTString returned when the inner tokenizer
returns an end-of-line token.
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.
INDEX_KEYMap contained in this AbstractMapLabel to the
supplied Map.
NERHEAD_TAG_KEYBasicDocument.parse(String).
Tokenizer.
TreeGraph of which this node
is a part.
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.
TreeFactory.
TreeReaderFactory.Constituent
SloppyMath contains methods for performing basic
numeric operations.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
value() of another label as its label.
TreeReaderFactory that produces
labeled, scored array-based Trees, which have been cleaned up to
delete empties, etc.StringLabelFactory object makes a simple
StringLabel out of a String.Processor whose process method deletes all
SGML/XML/HTML tags (tokens starting with < and ending
with >.- StripTagsProcessor() -
Constructor for class edu.stanford.nlp.process.StripTagsProcessor
- Constructs a new StripTagsProcessor that doesn't mark line breaks.
- StripTagsProcessor(boolean) -
Constructor for class edu.stanford.nlp.process.StripTagsProcessor
- Constructs a new StripTagProcessor that marks line breaks as specified.
- subArray(int[], int, int) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- subcategoryStripper() -
Method in class edu.stanford.nlp.parser.lexparser.AbstractTreebankParserParams
- Returns a TreeTransformer appropriate to the Treebank which
can be used to remove functional tags (such as "-TMP") from
categories.
- subcategoryStripper() -
Method in class edu.stanford.nlp.parser.lexparser.EnglishTreebankParserParams
- Returns a TreeTransformer appropriate to the Treebank which
can be used to remove functional tags (such as "-TMP") from
categories.
- subcategoryStripper() -
Method in interface edu.stanford.nlp.parser.lexparser.TreebankLangParserParams
- Returns a TreeTransformer appropriate to the Treebank which
can be used to remove functional tags (such as "-TMP") from
categories.
- SUBJECT -
Static variable in class edu.stanford.nlp.trees.EnglishGrammaticalRelations
- The "subject" grammatical relation.
- subList(int, int) -
Method in class edu.stanford.nlp.trees.MemoryTreebank
-
- subtract(double[], double[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- subtract(float[], float[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- subtractAll(Counter<E>) -
Method in class edu.stanford.nlp.stats.Counter
- Subtracts the counts in the given Counter from the counts in this Counter.
- subtractAll(IntCounter<E>) -
Method in class edu.stanford.nlp.stats.IntCounter
- Subtracts the counts in the given Counter from the counts in this Counter.
- subTreeList() -
Method in class edu.stanford.nlp.trees.Tree
- Get the list of all subtrees inside the tree by returning a tree
rooted at each node.
- subTrees() -
Method in class edu.stanford.nlp.trees.Tree
- Get the set of all subtrees inside the tree by returning a tree
rooted at each node.
- subTrees(Collection<Tree>) -
Method in class edu.stanford.nlp.trees.Tree
- Add the set of all subtrees inside a tree (including the tree itself)
to the given
Collection.
- sum(double[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- sum(float[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- sumSquaredError(double[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- SunJurafskyChineseHeadFinder - Class in edu.stanford.nlp.trees.international.pennchinese
- A headfinder for Chinese based on rules described in Sun/Jurafsky NAACL '04.
- SunJurafskyChineseHeadFinder() -
Constructor for class edu.stanford.nlp.trees.international.pennchinese.SunJurafskyChineseHeadFinder
-
- SunJurafskyChineseHeadFinder(TreebankLanguagePack) -
Constructor for class edu.stanford.nlp.trees.international.pennchinese.SunJurafskyChineseHeadFinder
-
- sunJurafskyHeadFinder -
Variable in class edu.stanford.nlp.parser.lexparser.ChineseTreebankParserParams
-
- SUPPCUTOFF -
Static variable in class edu.stanford.nlp.parser.lexparser.ParentAnnotationStats
- Minimum support of parent annotated node for grandparent to be
studied.
- SUPPCUTOFF -
Static variable in class edu.stanford.nlp.parser.lexparser.SisterAnnotationStats
- Minimum support of parent annotated node for grandparent to be
studied.
- supportedFonts(int) -
Static method in class edu.stanford.nlp.swing.FontDetector
- Returns which Fonts on the system can display the sample string.
- suppressTerminalDetails -
Static variable in class edu.stanford.nlp.ling.CategoryWordTag
- If set to true, when a terminal or preterminal has as its category
something that is also the word or tag value, the latter are
suppressed.
- switchedFilter(Filter, boolean) -
Static method in class edu.stanford.nlp.util.Filters
- Filter that's either negated or normal as specified.
- SwitchTo(int) -
Static method in class edu.stanford.nlp.trees.tregex.TregexParserTokenManager
-
- syncSpi() -
Method in class edu.stanford.nlp.util.DisabledPreferences
-
- systemRoot() -
Method in class edu.stanford.nlp.util.DisabledPreferencesFactory
-
null if none),
which is stored in the map under the key TAG_KEYTag object acts as a Label by containing a
String that is a part-of-speech tag.Label interface.
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.
BasicDocument.parse(String).
BasicDocument.parse(String).
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 of the c where the score of the object is its priority.
Constituent.
String representation of the label.
String containing the value (and index,
if any) of this label.
Constituent.
GrammaticalRelation.
String representing this treegraph.
StringBuffer.
StringBuffer.
StringBuffer.
Tree is used to collect all of the
tree types, and acts as a generic composite type.Treebank object provides access to a corpus of examples with
given tree structures.ChineseTreebankLanguagePack
TreeFactory that produces trees of the
same type as the current Tree.
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 descendent 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).
TreeGraphNodeFactory acts as a factory for creating
nodes in a TreeGraphTreeFactory that produces
TreeGraphNodes.
TreeLengthComparator orders trees by their yield sentence
lengths.TreeLengthComparator.
TreePattern against a Tree.tgrep-type pattern.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 descendent class.Tree class.Tree.Tree.TregexPattern against a Tree.tgrep-type pattern.GrammaticalRelation class.
GrammaticalRelation class.
GrammaticalRelation class.
TypedDependency is a relation between two words in
a GrammaticalStructure.TypedDependencyList represents a complete list of
typed dependencies for a GrammaticalStructure,
with special methods for printing in different formats.GrammaticalStructure.
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_KEY.
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.
WordToTaggedWordProcessor using the default
forward slash character to split on.
Reader inside the Lexer.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||