Parsing¶
-
exception
quepy.parsing.BadSemantic¶ Problem with the semantic.
-
class
quepy.parsing.Lemma(tag)¶ Predicate to check if a word has an specific lemma.
-
quepy.parsing.Lemmas(string)¶ Returns a Predicate that catches strings with the lemmas mentioned on string.
-
class
quepy.parsing.Match(match, words, i=None, j=None)¶ Holds the matching of the regex.
-
class
quepy.parsing.Pos(tag)¶ Predicate to check if a word has an specific POS tag.
-
quepy.parsing.Poss(string)¶ Returns a Predicate that catches strings with the POS mentioned on string.
-
class
quepy.parsing.QuestionTemplate¶ Subclass from this to implement a question handler.
-
interpret(match)¶ Returns the intermediate representation of the regex. match is of type quepy.regex.Match and is analogous to a python re match. It contains matched groups in the regular expression.
When implementing a regex one must fill this method.
-
-
class
quepy.parsing.Token(tag)¶ Predicate to check if a word has an specific token.
-
quepy.parsing.Tokens(string)¶ Returns a Predicate that catches strings with the tokens mentioned on string.
-
class
quepy.parsing.WordList(words)¶ A list of words with some utils for the user.