Spelling bee judge

Judge the attempts of a school spelling bee against the word that was given.

Every contestant spelled the same word. Compare each attempt with word letter by letter, ignoring upper/lower case, and give one verdict per attempt:

• If the attempt does not have exactly the same number of letters as word, the verdict is "OUT".
• Otherwise count the slips: the positions where the attempt's letter differs from the word's letter.
• No slips: "PERFECT".
• At least one slip, at most slips slips in total, and no two slips in neighbouring positions: "PASS" (the judges forgive scattered mistakes, but not stumbling over two letters in a row).
• Anything else: "OUT".

Input: word, a string; attempts, a list of strings; slips, the number of slips the judges forgive.

Output: a list of verdict strings, one per attempt, in the same order. If there are no attempts, return [].