thefuzz VS fzf

probbaly can use https://github.com/seatgeek/thefuzz

Check out https://github.com/seatgeek/thefuzz. It basically provides different methods that take two strings and return a score between 0 and 100 indicating how similar they are. For instance,

Consider something like Levenshtein distance and one of it's implementations like thefuzz.

The problem you are solving is most commonly called “fuzzy string matching”. There are a bunch of algorithms for it (some of which are described in this thread) depending on your specific requirements. I’d start with an existing fuzzy string matching library (e.g. thefuzz, for python) and calculate matches between your input letter cases and your list of names. This sounds pretty reasonable to do fast since fuzzy string matching is commonly used in text editors to make it easier to find files. If you start with a fuzzy string matching library, I wouldn’t worry about asymptomatic complexity until you actually see a performance problem.

You probably want a package that can do fuzzy matching. The first search result for me turned up this: https://github.com/seatgeek/thefuzz

Having said that, you can use the Levenshtein distance to compute how many "edits" (substitutions, deletions, insertions) the generated summary is away from the original abstract. The package TheFuzz implements this concept in Python. For example fuzz.ratio(text1, text2) will give you a similarity score.

fuzzywuzzy is actually just called the thefuzz now.

It sounds like what you're looking for is "fuzzy string matching," which is not just checking if a string matches another exactly, but defining a way to measure "how close" a string is to another. Luckily, it looks like there's a good Python library for that already: https://github.com/seatgeek/thefuzz

Finally, even though Tesseract's output is usually very nice, it can sometime make a mistake. Again, this is case-specific, and if you're extracting for example numbers, it will be very hard to check for errors, but since I'm extracting names, I'm capable of fuzzy comparing the names detected by Slavic NER to a database of names that I have. I do this fuzzy matching with thefuzz library, and in cases I find a very high match with one of the names in my database, I simply fix the error by taking the name from there.

In addition, I think bash's `operate-and-get-next` can be very helpful. When you go back through your shell history, you can hit Ctrl+o instead of enter and it will execute the command then put the next one in your history on the command line, and keep track of where you are in your history. This way, you can rerun a bunch of commands by going to the first one and Ctrl+o till you are done. And you can edit those commands and hit Ctrl+o and still go to the next previously run command.

Note: fzf's history search feature breaks this. https://github.com/junegunn/fzf/issues/2399

fzf : https://github.com/junegunn/fzf

Those are the most used aliases in my gitconfig.

"git fza" shows a list of modified/new files in an fzf window, and you can select each file with tab plus arrow keys. When you hit enter, those files are fed into "git add". Needs fzf: https://github.com/junegunn/fzf

"git gone" removes local branches that don't exist on the remote.

"git root" prints out the root of the repo. You can alias it to "cd $(git root)", and zip back to the repo root from a deep directory structure. This one is less useful now for me since I started using zoxide to jump around. https://github.com/ajeetdsouza/zoxide

> my history is so noisy I had to find another way

The fzf search syntax can help, if you become familiar with it. It is also supported in atuin [2].

[1]: https://github.com/junegunn/fzf#search-syntax

[2]: https://docs.atuin.sh/configuration/config/#fuzzy-search-syn...

You call it with `n` and get an interactive fuzzy search for your directories. If you do `n ` instead, it’ll start the find with `` already filled in (and if there’s only one match, jump to it directly). The `ls` is optional but I find that I like having the contents visible as soon as I change a directory.

I’m also including iCloud Drive but excluding the Library directory as that is too noisy. I have a separate `nl` function which searches just inside `~/Library` for when I need it, as well as other specialised `n` functions that search inside specific places that I need a lot.

¹ https://github.com/sharkdp/fd

² https://github.com/junegunn/fzf

View on GitHub

I do find the history pager stuff interesting, but ultimately not of tremendous use for me. I rebound all my history search stuff to use fzf[1] (via a fish plugin for such[2]), and so haven't been aware of the issues

[1] https://github.com/junegunn/fzf

[2] https://github.com/PatrickF1/fzf.fish

You can also use fzf with ripgrep to great effect:

[1]: https://github.com/junegunn/fzf/blob/master/ADVANCED.md#usin...