Package edu.stanford.nlp.parser.lexparser

Interface Summary

DependencyGrammar	An interface for DependencyGrammars.
Extractor<T>
GrammarProjection	Maps between the states of a more split and less split grammar.
LatticeScorer
Lexicon	An interface for lexicons interfacing to lexparser.
Rule	Interface for int-format grammar rules.
Scorer	Interface for supporting A* scoring.
TagProjection	An interface for projecting POS tags onto a reduced set for the dependency grammar.
TreebankLangParserParams	Contains language-specific methods necessary to get the parser to parse an arbitrary treebank.
UnknownWordModel
UnknownWordModelTrainer	An interface for training an UnknownWordModel.

Class Summary

AbstractDependencyGrammar	An abstract base class for dependency grammars.
AbstractTreebankParserParams	An abstract class providing a common method base from which to complete a TreebankLangParserParams implementing class.
AbstractTreebankParserParams.AnnotatePunctuationFunction	Annotation function for mapping punctuation to PTB-style equivalence classes.
AbstractTreeExtractor<T>	An abstract superclass for parser classes that extract counts from Trees.
AbstractUnknownWordModelTrainer
ArabicTreebankParserParams	A TreebankLangParserParams implementing class for the Penn Arabic Treebank.
BaseLexicon	This is the default concrete instantiation of the Lexicon interface.
BaseUnknownWordModel	An unknown word model for a generic language.
BaseUnknownWordModelTrainer
BiLexPCFGParser	Implements Eisner and Satta style algorithms for bilexical PCFG parsing.
BiLexPCFGParser.N5BiLexPCFGParser
BinaryGrammar	Maintains efficient indexing of binary grammar rules.
BinaryGrammarExtractor
BinaryRule	Binary rules (ints for parent, left and right children)
BoundaryRemover	Removes a boundary symbol (Lexicon.BOUNDARY_TAG or Lexicon.BOUNDARY), which is the rightmost daughter of a tree.
ChineseCharacterBasedLexicon
ChineseLexicon	A lexicon class for Chinese.
ChineseLexiconAndWordSegmenter	This class lets you train a lexicon and segmenter at the same time.
ChineseSimWordAvgDepGrammar	A Dependency grammar that smooths by averaging over similar words.
ChineseTreebankParserParams	Parameter file for parsing the Penn Chinese Treebank.
CNFTransformers
CollinsPuncTransformer	This class manipulates punctuation in trees (used with training trees) in the same manner that Collins manipulated punctuation in trees when building his parsing model.
Debinarizer	Debinarizes a binary tree from the parser.
Edge	Class for parse edges.
EnglishTreebankParserParams	Parser parameters for the Penn English Treebank (WSJ, Brown, Switchboard).
EnglishTreebankParserParams.EnglishTest
EnglishTreebankParserParams.EnglishTrain
EnglishUnknownWordModel	This is a basic unknown word model for English.
EnglishUnknownWordModelTrainer
EvalbFormatWriter
ExactGrammarCompactor
ExhaustiveDependencyParser	An exhaustive O(n4t2) time and O(n2t) space dependency parser.
ExhaustivePCFGParser	An exhaustive generalized CKY PCFG parser.
FactoredLexicon
FactoredLexiconEvent
FactoredParser
FastFactoredParser	Provides a much faster way to realize the factored parsing idea, including easily returning "k good" results at the expense of optimality.
FrenchTreebankParserParams	TreebankLangParserParams for the Frenck Treebank corpus.
GermanUnknownWordModel	An unknown word model for German; relies on BaseUnknownWordModel plus number matching.
GermanUnknownWordModelTrainer
GrammarCompactor
HebrewTreebankParserParams	Initial version of a parser pack for the HTB.
Hook	Class for parse table hooks.
HTKLatticeReader
HTKLatticeReader.LatticeWord
IntDependency	Maintains a dependency between head and dependent where they are each an IntTaggedWord.
IntTaggedWord	Represents a WordTag (in the sense that equality is defined on both components), where each half is represented by an int indexed by a Index.
Item	Abstract class for parse items.
IterativeCKYPCFGParser	Does iterative deepening search inside the CKY algorithm for faster parsing.
Lattice
LatticeEdge
LexicalizedParser	This class provides the top-level API and command-line interface to a set of reasonably good treebank-trained parsers.
LexicalizedParserQuery
LinearGrammarSmoother	Implements linear rule smoothing a la Petrov et al.
MLEDependencyGrammar
MLEDependencyGrammarExtractor	Gathers statistics on tree dependencies and then passes them to an MLEDependencyGrammar for dependency grammar construction.
NegraPennTreebankParserParams	Parameter file for parsing the Penn Treebank format of the Negra Treebank (German).
Options	This class contains options to the parser which MUST be the SAME at both training and testing (parsing) time in order for the parser to work properly.
Options.LexOptions
OutsideRuleFilter
ParentAnnotationStats	See what parent annotation helps in treebank, based on support and KL divergence.
ParserAnnotations	Parse time options for the Stanford lexicalized parser.
ParserAnnotations.CandidatePartOfSpeechAnnotation	This CoreMap key represents a regular expression which the parser will try to match when assigning tags.
ParserAnnotations.ConstraintAnnotation	The CoreMap key for getting a list of constraints to apply when parsing.
ParserConstraint	A Constraint represents a restriction on possible parse trees to consider.
SisterAnnotationStats	See what sister annotation helps in treebank, based on support and KL divergence.
SplittingGrammarExtractor	This class is a reimplementation of Berkeley's state splitting grammar.
TestOptions	Options to the parser which affect performance only at testing (parsing) time.
TrainOptions	Non-language-specific options for training a grammar from a treebank.
TreeAnnotator	Performs non-language specific annotation of Trees.
TreeAnnotatorAndBinarizer
TreebankAnnotator	Class for getting an annotated treebank.
TreeBinarizer	Binarizes trees in such a way that head-argument structure is respected.
TreeCollinizer	Does detransformations to a parsed sentence to map it back to the standard treebank form for output or evaluation.
UnaryGrammar	Maintains efficient indexing of unary grammar rules.
UnaryRule	Unary grammar rules (with ints for parent and child).
UnknownGTTrainer	This class trains a Good-Turing model for unknown words from a collection of trees.