anchor.diff:                          (mapcar (lambda (p) (list (string-downcase (first p)) (second p))) pairs)
                           pairs))
                (pairs (keep-exact-matches-in-candidates input pairs))
  -             ;; (pairs (sort-exact-matches-in-candidates input pairs)) ; TODO: Is this useful when we have the exact-match-norm?
                (pairs (sort-candidates input pairs)))
  -        (log:debug "~a" (mapcar (lambda (c) (list (first c)
  -                                                  (score-candidate (to-unicode input) (first c))))
  +        (log:debug "~a"
  +                   (mapcar (lambda (c)
  +                             (list (first c)
  +                                   (score-candidate (to-unicode input) (first c))))
                                   pairs))
           (mapcar #'second pairs))
         candidates))
  
positive.code:                                                       (search substring candidate))
                                                      exactly-matching-substrings)))))
            (/ (apply #'+ positions)
                    (* (length positions) (length candidate))))
          0)))
  
  (defun to-unicode (input)
  
negative.code:                          candidate-pairs))
          candidate-pairs)))
  
  @export
  (defun fuzzy-match (input candidates)   ; TODO: Make score functions customizable, e.g. for global history.
    "From the user input and a list of candidates, return a filtered list of
  