15. The method of claim 14 , further including the step of calculating a weighted average expected search distance provided by: c _ k = ∑ n = 1 g ⁢ n ⁡ [ ψ → ] T · [ ( I - Γ → ⁡ ( k ) ⊗ Γ → ⁡ ( k ) ) · R · ( I - Γ → ⁡ ( k ) ⊗ Γ → ⁡ ( k ) ) ] n - 1 · M · Γ → ⁡ ( k ) wherein, {right arrow over (Ψ)} is a column vector representing the commonality of words in the co-occurrence matrix.
14. The method of claim 10 , wherein said step of calculating an expected search distance for the seed word-keyword pair, is provided by: c _ d , k = ∑ n = 1 g ⁢ n ⁡ [ Γ → ⁡ ( d ) ] T · [ ( I - Γ → ⁡ ( k ) ⊗ Γ → ⁡ ( k ) ) · R · ( I - Γ → ⁡ ( k ) ⊗ Γ → ⁡ ( k ) ) ] n - 1 · M · Γ → ⁡ ( k ) wherein, I represents an identity matrix; {right arrow over (Γ)}(d) represents a column vector for selecting values in the transition matrix related to the word, d; {right arrow over (Γ)}(k) represents a column vector for selecting values in the transition matrix related to the word, k; R represents the transition matrix; M represents the probability matrix; and g represents the upper limit of the summation as selected by the user.