MaartenGr / MaartenGr/PolyFuzz
Which mode/method to use that is agnostic to word orders?
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 803
- Forks
- 72
- PR merge metrics
- No merged PRs in 30d
Description
Hi,
Would like to understand which matching algo/model is agnostic to word orders? I realised for instance Levenshtein Distance might be affected by word orders.
Thanks
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no file, test, or entry point; start by reviewing PolyFuzz's available matching algorithms and the existing Levenshtein behavior. Clarify whether the expected outcome is a recommendation or a new word-order-agnostic matcher, then define completion criteria before implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100