hello !<div><br></div><div>i would like to use the polymorhpic hash function on strings. But i would like to know what is the probability of a collision between two hashes. </div><div><br></div><div>my first question is about the range of the Hashtbl.hash function: what is its range ? ( string -&gt; [1..N] ?)</div>
<div><br></div><div>the second question is : can i assume that the result is a uniform distribution over [1..N] ? (for 10⁶ words which is an estimation of the english vocabulary size)<br clear="all"><br></div><div>the third one is : is it possible to predict which will be the collision ? I mean collisions are between words which are very &#39;similar&#39; (for ex: &quot;boy&quot; and &quot;boys&quot;) or are completely unpredictable.</div>
<div><br></div><div>thanks !</div><div><br></div><div><br>-- <br>Grégoire Seux<br>
</div>