The algorithm takes an ambiguous word w as input, and outputs its corresponding similarity-based pseudoword P w whose i th pseudosense models the i th sense of w, together with a confidence score which we detail below.
given a pseudoword p and an untagged corpus C, this artificial tagging is achieved by substituting all occurrences of w i in C with p for each pseudosense i ∈ {1, .