Find "longest" Italian word!

longestitword.jl

using DelimitedFiles, Base.Iterators

alphabet = 'A':'Z'
n = length(alphabet)
alphabetdict = Dict(alphabet .=> 1:n)

function parsepair(str::String)
	clean = strip(str, [' ', '|'])
	l, r = only.(split(clean, ""))
	
	return (l, r)
end

function parsedistance(str::String)
	clean = strip(str, [' ', 'm'])
	
	return parse(Float64, clean)
end

function rawtograph(rawinput::Matrix{String})
	edges = map(parsepair, rawinput[:, 1])
	distances = map(parsedistance, rawinput[:, 2])
	
	D = zeros(n, n)
	
	for (edge, Δ) in zip(edges, distances)
		src, dst = edge
		l, r = alphabetdict[src], alphabetdict[dst]
		
		D[l, r] = D[r, l] = Δ
	end

	return D
end

function findworddistance(word, D)
	chars = only.(uppercase.(split(word, "")))
	locations = (alphabetdict[char] for char in chars)
		
	src, path = Iterators.peel(locations)
	distance = 0.
	
	for dst in path
		distance += D[src, dst]
		
		src = dst
	end
	
	return distance
	
end

begin # Find maximum italian word

    distanceurl = "http://pi-ratebay.com/files/all_keyboard_distances.txt"

    itwordsurl = "https://raw.githubusercontent.com/napolux/paroleitaliane/master/paroleitaliane/280000_parole_italiane.txt"

    rawinput = readdlm(download(distanceurl), '=', String)
    D = rawtograph(rawinput)

	distances = Dict()
	itwords = readdlm(download(itwordsurl), String)
	
	for word in itwords
		distance = findworddistance(word, D)
		distances[word] = distance
	end

    distances = sort(collect(distances), by=x -> x[2])
end