svn commit: r1349863 - /lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/fst/FST.java

[jp...@apache.org]

Author: jpountz
Date: Wed Jun 13 14:08:48 2012
New Revision: 1349863

URL: http://svn.apache.org/viewvc?rev=1349863&view=rev
Log:
FST.pack: Add a link to Dawid's paper (merged from r1349837).

Modified:
    lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/fst/FST.java

Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/fst/FST.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/fst/FST.java?rev=1349863&r1=1349862&r2=1349863&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/fst/FST.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/fst/FST.java Wed Jun 13 14:08:48 2012
@@ -1428,7 +1428,14 @@ public final class FST<T> {
    *  process requires substantial additional RAM (currently
    *  up to ~8 bytes per node depending on
    *  <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 {
 
     // TODO: other things to try