edu.stanford.nlp.parser.lexparser
Interface ParserQuery

All Known Implementing Classes:
LexicalizedParserQuery, RerankingParserQuery

public interface ParserQuery


Method Summary
 Tree getBestDependencyParse(boolean debinarize)
           
 Tree getBestFactoredParse()
           
 Tree getBestParse()
           
 Tree getBestPCFGParse()
           
 java.util.List<ScoredObject<Tree>> getBestPCFGParses()
           
 KBestViterbiParser getDependencyParser()
           
 KBestViterbiParser getFactoredParser()
           
 java.util.List<ScoredObject<Tree>> getKBestPCFGParses(int kbestPCFG)
           
 java.util.List<ScoredObject<Tree>> getKGoodFactoredParses(int kbest)
           
 KBestViterbiParser getPCFGParser()
           
 double getPCFGScore()
           
 boolean hasFactoredParse()
           
 java.util.List<? extends HasWord> originalSentence()
           
 boolean parse(java.util.List<? extends HasWord> sentence)
           
 boolean parseAndReport(java.util.List<? extends HasWord> sentence, java.io.PrintWriter pwErr)
           
 boolean parseFallback()
          The model had to fall back to a simpler model on the previous parse
 boolean parseNoMemory()
          The model ran out of memory on the most recent parse
 boolean parseSkipped()
          The sentence was skipped, probably because it was too long or of length 0
 boolean parseSucceeded()
          Parsing succeeded without any horrible errors or fallback
 boolean parseUnparsable()
          The model could not parse the most recent sentence for some reason
 void restoreOriginalWords(Tree tree)
           
 boolean saidMemMessage()
           
 void setConstraints(java.util.List<ParserConstraint> constraints)
           
 

Method Detail

parse

boolean parse(java.util.List<? extends HasWord> sentence)

parseAndReport

boolean parseAndReport(java.util.List<? extends HasWord> sentence,
                       java.io.PrintWriter pwErr)

getPCFGScore

double getPCFGScore()

getBestParse

Tree getBestParse()

getBestPCFGParse

Tree getBestPCFGParse()

getBestDependencyParse

Tree getBestDependencyParse(boolean debinarize)

getBestFactoredParse

Tree getBestFactoredParse()

getBestPCFGParses

java.util.List<ScoredObject<Tree>> getBestPCFGParses()

restoreOriginalWords

void restoreOriginalWords(Tree tree)

hasFactoredParse

boolean hasFactoredParse()

getKBestPCFGParses

java.util.List<ScoredObject<Tree>> getKBestPCFGParses(int kbestPCFG)

getKGoodFactoredParses

java.util.List<ScoredObject<Tree>> getKGoodFactoredParses(int kbest)

getPCFGParser

KBestViterbiParser getPCFGParser()

getFactoredParser

KBestViterbiParser getFactoredParser()

getDependencyParser

KBestViterbiParser getDependencyParser()

setConstraints

void setConstraints(java.util.List<ParserConstraint> constraints)

saidMemMessage

boolean saidMemMessage()

parseSucceeded

boolean parseSucceeded()
Parsing succeeded without any horrible errors or fallback


parseSkipped

boolean parseSkipped()
The sentence was skipped, probably because it was too long or of length 0


parseFallback

boolean parseFallback()
The model had to fall back to a simpler model on the previous parse


parseNoMemory

boolean parseNoMemory()
The model ran out of memory on the most recent parse


parseUnparsable

boolean parseUnparsable()
The model could not parse the most recent sentence for some reason


originalSentence

java.util.List<? extends HasWord> originalSentence()


Stanford NLP Group