Apache
/
lucene
mirror of https://github.com/apache/lucene.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

FST.pack: Add a link to Dawid's paper. 

git-svn-id: https://svn.apache.org/repos/asf/lucene/dev/trunk@1349837 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Adrien Grand 2012-06-13 13:35:58 +00:00
parent fb8be86ec8
commit a71c3e7147
1 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lucene/core/src/java/org/apache/lucene/util/fst/FST.java
View File

@ -1428,7 +1428,14 @@ public final class FST<T> {
* process requires substantial additional RAM (currently * process requires substantial additional RAM (currently
* up to ~8 bytes per node depending on * up to ~8 bytes per node depending on
* <code>acceptableOverheadRatio</code>), but then should * <code>acceptableOverheadRatio</code>), but then should
* produce a smaller FST. */ * produce a smaller FST.
*
* <p>The implementation of this method uses ideas from
* <a target="_blank" href="http://www.cs.put.poznan.pl/dweiss/site/publications/download/fsacomp.pdf">Smaller Representation of Finite State Automata</a>,
* which describes techniques to reduce the size of a FST.
* However, this is not a strict implementation of the
* algorithms described in this paper.
*/
public FST<T> pack(int minInCountDeref, int maxDerefNodes, float acceptableOverheadRatio) throws IOException { public FST<T> pack(int minInCountDeref, int maxDerefNodes, float acceptableOverheadRatio) throws IOException {
// TODO: other things to try // TODO: other things to try