search

bmeaut / python_nlp_2018_spring

MIT License
8 stars 10 forks source link

Task 1 . Levenshtein Distance #4

Open KelbakianiIrakli opened 6 years ago

KelbakianiIrakli commented 6 years ago

Dear All, I got confused with Task 1 : "Two letters are considered close to each other if both their row and column distance is at most 1. Close keys are at distance 0.5, others are at distance 1." My question is what is distance between Q and T, is it 2 or everything which is far than 'close' is 1,so should the distance between these two letters be 1 then? I thought till this time that it should be the sum of close distances because also in the table example above this specific was not shown.

juditacs commented 6 years ago

Keys next to each other are at distance 0.5, every others at distance 1, so distance(Q, T) is 1.

KelbakianiIrakli commented 6 years ago

ok, thank you.