³ò 4ÒÇIc@stddkZddklZlZlZdefd„ƒYZdeefd„ƒYZdeefd„ƒYZdS( iÿÿÿÿN(t deprecatedt Deprecatedt overriddentParserIcBsÎeZdZd„Zd„Zed„Zd„Zd„Zd„Z ed„Z d„Z d „Z e d ƒd „ƒZe d ƒd „ƒZe dƒd„ƒZe dƒd„ƒZe dƒd„ƒZRS(s” A processing class for deriving trees that represent possible structures for a sequence of tokens. These tree structures are known as X{parses}. Typically, parsers are used to derive syntax trees for sentences. But parsers can also be used to derive other kinds of tree structure, such as morphological trees and discourse structures. Subclasses must define: - at least one of: L{parse()}, L{nbest_parse()}, L{iter_parse()}, L{batch_parse()}, L{batch_nbest_parse()}, L{batch_iter_parse()}. Subclasses may define: - L{grammar()} - either L{prob_parse()} or L{batch_prob_parse()} (or both) cCs tƒ‚dS(s; @return: The grammar used by this parser. N(tNotImplementedError(tself((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pytgrammarscCsUt|iƒo|i|gƒdSn*|i|dƒ}|o |dSndSdS(sF @return: A parse tree that represents the structure of the given sentence, or C{None} if no parse tree is found. If multiple parses are found, then return the best parse. @param sent: The sentence to be parsed @type sent: L{list} of L{string} @rtype: L{Tree} iiN(Rt batch_parset nbest_parsetNone(Rtsentttrees((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pytparse%s cCs—t|iƒo|i|g|ƒdSnit|iƒpt|iƒo)|i|ƒ}|o |gSq“gSn tti|i|ƒ|ƒƒSdS(sû @return: A list of parse trees that represent possible structures for the given sentence. When possible, this list is sorted from most likely to least likely. If C{n} is specified, then the returned list will contain at most C{n} parse trees. @param sent: The sentence to be parsed @type sent: L{list} of L{string} @param n: The maximum number of trees to return. @type n: C{int} @rtype: C{list} of L{Tree} iN(Rtbatch_nbest_parseR Rtlistt itertoolstislicet iter_parse(RR tnttree((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyR6s cCsÁt|iƒo|i|gƒdSn–t|iƒpt|iƒot|i|ƒƒSn_t|iƒpt|iƒo5|i|ƒ}|ot|gƒSq½tgƒSn tƒ‚dS(sZ @return: An iterator that generates parse trees that represent possible structures for the given sentence. When possible, this list is sorted from most likely to least likely. @param sent: The sentence to be parsed @type sent: L{list} of L{string} @rtype: C{iterator} of L{Tree} iN(Rtbatch_iter_parseRR titerR RR(RR R((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyRMs   cCs2t|iƒo|i|gƒdSnt‚dS(sš @return: A probability distribution over the possible parse trees for the given sentence. If there are no possible parse trees for the given sentence, return a probability distribution that assigns a probability of 1.0 to C{None}. @param sent: The sentence to be parsed @type sent: L{list} of L{string} @rtype: L{ProbDistI} of L{Tree} iN(Rtbatch_prob_parseR(RR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyt prob_parsebs cCs(g}|D]}||i|ƒq ~S(s¬ Apply L{self.parse()} to each element of C{sents}. I.e.: >>> return [self.parse(sent) for sent in sents] @rtype: C{list} of L{Tree} (R (Rtsentst_[1]R ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyRrscCs+g}|D]}||i||ƒq ~S(sÆ Apply L{self.nbest_parse()} to each element of C{sents}. I.e.: >>> return [self.nbest_parse(sent, n) for sent in sents] @rtype: C{list} of C{list} of L{Tree} (R(RRRRR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyR |scCs(g}|D]}||i|ƒq ~S(sÅ Apply L{self.iter_parse()} to each element of C{sents}. I.e.: >>> return [self.iter_parse(sent) for sent in sents] @rtype: C{list} of C{iterator} of L{Tree} (R(RRRR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyR†scCs(g}|D]}||i|ƒq ~S(sÆ Apply L{self.prob_parse()} to each element of C{sents}. I.e.: >>> return [self.prob_parse(sent) for sent in sents] @rtype: C{list} of L{ProbDistI} of L{Tree} (R(RRRR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyRssUse parse() instead.cCs |i|ƒS(N(R (RR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyt get_parsessUse nbest_parse() instead.cCs |i|ƒS(N(R(RR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pytget_parse_list ssUse prob_parse() instead.cCs |i|ƒS(N(R(RR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pytget_parse_prob£scCs |i|ƒS(N(R(RR ((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pytget_parse_dict¦ssNo longer supported.cCs”t|ƒ}x|D]y}|iƒ}|pqn|idƒo |GHqndG|GH|i|ƒ}dt|ƒGHx|D] }|GHq}WqWdS(Nt#s Sentence:s %d parses.(topentstript startswithRtlen(RtfilenametftlinetparsesR((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyt batch_test©s   (t__name__t __module__t__doc__RR R RRRRR RRRRRRRR'(((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyRs      tParseIcBseZdZRS(sUse ParserI instead.(R(R)R*(((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyR+»stAbstractParsercBs#eZdZedƒd„ƒZRS(sUse ParserI instead.s5Use nltk.ContextFreeGrammar.check_coverage() instead.cCs|ii|ƒdS(N(t_grammartcheck_coverage(Rttokens((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyt_check_coverage¿s(R(R)R*RR0(((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pyR,½s( Rtnltk.internalsRRRtobjectRR+R,(((s$/p/zhu/06/nlp/nltk/nltk/parse/api.pys s ­