|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
AbstractLabel
object acts as a Label with linguistic
attributes.TreebankLangParserParams
implementing class.TreebankLangParserParams
implementing class for the Penn Arabic Treebank.destNode
,
and returns the Set
of Object
s which
label those arcs.
StringUtils.argsToMap(java.lang.String[])
.
Counters#average(Counter, Counter)
instead.
Counters#average(Counter, Counter)
instead.
labelAnnotationIntroducingCharacters()
.
null
if
none), which is stored in the map under the key CATEGORY_KEY
.
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.Treebank
.
Treebank
.
Treebank
.
TreeReader
.
TreeReader
.
Label
.
Label
.
Label
.
Comparable
interface.
UnnamedDependency
.
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
Counter
s.this
as a Counter
.
Pair
s
AbstractTreebankParserParams.DependencyTyper
.
DiskTreebank
object stores merely the information to
get at a corpus of trees that is stored on disk.Counters
.this
dominates the Tree passed in
as an argument.
this
and the dominated node itself.
List
but contains doubles.java.io
package in useful
ways for our applications.Word
, Tag
, etc.Tree
instances.System.err
(without stopping timer).
Counters#entropy(Counter)
instead.
Counters#entropy(Counter)
instead.
List
of size equal to the depth of the GeneralizedCounter, and
each value is a Double
.
Label
s is defined in the first instance
as equality of their String
value()
.
TreeGraphNode
s.
Object
s to their equivalence classes.MapLabel
s.
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
.
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 TreeGraphNode
s to
which there exist arcs bearing the specified label from this
node, or null
if no such nodes exist.
List
s of a
prespecified length.ADJECTIVAL_COMPLEMENT
of the given node t
.
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.
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.
CLAUSAL_COMPLEMENT
of the given node t
.
CLAUSAL_SUBJECT
of the given node t
.
GeneralizedCounter.getCounts(java.util.List)
({o})
; works only
for depth 1 GeneralizedCounters
GeneralizedCounter.getCounts(java.util.List)
({o1,o2})
; works only for depth 2
GeneralizedCounters
GeneralizedCounter.getCounts(java.util.List)
({o1,o2,o3})
; works only for depth 3
GeneralizedCounters
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 DEPENDENT
s of the given node t
.
DIRECT_OBJECT
of the given node t
.
GOVERNOR
of the given node t
.
t
.
t
.
INDIRECT_OBJECT
of the given node t
.
name
in the pattern.
NOMINAL_SUBJECT
of the given node t
.
Distribution
instead of using this method.
Distribution
instead of using this method.
PREDICATE
of the given node t
.
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
.
TEMPORAL_MODIFIER
of the given node
t
.
n
th terminal in tree
.
PTBTokenizer
.
GrammaticalRelation
is used to define a
standardized, hierarchical set of grammatical relations for the
English language, together with patterns for identifying them in
parse trees.GrammaticalStructure
is a TreeGraph
(that is, a tree with additional labeled
arcs between nodes) for representing the grammatical relations in a
parse tree.GrammaticalStructure
from an
existing parse tree.
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.head
(transitively) heads node
null
if none), as recorded in this node's MapLabel
.
null
if none), as recorded in this node's MapLabel
.
GeneralizedCounter.depth()
-dimensional key l
.
GeneralizedCounter.incrementCount(java.util.List, java.lang.Object)
({o}, count)
;
only works for a depth 1 GeneralizedCounter.
INDEX_KEY
.
TreeGraphNode
.
Counters#informationRadius(Counter, Counter)
instead.
Counters#informationRadius(Counter, Counter)
instead.
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.
List
s of size
equal to the depth of the GeneralizedCounter.
Counters#klDivergence(Counter, Counter)
instead.
Counters#klDivergence(Counter, Counter)
instead.
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.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.MapLabel
s.
StringLabel
).
Tag
).
TaggedWord
).
Word
).
TaggedWord
).
Label
s,
null or otherwise, contained in the tree.
null
if none.
List
of size one less than the depth of the GeneralizedCounter, and
each value is a Counter
.
Map
contained in this label.
MapLabel
object contains a Map
, which
in turn may contain arbitrary key-value pairs.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.
verbFile
.
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.
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.
TreeReaderFactory
interface.
TreeReader
.
TreeReaderFactory
interface.
TreeReader
using the provided
Reader
.
Distribution
instead.
Tree
.
daughter
in parent
by ==.
this
as a Counter
.
Constituent
s for
PARSEVAL evaluation.
PennTreeReader
is a TreeReader
that
reads in Penn Treebank-style files.Reader
.
Reader
.
Reader
.
HeadFinder
to determine the heads for this node and all its descendants,
and to store references to the head word node and head tag node
in this node's MapLabel
and the
MapLabel
s of all its descendants.
PrefixProbabilityParser
instances.System.out
.
typedDependenciesToString()
to stdout
.
typedDependenciesToString()
to the specified
PrintWriter
.
typedDependenciesToString(format)
to stdout
.
typedDependenciesToString(format)
to the specified
PrintWriter
.
File
.
System.err
(without stopping timer).
System.err
and restart timer.
TaggedWord
from two
lists of String
, one for the words, and the second for
the tags.
CATEGORY_KEY
.
Tree
.
Tree
.
TreeGraphNode
.
String
returned when the inner tokenizer
returns an end-of-line token.
String
representing the
complete contents of the label.
CATEGORY_KEY
.
String
passed in.
String
passed in.
String
as the "name", perhaps
by doing some appropriate decoding of the string.
INDEX_KEY
.
Map
contained in this label to the
supplied Map
.
HEAD_TAG_KEY
.
TreeGraph
of which this node
is a part.
CATEGORY_KEY
.
HEAD_WORD_KEY
.
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
.Collection
.
null
if none),
which is stored in the map under the key HEAD_TAG_KEY
.
Tag
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
.
TreeGraph
of which this
node is part.
System.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
.
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.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
TreeGraphNode
s.
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 TreeGraph
.TreeFactory
that produces
TreeGraphNode
s.
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.List
of Triple
s, each
representing a typed dependency in the
GrammaticalStructure
.
typedDependencies()
in a user-specified format.
typedDependencies()
as exemplified by the following:
null
if none),
which is stored in the map under the key CATEGORY_KEY
.
toString()
,
pennPrint()
, or as in the Penn Treebank).
toString()
,
pennPrint()
, or as in the Penn Treebank.
null
if
none), which is stored in the map under the key HEAD_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
.WordTag
.
WordTag
from a Label.
WordTagFactory
acts as a factory for creating
objects of class WordTag
.WordTagFactory
.
WordTagFactory
.
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |