Finding the most 'unique' word Using you language of choice, write the shortest function/script/program you can that will identify the word with the highest number of unique letters in a text. 


Unique letters should include any distinct character using UTF-8 encoding. 


Upper and lower case versions of the same character are different and distinct; 'a' != 'A'

Words are bound by any whitespace character.
'Letters' are any symbol which can be represented by a single unicode character.
The text document must be read in by your code -- no preloading/hard-coding of the text allowed.
The output should be the word, followed by the count of unique letters.


llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch - 18
Any delimiter/spacing between the two values is up to you, so long as there is at least one character to separate them.

In the event more than one word exists with the highest count, print all words for that count, with one new line delimiting.

superacknowledgement - 16
pseudolamellibranchiate - 16
This is code golf, so shortest code wins.


This answer on English.SE inspired me to create this challenge. The example uses just a word list, but any text should be able to be processed.
APL (56)

{⎕ML←3⋄⊃{⍵,⍴∪⍵}¨W[⍙]⍴⍨↑+/∆∘.=∆←∆[⍙←⍒∆←↑∘⍴∘∪¨W←⍵⊂⍨⍵≠' ']}


This is a function (question says that's allowed) that takes a string and returns a matrix of words and unique lengths.

Usage:

      {⎕ML←3⋄⊃{⍵,⍴∪⍵}¨W[⍙]⍴⍨↑+/∆∘.=∆←∆[⍙←⍒∆←↑∘⍴∘∪¨W←⍵⊂⍨⍵≠' ']}'The quick brown fox jumps over the lazy dog.'
quick 5
brown 5
jumps 5


Explanation:


⎕ML←3: set migration level to 3 (so that ⊂ is partition instead of enclose)
W←⍵⊂⍨⍵≠' ': store in W the given string, where each partition consists of non-whitespace characters.
⍙←⍒∆←↑∘⍴∘∪¨W: get the amount (⍴) of unique (∪) elements in each part (¨) of W, and store these in ∆, then get the sort order when sorted downwards on this (⍒) and store that in ⍙.
∆[⍙...]: sort ∆ by ⍙, so now we have the unique lengths in order.
∆∘.=∆←∆: store the sorted ∆ back in ∆, and see which elements of ∆ are equal.
↑+/: sum the rows (now we know how many elements are equal to each element) and then take the first item (now we know how many elements are equal to the first element, i.e. how many of the words are tied for first place.)
W[⍙]⍴⍨: sort W by ⍙, and take the first N, where N is the number we just calculated.
{⍵,⍴∪⍵}¨: for each of these, get the word itself and the amount of unique characters in the word
⊃: format as matrix