def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") in (PENN, None):
kwargs.setdefault("map", lambda token, tag: (token, tag))
if kwargs.get("tagset") == UNIVERSAL:
kwargs.setdefault(
"map", lambda token, tag: penntreebank2universal(token, tag))
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") in (PENN, None):
kwargs.setdefault("map", lambda token, tag: (token, tag))
if kwargs.get("tagset") == UNIVERSAL:
kwargs.setdefault(
"map", lambda token, tag: penntreebank2universal(token, tag))
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
# Parser.find_tags() can take an optional map(token, tag) function,
# which returns an updated (token, tag)-tuple for each token.
kwargs.setdefault("map", parole2penntreebank)
return Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") != STTS:
kwargs.setdefault("map", stts2penntreebank)
# The lexicon uses Swiss spelling: "ss" instead of "ß".
# We restore the "ß" after parsing.
tokens_ss = [t.replace(u"ß", "ss") for t in tokens]
tokens_ss = _Parser.find_tags(self, tokens_ss, **kwargs)
return [[w] + tokens_ss[i][1:] for i, w in enumerate(tokens)]
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") in (PENN, None):
kwargs.setdefault("map", lambda token, tag: stts2penntreebank(token, tag))
if kwargs.get("tagset") == UNIVERSAL:
kwargs.setdefault("map", lambda token, tag: stts2universal(token, tag))
if kwargs.get("tagset") is STTS:
kwargs.setdefault("map", lambda token,tag: (token, tag))
# The lexicon uses Swiss spelling: "ss" instead of "ß".
# We restore the "ß" after parsing.
tokens_ss = [t.replace(u"ß", "ss") for t in tokens]
tokens_ss = _Parser.find_tags(self, tokens_ss, **kwargs)
return [[w] + tokens_ss[i][1:] for i, w in enumerate(tokens)]
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") in (PENN, None):
kwargs.setdefault("map", lambda token, tag: stts2penntreebank(token, tag))
if kwargs.get("tagset") == UNIVERSAL:
kwargs.setdefault("map", lambda token, tag: stts2universal(token, tag))
if kwargs.get("tagset") is STTS:
kwargs.setdefault("map", lambda token,tag: (token, tag))
# The lexicon uses Swiss spelling: "ss" instead of "ß".
# We restore the "ß" after parsing.
tokens_ss = [t.replace(u"ß", "ss") for t in tokens]
tokens_ss = _Parser.find_tags(self, tokens_ss, **kwargs)
return [[w] + tokens_ss[i][1:] for i, w in enumerate(tokens)]
def find_tags(self, tokens, **kwargs):
kwargs.setdefault("map", tagset2penntreebank)
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
kwargs.setdefault("map", tagset2penntreebank)
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") != WOTAN:
kwargs.setdefault("map", wotan2penntreebank)
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") != PAROLE:
kwargs.setdefault("map", parole2penntreebank)
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") != WOTAN:
kwargs.setdefault("map", wotan2penntreebank)
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
if kwargs.get("tagset") != PAROLE:
kwargs.setdefault("map", parole2penntreebank)
return _Parser.find_tags(self, tokens, **kwargs)
def find_tags(self, tokens, **kwargs):
# Parser.find_tags() can take an optional map(token, tag) function,
# which returns an updated (token, tag)-tuple for each token.
kwargs.setdefault("map", parole2penntreebank)
return Parser.find_tags(self, tokens, **kwargs)
