Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Matcher improvements #58

Open
dominikmn opened this issue Nov 22, 2021 · 1 comment
Open

Matcher improvements #58

dominikmn opened this issue Nov 22, 2021 · 1 comment
Assignees

Comments

@dominikmn
Copy link
Collaborator

dominikmn commented Nov 22, 2021

Ich denke, wir können die Methode find_relevant_ids() entfernen:
Die Methode wird nirgendswo eingesetzt. Das Matching per get_match_for_locations() läuft ohne sie durch.

dominikmn added a commit that referenced this issue Nov 22, 2021
The method `find_relevant_ids()` can be deleted:
* The method `find_relevant_ids()` is not referenced anymore by any file
in the repository.
* In addition, the method faces an Error when executed as it calls the
unknown method `get_ids_by_part()`.
* Most imporant, the method `get_match_for_locations()` does run successfully without
`find_relevant_ids()`.
@pmayd
Copy link
Collaborator

pmayd commented Nov 22, 2021

weg damit wenn es nicht gebraucht wird ;)

@dominikmn dominikmn self-assigned this Nov 22, 2021
dominikmn added a commit that referenced this issue Nov 23, 2021
The method `find_relevant_ids()` can be deleted:
* The method `find_relevant_ids()` is not referenced anymore by any file
in the repository.
* In addition, the method faces an Error when executed as it calls the
unknown method `get_ids_by_part()`.
* Most imporant, the method `get_match_for_locations()` does run successfully without
`find_relevant_ids()`.
@dominikmn dominikmn changed the title Small improvements for Matcher Matcher improvements Nov 25, 2021
dominikmn added a commit that referenced this issue Nov 25, 2021
* `find_parts_for_location()` refactoring of case `if len(parts) > 1:`
  The matched cases are from now on guaranteed to be looped exactly
  once.
* `get_best_candidates()` changed output signature.
  now:    list[str]
  before: list[tuple[str, int]]
* `find_relevant_ids()` delete this unnecessary method
* `get_loc_names()`Cosmetic improvement
dominikmn added a commit that referenced this issue Nov 25, 2021
Introduce the difflib.difflib.get_close_matches() as an
alternative to lC.search()

Introduce same control-flags for switching on/off
* Levenshtein vs difflib
* max_cost of levenshtein
* phonetic-usage
* Kreis-usage
dominikmn added a commit that referenced this issue Nov 25, 2021
Introduce parameters
* num_parts
* distortion_factor
dominikmn added a commit that referenced this issue Nov 25, 2021
Updated the notebooks according to the changes in
synthetic.py
matcher.py
linguistic.py
dominikmn added a commit that referenced this issue Nov 25, 2021
dominikmn added a commit that referenced this issue Jan 23, 2022
* `find_parts_for_location()` refactoring of case `if len(parts) > 1:`
  The matched cases are from now on guaranteed to be looped exactly
  once.
* `get_best_candidates()` changed output signature.
  now:    list[str]
  before: list[tuple[str, int]]
* `find_relevant_ids()` delete this unnecessary method
* `get_loc_names()`Cosmetic improvement
dominikmn added a commit that referenced this issue Jan 23, 2022
Introduce the difflib.difflib.get_close_matches() as an
alternative to lC.search()

Introduce same control-flags for switching on/off
* Levenshtein vs difflib
* max_cost of levenshtein
* phonetic-usage
* Kreis-usage
dominikmn added a commit that referenced this issue Jan 23, 2022
Introduce parameters
* num_parts
* distortion_factor
dominikmn added a commit that referenced this issue Jan 23, 2022
Updated the notebooks according to the changes in
synthetic.py
matcher.py
linguistic.py
dominikmn added a commit that referenced this issue Jan 23, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants