histausse/anagrams
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

allow quert time resolution of wildcard

Browse source
This commit is contained in:
Jean-Marie Mineau 2023-02-24 20:32:40 +01:00 • committed by Jean-Marie Mineau
parent 894b0be052
commit 323e77b4e4
2 changed files with 67 additions and 15 deletions
Download patch file Download diff file Expand all files Collapse all files

8
web_gui/index.html
View file

@ -88,14 +88,10 @@
<body>
<div id="main_div">
<p> Load <a href="./dict.dat">dict.dat</a> before starting </p>
<p> Wildcards are implemented but increase a lot the precomputing complexity</p>
<p> The precomputation time has a complexity if \(\mathcal{O}(\sum_{i=0}^W \binom{S}{i} . n)\) where \(S\) is the maximum size of the words, \(W\) the maximum number of wild card, and \(n\) the size of the dictionary. For \(S = 15\) and \(W = 3\), this is more or less \(500 . n\)</p>
<p> The precomputation has a time and space complexity of \(\mathcal{O}(\sum_{i=0}^W \binom{S}{i} . n)\) where \(S\) is the maximum size of the words, \(W\) the maximum number of precomputed wildcards per word, and \(n\) the size of the dictionary. For \(S = 15\) and \(W = 3\), this is more or less \(500 . n\), 2 precomputed wildcards is a good default setting.</p>
<p> The query has a time complexity of \(\mathcal{O}(|S|^{max(0, W'-W)})\) where \(W'\) is the number of wildcards in the query. </p>
<p> The wildcard caracter is '?'</p>
<p> Sources in rust are available <a href="./lib.rs">here</a> </p>
<h3> TODO: </h3>
<ul>
<li> Allow query-time resolution of wild cards when there are more wildcards than the number of precomputed wild cards</li>
</ul>
<div id="upload_dict_div">
<label id="upload_dict_label" for="upload_dict">Select the dictionary</label>
<input type="file" id="upload_dict" style="opacity:0">