diff options
| author | Robert Haas | 2012-04-24 02:43:09 +0000 |
|---|---|---|
| committer | Robert Haas | 2012-04-24 02:43:09 +0000 |
| commit | 5d4b60f2f25bedee257aaf6f2f4ac77028629b87 (patch) | |
| tree | f0f7fa40b63a23b10e9d03ea47f97020565a66f6 /contrib/fuzzystrmatch | |
| parent | 7ab9b2f3b79177e501a1ef90ed004cc68788abaf (diff) | |
Lots of doc corrections.
Josh Kupershmidt
Diffstat (limited to 'contrib/fuzzystrmatch')
| -rw-r--r-- | contrib/fuzzystrmatch/fuzzystrmatch.c | 2 | ||||
| -rw-r--r-- | contrib/fuzzystrmatch/levenshtein.c | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/contrib/fuzzystrmatch/fuzzystrmatch.c b/contrib/fuzzystrmatch/fuzzystrmatch.c index b9c21652100..8a1771b9700 100644 --- a/contrib/fuzzystrmatch/fuzzystrmatch.c +++ b/contrib/fuzzystrmatch/fuzzystrmatch.c @@ -157,7 +157,7 @@ getcode(char c) /* These letters are passed through unchanged */ #define NOCHANGE(c) (getcode(c) & 2) /* FJMNR */ -/* These form dipthongs when preceding H */ +/* These form diphthongs when preceding H */ #define AFFECTH(c) (getcode(c) & 4) /* CGPST */ /* These make C and G soft */ diff --git a/contrib/fuzzystrmatch/levenshtein.c b/contrib/fuzzystrmatch/levenshtein.c index 40035ca78c4..90d4f2169d3 100644 --- a/contrib/fuzzystrmatch/levenshtein.c +++ b/contrib/fuzzystrmatch/levenshtein.c @@ -171,7 +171,7 @@ levenshtein_internal(text *s, text *t, * length. Each additional deletion forces another insertion, so * the best-case total cost increases by ins_c + del_c. If the * string is shrinking, the minimum theoretical cost assumes no - * excess deletions; that is, we're starting no futher right than + * excess deletions; that is, we're starting no further right than * column n - m. If we do start further right, the best-case * total cost increases by ins_c + del_c for each move right. */ |