class_docstr: An interface for generating lists of transformational rules that
  apply at given sentence positions.  ``BrillTemplateI`` is used by
  ``Brill`` training algorithms to generate candidate rules.
class_docstr_tok: ["An","interface","for","generating","lists","of","transformational","rules","that","apply","at","given","sentence","positions",".","``","BrillTemplateI","``","is","used","by","``","Brill","``","training","algorithms","to","generate","candidate","rules","."]
docstr: Return a list of the transformational rules that would correct
  the ``i``-th subtoken's tag in the given token.  In particular,
  return a list of zero or more rules that would change
  ``tokens[i][1]`` to ``correctTag``, if applied to ``token[i]``.
  
  If the ``i``-th token already has the correct tag (i.e., if
  ``tagged_tokens[i][1] == correctTag``), then
  ``applicable_rules()`` should return the empty list.
  
  :param tokens: The tagged tokens being tagged.
  :type tokens: list(tuple)
  :param i: The index of the token whose tag should be corrected.
  :type i: int
  :param correctTag: The correct tag for the ``i``-th token.
  :type correctTag: any
  :rtype: list(BrillRule)
docstr_tok: ["Return","a","list","of","the","transformational","rules","that","would","correct","the","``","i","``","-th","subtoken","'s","tag","in","the","given","token",".","In","particular",",","return","a","list","of","zero","or","more","rules","that","would","change","``","tokens","[","i","]","[","1","]","``","to","``","correctTag","``",",","if","applied","to","``","token","[","i","]","``",".","If","the","``","i","``","-th","token","already","has","the","correct","tag","(","i.e.",",","if","``","tagged_tokens","[","i","]","[","1","]","==","correctTag","``",")",",","then","``","applicable_rules","(",")","``","should","return","the","empty","list",".",":","param","tokens",":","The","tagged","tokens","being","tagged",".",":","type","tokens",":","list","(","tuple",")",":","param","i",":","The","index","of","the","token","whose","tag","should","be","corrected",".",":","type","i",":","int",":","param","correctTag",":","The","correct","tag","for","the","``","i","``","-th","token",".",":","type","correctTag",":","any",":","rtype",":","list","(","BrillRule",")"]
code: def applicable_rules(self, tokens, i, correctTag):
      """
      Return a list of the transformational rules that would correct
      the ``i``-th subtoken's tag in the given token.  In particular,
      return a list of zero or more rules that would change
      ``tokens[i][1]`` to ``correctTag``, if applied to ``token[i]``.
  
      If the ``i``-th token already has the correct tag (i.e., if
      ``tagged_tokens[i][1] == correctTag``), then
      ``applicable_rules()`` should return the empty list.
  
      :param tokens: The tagged tokens being tagged.
      :type tokens: list(tuple)
      :param i: The index of the token whose tag should be corrected.
      :type i: int
      :param correctTag: The correct tag for the ``i``-th token.
      :type correctTag: any
      :rtype: list(BrillRule)
      """
  
file_path: nltk/nltk/tbl/template.py
imports: import itertools
  from abc import ABCMeta, abstractmethod
  from nltk.tbl.feature import Feature
  from nltk.tbl.rule import Rule
label_desc: Use image node_id 1 for calling the BrillTemplateI obj's underlying member method code with example usage: obj.applicable_rules(tokens, i, correctTag) without return types