summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJohn Hawthorn <john.hawthorn@gmail.com>2018-02-11 22:53:15 -0800
committerGitHub <noreply@github.com>2018-02-11 22:53:15 -0800
commit2d82917f530b09fb3914923e7b3f73130e825613 (patch)
treee9cbfc5cf2ed40e354b5ab4a0bfe33e18f60fced
parent41d932531f9ef9b3798f6a3113c314cee51cdd1f (diff)
parentca141d135735a444024a9e32db0e5128370871fe (diff)
Merge pull request #70 from neuschaefer/typo
Fix a few typos
-rw-r--r--ALGORITHM.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/ALGORITHM.md b/ALGORITHM.md
index b307a62..9b759fb 100644
--- a/ALGORITHM.md
+++ b/ALGORITHM.md
@@ -80,7 +80,7 @@ is able to score based on the optimal match.
## TextMate
TextMate deserves immense credit for popularizing fuzzy finding from inside
-text editors. It's influence can be found in the commant-t project, various
+text editors. It's influence can be found in the command-t project, various
other editors use command-t for file finding, and the 't' command in the github
web interface.
@@ -101,7 +101,7 @@ The wy `last_idx` is suspicious.
## Length of shortest first match: fzf
https://github.com/junegunn/fzf/blob/master/src/algo/algo.go
-Fzy scores based on the size of the greedy shortest match. fzf finds it's match
+Fzy scores based on the size of the greedy shortest match. fzf finds its match
by the first match appearing in the candidate string. It has some cleverness to
find if there is a shorter match contained in that search, but it isn't
guaranteed to find the shortest match in the string.
@@ -137,7 +137,7 @@ Example results for the search "abc"
* <tt>x**ABXC**x</tt>
* <tt>x**ABXC**xbc</tt>
-The third result here shoud have been scored the same as the first, but the
+The third result here should have been scored the same as the first, but the
lower scoring but shorter match is what is measured.