Index: graphspell-js/dawg.js
==================================================================
--- graphspell-js/dawg.js
+++ graphspell-js/dawg.js
@@ -361,40 +361,10 @@
             iAddr += Math.max(oNode.arcs.size, 1) * nBytesNode;
         }
     }
 
     _createJSON (nMethod) {
-        /*
-            Format of the binary indexable dictionary:
-            Each section is separated with 4 bytes of \0
-            
-            - Section Header:
-                /pyfsa/[version]
-                    * version is an ASCII string
-            
-            - Section Informations:
-                /[tag_lang]
-                /[number of chars]
-                /[number of bytes for each arc]
-                /[number of bytes for each address node]
-                /[number of entries]
-                /[number of nodes]
-                /[number of arcs]
-                /[number of affixes]
-                    * each field is a ASCII string
-                /[stemming code]
-                    * "S" means stems are generated by /suffix_code/, "A" means they are generated by /affix_code/
-                      See defineSuffixCode() and defineAffixCode() for details.
-                      "N" means no stemming
-            
-            - Section Values:
-                    * a list of strings encoded in binary from utf-8, each value separated with a tabulation
-            
-            - Section Word Graph (nodes / arcs)
-                    * A list of nodes which are a list of arcs with an address of the next node.
-                      See DawgNode.convToBytes() for details.
-        */
         let sByDic = "";
         if (nMethod == 1) {
             sByDic = this.oRoot.convToBytes1(this.nBytesArc, this.nBytesNodeAddress);
             for (let oNode of this.dMinimizedNodes.values()) {
                 sByDic += oNode.convToBytes1(this.nBytesArc, this.nBytesNodeAddress);