anchor.diff:      load<string list> "words"
       unaryOp2 (fun (words : string list) -> words |> List.iter push)
   
  +let frequencies () =
  +    store "word_freqs" <| new Dictionary<string, int>()
   
  +    while len() > 0 do
  +        load "word_freqs"
  +        binOp (fun (wordFreqs : Dictionary<string, int>) word ->
  +            if wordFreqs.ContainsKey word
  +            then word, wordFreqs.[word] + 1
  +            else word, 1)
   
  +        load "word_freqs"
  +        binOp (fun (wordFreqs : Dictionary<string, int>) (word, newCount) -> 
  +            wordFreqs.[word] <- newCount
  +            wordFreqs)
   
  -push test
  -readFile()
  -replaceNonAlphanumeric()
  -scan()
  -removeStopWords()
  +        unaryOp2 (store "word_freqs")
  +
  +let sort () =
  +    load "word_freqs"
  +    unaryOp2 (fun (wordFreqs : Dictionary<string, int>) ->
  +        let len = min wordFreqs.Count 25
  +        wordFreqs 
  +        |> Seq.sortByDescending (fun kvp -> kvp.Value)
  +        |> Seq.take len
  +        |> Seq.rev
  +        |> Seq.iter (fun kvp -> push (kvp.Key, kvp.Value)))
  +
  +push ``pride and prejudice``
  +readFile(); replaceNonAlphanumeric(); scan(); removeStopWords(); frequencies(); sort()
  +
  +while len() > 0 do
  +    unaryOp2 (fun (word : string, count : int) -> printfn "%s - %d" word count)
positive.code: ﻿open System
  open System.IO
  open System.Text.RegularExpressions
  
  
negative.code:     while len() > 0 do
          load<Set<string>> "stop_words"
          binOp (fun (stopWords : Set<string>) word -> 
              if stopWords.Contains word |> not && word.Length >= 2
              then Some word
              else None)
  
          load<string list> "words"
          binOp2 (fun (words : string list) word ->
  