|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
Counter
.remove()
defined to throw an
UnsupportedOperationException
.this + addend
does not change receiver.
Counters.addInPlace(Counter, Counter)
.
Counters.addInPlace(Counter, Counter, double)
Alignment
objects for acronym alignment.height
nodes up from the current node.
StringUtils.argsToMap(java.lang.String[])
.
CoreMap
backed by Java Arrays.Counters.toPriorityQueue(Counter)
Counters.mean(Counter)
.
PTBTokenizer
.
t1
and t2
which are
dominated by this node, returns true
iff
t1
c-commands t2
.
TreeReader
.
TreeReader
.
Counters.toComparator(edu.stanford.nlp.stats.Counter)
and Collections.reverseOrder(Comparator)
if necessary.
Counters.toComparator(edu.stanford.nlp.stats.Counter)
Counters.toComparator(edu.stanford.nlp.stats.Counter)
value()
's lexicographic ordering.
MutableDouble
objects numerically.
MutableDouble
object to another object.
MutableInteger
objects numerically.
MutableInteger
object to another object.
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.key
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.CoreMap
's.CoreLabel
s as Strings with a corresponding BEGIN and END position.Counter
s.this
as a ClassicCounter
.
Pair
s
PascalTemplate
.this
to other
Counters.scaleInPlace(Counter, double)
Counters.divideInPlace(Counter, Counter)
SequenceClassifier
s.this
dominates the Tree passed in
as an argument.
this
and the dominated node itself.
this
with other
FileReader
but allows for the specification of input encoding.System.err
(without stopping timer).
o==this
ValueLabel
s is defined in the first instance
as equality of their String
value()
.
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.
accept
method.null
if none.
List
s of a
prespecified length.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})
; 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
.
i
th node in the tree, with node numbers defined
as in Tree.nodeNumber(Tree)
.
Distribution
instead of using this method.
HasCategory
interface
knows about categories.ArrayCoreMap
with an immutable set of key,value
pairs that is used for equality and hashcode comparisons.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.GeneralizedCounter.depth()
-dimensional key l
.
GeneralizedCounter.incrementCount(java.util.List, java.lang.Object)
({o}, count)
;
only works for a depth 1 GeneralizedCounter.
Tree
, starting with 1.
PascalTemplate
.dtr
after position
existing
daughters in this
.
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
.
Counters.keysAbove(Counter, double)
Counters.keysAt(Counter, double)
Counters.keysBelow(Counter, double)
List
s 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.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.LabeledWord
object contains a word and its tag.TaggedWord
.
TaggedWord
.
TaggedWord
.
TaggedWord
).
LabelFactory
object acts as a factory for creating
objects of class Label
, or some descendant class.StringLabel
).
TaggedWord
).
Word
).
TaggedWord
).
TaggedWord
).
Label
s,
null or otherwise, contained in the tree.
null
if none.
SequenceClassifier
s.WordLemmaTag
.
loadFromFilename
, and is intended to be included in a routine
that unpacks a text-serialized form of an object that incorporates an Index.
Tree
s that ares the local trees
of the tree.
Counters.logNormalize(Counter)
.
fromIndex
, inclusive, and
toIndex
, exclusive, of an array of numbers, which are
themselves input in log form.
Counters.logSum(Counter)
.
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
.
float
values.
double
values.
float
values.
double
values.
function
starting at initial
, within
functionTolerance
.
Counters.scaleInPlace(Counter, double)
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
passed in.
String
passed in.
String
passed in.
String
passed in.
String
passed in.
String
passed in.
TreeReaderFactory
interface.
TreeReader
using the provided
Reader
.
root
and ending at this
.
Tree
.
Collection
.
List
of indexed objects, in the order of their indices.
this
as a ClassicCounter
.
null
for
elements outside the real list.
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
.
System.out
.
PrintWriter
.
List
of CoreLabel
s 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 CoreLabel
s 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.
add()
, changePriority()
,
removeFirst()
, and getFirst()
method calls.Pattern
.Pattern
.
UnupportedOperationException
.
Counters.retainNonZeros(Counter)
System.err
(without stopping timer).
System.err
and restart timer.
Counters.retainTop(edu.stanford.nlp.stats.Counter, int)
num
IOException
.this * factor
does not change receiver.
value
(in sparse matrices, sets all nonzero elements = value)
i
th child of this
with the tree t.
Tree
.
Tree
.
String
returned when the inner tokenizer
returns an end-of-line token.
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.
BasicDocument.parse(String)
.
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
.
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 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
-
- subCWGaz -
Variable in class edu.stanford.nlp.sequences.SeqClassifierFlags
-
- subdate -
Variable in class edu.stanford.nlp.ie.pascal.DateTemplate
-
- subtractAll(Counter<E>) -
Method in class edu.stanford.nlp.stats.ClassicCounter
- Deprecated. Use
Counters.subtractInPlace(Counter, Counter)
- subtractAll(Counter<E>, boolean) -
Method in class edu.stanford.nlp.stats.ClassicCounter
- Deprecated. Use
Counters.subtractInPlace(Counter, Counter)
and then Counters.retainNonZeros(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.
- subtractAll(K1, ClassicCounter<K2>) -
Method in class edu.stanford.nlp.stats.TwoDimensionalCounter
-
- subtractAll(TwoDimensionalCounter<K1, K2>, boolean) -
Method in class edu.stanford.nlp.stats.TwoDimensionalCounter
-
- subtractInPlace(Counter<E>, Counter<E>) -
Static method in class edu.stanford.nlp.stats.Counters
- Sets each value of target to be target[k]-arg[k] for all keys k in target.
- subtractMultiple(Counter<E>, double) -
Method in class edu.stanford.nlp.stats.ClassicCounter
- Deprecated. Use
Counters.addInPlace(Counter, Counter, double)
- 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
.
- success -
Variable in class edu.stanford.nlp.optimization.QNMinimizer
-
- successorStates() -
Method in class edu.stanford.nlp.fsm.DFSAState
-
- sum(double[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
- Returns the sum of an array of numbers.
- sum(double[], int, int) -
Static method in class edu.stanford.nlp.math.ArrayMath
- Returns the sum of the portion of an array of numbers between
fromIndex
, inclusive, and toIndex
, exclusive.
- sum(int[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- sum(float[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- sum(int[][]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- sumOutEnd() -
Method in class edu.stanford.nlp.ie.crf.FactorTable
-
- sumOutEnd() -
Method in class edu.stanford.nlp.ie.crf.FloatFactorTable
-
- sumOutFront() -
Method in class edu.stanford.nlp.ie.crf.FactorTable
-
- sumOutFront() -
Method in class edu.stanford.nlp.ie.crf.FloatFactorTable
-
- sumSquaredError(double[]) -
Static method in class edu.stanford.nlp.math.ArrayMath
-
- suppressEscaping -
Variable in class edu.stanford.nlp.process.PTBTokenizer.PTBTokenizerFactory
-
- suppressMidDotPostprocessing -
Variable in class edu.stanford.nlp.sequences.SeqClassifierFlags
-
- svmModelFile -
Variable in class edu.stanford.nlp.sequences.SeqClassifierFlags
-
- switchedFilter(Filter<E>, boolean) -
Static method in class edu.stanford.nlp.util.Filters
- Filter that's either negated or normal as specified.
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
.
List
of CoreLabel
s.
Sentence
.
flags.inferenceType
.
Sentence
.
Sentence
.
String
.
String
.
String
.
String
.
System.err
and restart (static) timer.
java.io.StreamTokenizer
and a edu.stanford.nlp.process.Tokenizer
.TokenizerAdaptor
.
BasicDocument.parse(String)
.
BasicDocument.parse(String)
.
List
key in the GeneralizedCounter.
PriorityQueue
of the c where the score of the object is its priority.
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.
Constituent
.
String
containing the value (and index,
if any) of this label.
Counters.toString(Counter, NumberFormat)
Constituent
.
StringBuffer
.
StringBuffer
.
StringBuffer
.
ClassicCounter.totalCount()
.
String
representation of the k
keys
with the largest counts in the given Counter
, using the given
format string.
Tree
is used to collect all of the
tree types, and acts as a generic extendable type.CoreMap
's 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
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.TreeReader
adds functionality to another Reader
by reading in Trees, or some descendant class.TreeReaderFactory
is a factory for creating objects of
class TreeReader
, or some descendent class.Tree
.CliqueTemplates
object.
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 |