Rule-based French Lemmatizer (#2818)
<!--- Provide a general summary of your changes in the title. -->
## Description
<!--- Use this section to describe your changes. If your changes required
testing, include information about the testing environment and the tests you
ran. If your test fixes a bug reported in an issue, don't forget to include the
issue number. If your PR is still a work in progress, that's totally fine – just
include a note to let us know. -->
Add a rule-based French Lemmatizer following the english one and the excellent PR for [greek language optimizations](https://github.com/explosion/spaCy/pull/2558) to adapt the Lemmatizer class.
### Types of change
<!-- What type of change does your PR cover? Is it a bug fix, an enhancement
or new feature, or a change to the documentation? -->
- Lemma dictionary used can be found [here](http://infolingu.univ-mlv.fr/DonneesLinguistiques/Dictionnaires/telechargement.html), I used the XML version.
- Add several files containing exhaustive list of words for each part of speech
- Add some lemma rules
- Add POS that are not checked in the standard Lemmatizer, i.e PRON, DET, ADV and AUX
- Modify the Lemmatizer class to check in lookup table as a last resort if POS not mentionned
- Modify the lemmatize function to check in lookup table as a last resort
- Init files are updated so the model can support all the functionalities mentioned above
- Add words to tokenizer_exceptions_list.py in respect to regex used in tokenizer_exceptions.py
## Checklist
<!--- Before you submit the PR, go over this checklist and make sure you can
tick off all the boxes. [] -> [x] -->
- [X] I have submitted the spaCy Contributor Agreement.
- [X] I ran the tests, and all new and existing tests passed.
- [X] My changes don't require a change to the documentation, or if they do, I've added all required information.
2018-10-13 17:38:21 +03:00
|
|
|
# coding: utf8
|
|
|
|
from __future__ import unicode_literals
|
|
|
|
|
2019-10-01 22:36:04 +03:00
|
|
|
from ...lemmatizer import Lemmatizer
|
2019-10-01 01:01:27 +03:00
|
|
|
from ...symbols import POS, NOUN, VERB, ADJ, ADV, PRON, DET, AUX, PUNCT, ADP
|
|
|
|
from ...symbols import SCONJ, CCONJ
|
|
|
|
from ...symbols import VerbForm_inf, VerbForm_none, Number_sing, Degree_pos
|
2019-08-22 15:21:32 +03:00
|
|
|
|
|
|
|
|
2019-10-01 22:36:04 +03:00
|
|
|
class FrenchLemmatizer(Lemmatizer):
|
2019-08-22 15:21:32 +03:00
|
|
|
"""
|
|
|
|
French language lemmatizer applies the default rule based lemmatization
|
|
|
|
procedure with some modifications for better French language support.
|
|
|
|
|
|
|
|
The parts of speech 'ADV', 'PRON', 'DET', 'ADP' and 'AUX' are added to use
|
|
|
|
the rule-based lemmatization. As a last resort, the lemmatizer checks in
|
|
|
|
the lookup table.
|
|
|
|
"""
|
|
|
|
|
|
|
|
def __call__(self, string, univ_pos, morphology=None):
|
2019-10-01 22:36:04 +03:00
|
|
|
lookup_table = self.lookups.get_table("lemma_lookup", {})
|
|
|
|
if "lemma_rules" not in self.lookups:
|
|
|
|
return [lookup_table.get(string, string)]
|
2019-08-22 15:21:32 +03:00
|
|
|
if univ_pos in (NOUN, "NOUN", "noun"):
|
|
|
|
univ_pos = "noun"
|
|
|
|
elif univ_pos in (VERB, "VERB", "verb"):
|
|
|
|
univ_pos = "verb"
|
|
|
|
elif univ_pos in (ADJ, "ADJ", "adj"):
|
|
|
|
univ_pos = "adj"
|
|
|
|
elif univ_pos in (ADP, "ADP", "adp"):
|
|
|
|
univ_pos = "adp"
|
|
|
|
elif univ_pos in (ADV, "ADV", "adv"):
|
|
|
|
univ_pos = "adv"
|
|
|
|
elif univ_pos in (AUX, "AUX", "aux"):
|
|
|
|
univ_pos = "aux"
|
|
|
|
elif univ_pos in (CCONJ, "CCONJ", "cconj"):
|
|
|
|
univ_pos = "cconj"
|
|
|
|
elif univ_pos in (DET, "DET", "det"):
|
|
|
|
univ_pos = "det"
|
|
|
|
elif univ_pos in (PRON, "PRON", "pron"):
|
|
|
|
univ_pos = "pron"
|
|
|
|
elif univ_pos in (PUNCT, "PUNCT", "punct"):
|
|
|
|
univ_pos = "punct"
|
|
|
|
elif univ_pos in (SCONJ, "SCONJ", "sconj"):
|
|
|
|
univ_pos = "sconj"
|
|
|
|
else:
|
2019-09-15 23:08:13 +03:00
|
|
|
return [self.lookup(string)]
|
2019-10-01 22:36:04 +03:00
|
|
|
index_table = self.lookups.get_table("lemma_index", {})
|
|
|
|
exc_table = self.lookups.get_table("lemma_exc", {})
|
|
|
|
rules_table = self.lookups.get_table("lemma_rules", {})
|
|
|
|
lemmas = self.lemmatize(
|
2019-08-22 15:21:32 +03:00
|
|
|
string,
|
2019-10-01 22:36:04 +03:00
|
|
|
index_table.get(univ_pos, {}),
|
|
|
|
exc_table.get(univ_pos, {}),
|
|
|
|
rules_table.get(univ_pos, []),
|
2019-08-22 15:21:32 +03:00
|
|
|
)
|
|
|
|
return lemmas
|
|
|
|
|
|
|
|
def noun(self, string, morphology=None):
|
|
|
|
return self(string, "noun", morphology)
|
|
|
|
|
|
|
|
def verb(self, string, morphology=None):
|
|
|
|
return self(string, "verb", morphology)
|
|
|
|
|
|
|
|
def adj(self, string, morphology=None):
|
|
|
|
return self(string, "adj", morphology)
|
|
|
|
|
|
|
|
def punct(self, string, morphology=None):
|
|
|
|
return self(string, "punct", morphology)
|
|
|
|
|
2019-09-15 23:08:13 +03:00
|
|
|
def lookup(self, string, orth=None):
|
2019-10-01 22:36:04 +03:00
|
|
|
lookup_table = self.lookups.get_table("lemma_lookup", {})
|
|
|
|
if orth is not None and orth in lookup_table:
|
|
|
|
return lookup_table[orth][0]
|
2019-08-22 15:21:32 +03:00
|
|
|
return string
|
|
|
|
|
2019-10-01 22:36:04 +03:00
|
|
|
def lemmatize(self, string, index, exceptions, rules):
|
|
|
|
lookup_table = self.lookups.get_table("lemma_lookup", {})
|
|
|
|
string = string.lower()
|
|
|
|
forms = []
|
|
|
|
if string in index:
|
|
|
|
forms.append(string)
|
|
|
|
return forms
|
|
|
|
forms.extend(exceptions.get(string, []))
|
|
|
|
oov_forms = []
|
|
|
|
if not forms:
|
|
|
|
for old, new in rules:
|
|
|
|
if string.endswith(old):
|
|
|
|
form = string[: len(string) - len(old)] + new
|
|
|
|
if not form:
|
|
|
|
pass
|
|
|
|
elif form in index or not form.isalpha():
|
|
|
|
forms.append(form)
|
|
|
|
else:
|
|
|
|
oov_forms.append(form)
|
|
|
|
if not forms:
|
|
|
|
forms.extend(oov_forms)
|
|
|
|
if not forms and string in lookup_table.keys():
|
|
|
|
forms.append(lookup_table[string][0])
|
|
|
|
if not forms:
|
|
|
|
forms.append(string)
|
|
|
|
return list(set(forms))
|