summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJonathan Neuschäfer <j.neuschaefer@gmx.net>2017-09-23 06:15:08 +0200
committerJonathan Neuschäfer <j.neuschaefer@gmx.net>2018-01-24 15:26:40 +0100
commitca141d135735a444024a9e32db0e5128370871fe (patch)
tree6c577f54ae331860aa627b9730ee8d07ea7f40d8
parent919bae54f53817043f1285034257e05f4a3e2b74 (diff)
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.