         start = isWordStart(i, subject, subject_lw)
 
         # Forward search for a sequence of consecutive char
-        csc_score = if csc_diag > 0  then csc_diag else scoreConsecutives(subject, subject_lw, query, query_lw, i,
-          j, start)
+        csc_score = if csc_diag > 0  then csc_diag else
+          scoreConsecutives(subject, subject_lw, query, query_lw, i, j, start)
 
         # Determine bonus for matching A[i] with B[j]
         align = score_diag + scoreCharacter(i, j, start, acro_score, csc_score)

  #Acronym are scored as start of word, but not full word
  score = scorePattern(count, n, sameCase, true, false) # wordStart = true, wordEnd = false

  return new AcronymResult(score, pos / count, count+sepCount)


#----------------------------------------------------------------------


    qj_lw = query_lw[j]

    # Separator get no acronym points, but will not break the acronym prefix sequence either.
    # Only need to test once per character.
    if isSeparator(qj_lw)
      i = subject_lw.indexOf(qj_lw, i + 1)
      if i > -1
        sepCount++
        continue
      else
        break


    while ++i < m

      #test if subject match
