Even more duplicate word removal, in the spirit of the season

contrib/fuzzystrmatch/levenshtein.c

@@ -349,8 +349,8 @@ levenshtein_internal(text *s, text *t,
 			 * remaining portions of the strings are of equal length.  There
 			 * are (n - 1) characters in the target string, of which j have
 			 * been transformed.  There are (m - 1) characters in the source
-			 * string, so we want to find the value for zp where where (n - 1)
-			 * - j = (m - 1) - zp.
+			 * string, so we want to find the value for zp where (n - 1) - j =
+			 * (m - 1) - zp.
 			 */
 			int			zp = j - (n - m);
 

contrib/pgcrypto/crypt-md5.c

@@ -34,7 +34,7 @@ char *
 px_crypt_md5(const char *pw, const char *salt, char *passwd, unsigned dstlen)
 {
 	static char *magic = "$1$"; /* This string is magic for this algorithm.
-								 * Having it this way, we can get get better
+								 * Having it this way, we can get better
 								 * later on */
 	static char *p;
 	static const char *sp,

src/backend/tsearch/wparser_def.c

@@ -2508,7 +2508,7 @@ prsd_headline(PG_FUNCTION_ARGS)
 	List	   *prsoptions = (List *) PG_GETARG_POINTER(1);
 	TSQuery		query = PG_GETARG_TSQUERY(2);
 
-	/* from opt + start and and tag */
+	/* from opt + start and end tag */
 	int			min_words = 15;
 	int			max_words = 35;
 	int			shortword = 3;