search

ramtinms / ws4j

Automatically exported from code.google.com/p/ws4j
1 stars 0 forks source link

While using LIN and two words are the same, the relatedness is extremely high. #3

Open GoogleCodeExporter opened 8 years ago

GoogleCodeExporter commented 8 years ago 
What steps will reproduce the problem?
1. Use LIN as the relatedness calculator
2. Calculate the relatedness of one word and a copy of it.
3. Get extremely high result (not [0,1])

What is the expected output? What do you see instead?
The maximum of output should be one for the relatedness calculator LIN.

What version of the product are you using? On what operating system?
1.0.0 SNAPSHOT, OSX

Please provide any additional information below.

Original issue reported on code.google.com by andy.ta...@gmail.com on 6 Nov 2012 at 1:09

GoogleCodeExporter commented 8 years ago 
[deleted comment]
GoogleCodeExporter commented 8 years ago 
Hi,
I have exactly the same problem with ws4j-1.0.1. With the jar file, I obtain 
infinity for the relatedness of two identical words.
Can somebody tell why such result ? and how I can solve that issue ?
Thanks.

Regards.

Original comment by v.er...@gmail.com on 29 Jul 2013 at 6:04