Creates a spring-based graph of word similarity. The target distance between each pair of words is determined by the Levenshtein distance, defined as the number of letter changes necessary to transform one word into another.
home.