|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
Interface Summary | |
---|---|
DependencyGrammar | An interface for DependencyGrammars. |
Extractor | |
Lexicon | An interface for lexicons interfacing to lexparser. |
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 |
Class Summary | |
---|---|
AbstractDependencyGrammar | An abstract base class for dependency grammars. |
AbstractEval | A framework for Set-based precision/recall/F1 evaluation. |
AbstractEval.CatErrorEval | This class counts which categories are over and underproposed in trees. |
AbstractEval.DependencyEval | Evaluates the dependency accuracy of a tree (based on HeadFinder dependency judgements). |
AbstractEval.RuleErrorEval | |
AbstractEval.ScoreEval | This isn't really a kind of AbstractEval: we're sort of cheating here. |
AbstractEval.TaggingEval | |
AbstractTreebankParserParams | An abstract class providing a common method base from which to
complete a TreebankLangParserParams implementing class. |
AbstractTreeExtractor | |
BaseLexicon | This is the default concrete instantiation of the Lexicon interface. |
BaseUnknownWordModel | An unknown word model for a generic language. |
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. |
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. |
ConstituentEvalByCat | |
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. |
EvalB | |
ExhaustiveDependencyParser | An exhaustive O(n4t2) time and O(n2t) space dependency parser. |
ExhaustivePCFGParser | An exhaustive generalized CKY PCFG parser. |
FastFactoredParser | Provides a much faster way to realize the factored parsing idea, including easily returning "k good" results at the expense of optimality. |
GrammarCompactor | |
Hook | Class for parse table hooks. |
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 Numberer. |
IterativeCKYPCFGParser | Does iterative deepening search inside the CKY algorithm for faster parsing. |
LabeledConstituentEval | Provides for Precision/Recall/F1 evaluation of labeled constituents. |
LabeledConstituentEval.CBEval | |
LatticeReader | |
LatticeReader.LatticeWord | |
LexicalizedParser | This class provides the top-level API and command-line interface to a set of reasonably good treebank-trained parsers. |
MLEDependencyGrammar | |
MLEDependencyGrammarExtractor | Gathers statistics on tree dependencies and then passes them to an MLEDependencyGrammar for dependency grammar construction |
Options | 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. |
ParserData | Stores the serialized material representing the grammar and lexicon of a parser, and an Options that specifies things like how unknown words were handled and how distances were binned that will also be needed to parse with the grammar. |
PetrovLexicon | |
Rule | Parent class for unary and binary rules. |
SisterAnnotationStats | See what sister annotation helps in treebank, based on support and KL divergence. |
Test | Options to the parser which affect performance only at testing (parsing) time. |
Test.Constraint | A Constraint represents a restriction on possible parse trees to consider. |
Train | Non-language-specific options for training a grammar from a treebank. |
TreeAnnotator | Performs non-language specific annotation of Trees. |
TreeAnnotatorAndBinarizer | |
TreeBinarizer | Binarizes trees in such a way that head-argument structure is respected. |
UnaryGrammar | Maintains efficient indexing of unary grammar rules. |
UnaryRule | Unary grammar rules (with ints for parent and child). |
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |