13

social network of word using Levenshtien Distance

view full story
linux-howto

http://ubuntuforums.org – This is a question taken from here Two words are friends if they have a Levenshtein distance of 1 (For details see http://en.wikipedia.org/wiki/Levenshtein_distance). That is, you can add, remove, or substitute exactly one letter in word X to create word Y. A word’s social network consists of all of its friends, plus all of their friends, and all of their friends’ friends, and so on. Write a program to tell us how big the social network for the word 'hello' is, using this word list https://raw.github.com/codeeval/Leve...n_distance.txt Input Your program should accept as its first argu (Hardware)