Add files using upload-large-folder tool

.gitattributes

@@ -65,3 +65,9 @@ cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/CMakeFiles/sente
 cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.so.0 filter=lfs diff=lfs merge=lfs -text
 cc-multilingual-main/cc_net/bin/lmplz filter=lfs diff=lfs merge=lfs -text
 cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece_train.so filter=lfs diff=lfs merge=lfs -text
+cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.a filter=lfs diff=lfs merge=lfs -text
+cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.so filter=lfs diff=lfs merge=lfs -text
+cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece_train.so.0 filter=lfs diff=lfs merge=lfs -text
+cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
+cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece_train.a filter=lfs diff=lfs merge=lfs -text
+cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/CMakeFiles/sentencepiece_train-static.dir/builder.cc.o filter=lfs diff=lfs merge=lfs -text

cc-multilingual-main/cc_net/third_party/kenlm/COPYING.3

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

cc-multilingual-main/cc_net/third_party/kenlm/MANIFEST.in

@@ -0,0 +1,9 @@
+# file GENERATED by distutils, do NOT edit
+include setup.py
+include lm/*.cc
+include lm/*.hh
+include python/*.cpp
+include util/*.cc
+include util/*.hh
+include util/double-conversion/*.cc
+include util/double-conversion/*.h

cc-multilingual-main/cc_net/third_party/kenlm/README.md

@@ -0,0 +1,102 @@
+# kenlm
+
+Language model inference code by Kenneth Heafield (kenlm at kheafield.com)
+
+The website https://kheafield.com/code/kenlm/ has more documentation.  If you're a decoder developer, please download the latest version from there instead of copying from another decoder.
+
+## Compiling
+Use cmake, see [BUILDING](BUILDING) for build dependencies and more detail.
+```bash
+mkdir -p build
+cd build
+cmake ..
+make -j 4
+```
+
+## Compiling with your own build system
+If you want to compile with your own build system (Makefile etc) or to use as a library, there are a number of macros you can set on the g++ command line or in util/have.hh .  
+
+* `KENLM_MAX_ORDER` is the maximum order that can be loaded.  This is done to make state an efficient POD rather than a vector.  
+* `HAVE_ICU` If your code links against ICU, define this to disable the internal StringPiece and replace it with ICU's copy of StringPiece, avoiding naming conflicts.  
+
+ARPA files can be read in compressed format with these options:
+* `HAVE_ZLIB` Supports gzip.  Link with -lz.
+* `HAVE_BZLIB` Supports bzip2.  Link with -lbz2.
+* `HAVE_XZLIB` Supports xz.  Link with -llzma.
+
+Note that these macros impact only `read_compressed.cc` and `read_compressed_test.cc`.  The bjam build system will auto-detect bzip2 and xz support.  
+
+## Estimation
+lmplz estimates unpruned language models with modified Kneser-Ney smoothing.  After compiling with bjam, run
+```bash
+bin/lmplz -o 5 <text >text.arpa
+```
+The algorithm is on-disk, using an amount of memory that you specify.  See https://kheafield.com/code/kenlm/estimation/ for more.
+
+MT Marathon 2012 team members Ivan Pouzyrevsky and Mohammed Mediani contributed to the computation design and early implementation. Jon Clark contributed to the design, clarified points about smoothing, and added logging. 
+
+## Filtering
+
+filter takes an ARPA or count file and removes entries that will never be queried.  The filter criterion can be corpus-level vocabulary, sentence-level vocabulary, or sentence-level phrases.  Run
+```bash
+bin/filter
+```
+and see https://kheafield.com/code/kenlm/filter/ for more documentation.
+
+## Querying
+
+Two data structures are supported: probing and trie.  Probing is a probing hash table with keys that are 64-bit hashes of n-grams and floats as values.  Trie is a fairly standard trie but with bit-level packing so it uses the minimum number of bits to store word indices and pointers.  The trie node entries are sorted by word index.  Probing is the fastest and uses the most memory.  Trie uses the least memory and is a bit slower.
+
+As is the custom in language modeling, all probabilities are log base 10.
+
+With trie, resident memory is 58% of IRST's smallest version and 21% of SRI's compact version.  Simultaneously, trie CPU's use is 81% of IRST's fastest version and 84% of SRI's fast version.  KenLM's probing hash table implementation goes even faster at the expense of using more memory.  See https://kheafield.com/code/kenlm/benchmark/.
+
+Binary format via mmap is supported.  Run `./build_binary` to make one then pass the binary file name to the appropriate Model constructor.   
+
+## Platforms
+`murmur_hash.cc` and `bit_packing.hh` perform unaligned reads and writes that make the code architecture-dependent.  
+It has been sucessfully tested on x86\_64, x86, and PPC64.  
+ARM support is reportedly working, at least on the iphone.   
+
+Runs on Linux, OS X, Cygwin, and MinGW.  
+
+Hideo Okuma and Tomoyuki Yoshimura from NICT contributed ports to ARM and MinGW.  
+
+## Decoder developers
+- I recommend copying the code and distributing it with your decoder.  However, please send improvements upstream.  
+
+- It's possible to compile the query-only code without Boost, but useful things like estimating models require Boost.
+
+- Select the macros you want, listed in the previous section.  
+
+- There are two build systems: compile.sh and cmake.  They're pretty simple and are intended to be reimplemented in your build system.  
+
+- Use either the interface in `lm/model.hh` or `lm/virtual_interface.hh`.  Interface documentation is in comments of `lm/virtual_interface.hh` and `lm/model.hh`.  
+
+- There are several possible data structures in `model.hh`.  Use `RecognizeBinary` in `binary_format.hh` to determine which one a user has provided.  You probably already implement feature functions as an abstract virtual base class with several children.  I suggest you co-opt this existing virtual dispatch by templatizing the language model feature implementation on the KenLM model identified by `RecognizeBinary`.  This is the strategy used in Moses and cdec.
+
+- See `lm/config.hh` for run-time tuning options.
+
+## Contributors
+Contributions to KenLM are welcome.  Please base your contributions on https://github.com/kpu/kenlm and send pull requests (or I might give you commit access).  Downstream copies in Moses and cdec are maintained by overwriting them so do not make changes there.  
+
+## Python module
+Contributed by Victor Chahuneau.
+
+### Installation
+
+```bash
+pip install https://github.com/kpu/kenlm/archive/master.zip
+```
+
+### Basic Usage
+```python
+import kenlm
+model = kenlm.Model('lm/test.arpa')
+print(model.score('this is a sentence .', bos = True, eos = True))
+```
+See [python/example.py](python/example.py) and [python/kenlm.pyx](python/kenlm.pyx) for more, including stateful APIs.  
+
+---
+
+The name was Hieu Hoang's idea, not mine.

cc-multilingual-main/cc_net/third_party/kenlm/build/CMakeCache.txt

@@ -0,0 +1,511 @@
+# This is the CMakeCache file.
+# For build in directory: /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build
+# It was generated by CMake: /usr/bin/cmake
+# You can edit this file to change values found and used by cmake.
+# If you do not want to change any of the values, simply exit the editor.
+# If you do want to change a value, simply edit, save, and exit the editor.
+# The syntax for the file is as follows:
+# KEY:TYPE=VALUE
+# KEY is the name of a variable in the cache.
+# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
+# VALUE is the current value for the KEY.
+
+########################
+# EXTERNAL cache entries
+########################
+
+//Path to a file.
+BZIP2_INCLUDE_DIR:PATH=/usr/include
+
+//Path to a library.
+BZIP2_LIBRARY_DEBUG:FILEPATH=BZIP2_LIBRARY_DEBUG-NOTFOUND
+
+//Path to a library.
+BZIP2_LIBRARY_RELEASE:FILEPATH=/usr/lib/x86_64-linux-gnu/libbz2.so
+
+//The directory containing a CMake configuration file for Boost.
+Boost_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/Boost-1.74.0
+
+//Path to a file.
+Boost_INCLUDE_DIR:PATH=/usr/include
+
+Boost_PROGRAM_OPTIONS_LIBRARY_RELEASE:STRING=/usr/lib/x86_64-linux-gnu/libboost_program_options.so.1.74.0
+
+Boost_SYSTEM_LIBRARY_RELEASE:STRING=/usr/lib/x86_64-linux-gnu/libboost_system.so.1.74.0
+
+Boost_THREAD_LIBRARY_RELEASE:STRING=/usr/lib/x86_64-linux-gnu/libboost_thread.so.1.74.0
+
+Boost_UNIT_TEST_FRAMEWORK_LIBRARY_RELEASE:STRING=/usr/lib/x86_64-linux-gnu/libboost_unit_test_framework.so.1.74.0
+
+//Path to a program.
+CMAKE_ADDR2LINE:FILEPATH=/usr/bin/addr2line
+
+//Path to a program.
+CMAKE_AR:FILEPATH=/usr/bin/ar
+
+//Choose the type of build, options are: None Debug Release RelWithDebInfo
+// MinSizeRel ...
+CMAKE_BUILD_TYPE:STRING=
+
+//Enable/Disable color output during build.
+CMAKE_COLOR_MAKEFILE:BOOL=ON
+
+//CXX compiler
+CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/c++
+
+//A wrapper around 'ar' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_CXX_COMPILER_AR:FILEPATH=/usr/bin/gcc-ar-11
+
+//A wrapper around 'ranlib' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_CXX_COMPILER_RANLIB:FILEPATH=/usr/bin/gcc-ranlib-11
+
+//Flags used by the CXX compiler during all build types.
+CMAKE_CXX_FLAGS:STRING=
+
+//Flags used by the CXX compiler during DEBUG builds.
+CMAKE_CXX_FLAGS_DEBUG:STRING=-g
+
+//Flags used by the CXX compiler during MINSIZEREL builds.
+CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
+
+//Flags used by the CXX compiler during RELEASE builds.
+CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
+
+//Flags used by the CXX compiler during RELWITHDEBINFO builds.
+CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
+
+//C compiler
+CMAKE_C_COMPILER:FILEPATH=/usr/bin/cc
+
+//A wrapper around 'ar' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_C_COMPILER_AR:FILEPATH=/usr/bin/gcc-ar-11
+
+//A wrapper around 'ranlib' adding the appropriate '--plugin' option
+// for the GCC compiler
+CMAKE_C_COMPILER_RANLIB:FILEPATH=/usr/bin/gcc-ranlib-11
+
+//Flags used by the C compiler during all build types.
+CMAKE_C_FLAGS:STRING=
+
+//Flags used by the C compiler during DEBUG builds.
+CMAKE_C_FLAGS_DEBUG:STRING=-g
+
+//Flags used by the C compiler during MINSIZEREL builds.
+CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
+
+//Flags used by the C compiler during RELEASE builds.
+CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
+
+//Flags used by the C compiler during RELWITHDEBINFO builds.
+CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
+
+//Path to a program.
+CMAKE_DLLTOOL:FILEPATH=CMAKE_DLLTOOL-NOTFOUND
+
+//Flags used by the linker during all build types.
+CMAKE_EXE_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during DEBUG builds.
+CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during MINSIZEREL builds.
+CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during RELEASE builds.
+CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during RELWITHDEBINFO builds.
+CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Enable/Disable output of compile commands during generation.
+CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=
+
+//Install path prefix, prepended onto install directories.
+CMAKE_INSTALL_PREFIX:PATH=/usr/local
+
+//Path to a program.
+CMAKE_LINKER:FILEPATH=/usr/bin/ld
+
+//Path to a program.
+CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
+
+//Flags used by the linker during the creation of modules during
+// all build types.
+CMAKE_MODULE_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of modules during
+// DEBUG builds.
+CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of modules during
+// MINSIZEREL builds.
+CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of modules during
+// RELEASE builds.
+CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of modules during
+// RELWITHDEBINFO builds.
+CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_NM:FILEPATH=/usr/bin/nm
+
+//Path to a program.
+CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
+
+//Path to a program.
+CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
+
+//Value Computed by CMake
+CMAKE_PROJECT_DESCRIPTION:STATIC=
+
+//Value Computed by CMake
+CMAKE_PROJECT_HOMEPAGE_URL:STATIC=
+
+//Value Computed by CMake
+CMAKE_PROJECT_NAME:STATIC=kenlm
+
+//Path to a program.
+CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
+
+//Path to a program.
+CMAKE_READELF:FILEPATH=/usr/bin/readelf
+
+//Flags used by the linker during the creation of shared libraries
+// during all build types.
+CMAKE_SHARED_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during DEBUG builds.
+CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during MINSIZEREL builds.
+CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during RELEASE builds.
+CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of shared libraries
+// during RELWITHDEBINFO builds.
+CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//If set, runtime paths are not added when installing shared libraries,
+// but are added when building.
+CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
+
+//If set, runtime paths are not added when using shared libraries.
+CMAKE_SKIP_RPATH:BOOL=NO
+
+//Flags used by the linker during the creation of static libraries
+// during all build types.
+CMAKE_STATIC_LINKER_FLAGS:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during DEBUG builds.
+CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during MINSIZEREL builds.
+CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during RELEASE builds.
+CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
+
+//Flags used by the linker during the creation of static libraries
+// during RELWITHDEBINFO builds.
+CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
+
+//Path to a program.
+CMAKE_STRIP:FILEPATH=/usr/bin/strip
+
+//If this value is on, makefiles will be generated without the
+// .SILENT directive, and all commands will be echoed to the console
+// during the make.  This is useful for debugging only. With Visual
+// Studio IDE projects all commands are done without /nologo.
+CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
+
+//Compile tests
+COMPILE_TESTS:BOOL=OFF
+
+//Build Python bindings
+ENABLE_PYTHON:BOOL=OFF
+
+//The directory containing a CMake configuration file for Eigen3.
+Eigen3_DIR:PATH=Eigen3_DIR-NOTFOUND
+
+//Build static executables
+FORCE_STATIC:BOOL=OFF
+
+//Maximum supported ngram order
+KENLM_MAX_ORDER:STRING=6
+
+//Path to a file.
+LIBLZMA_INCLUDE_DIR:PATH=/usr/include
+
+//Path to a library.
+LIBLZMA_LIBRARY_DEBUG:FILEPATH=LIBLZMA_LIBRARY_DEBUG-NOTFOUND
+
+//Path to a library.
+LIBLZMA_LIBRARY_RELEASE:FILEPATH=/usr/lib/x86_64-linux-gnu/liblzma.so
+
+//Path to a file.
+ZLIB_INCLUDE_DIR:PATH=/usr/include
+
+//Path to a library.
+ZLIB_LIBRARY_DEBUG:FILEPATH=ZLIB_LIBRARY_DEBUG-NOTFOUND
+
+//Path to a library.
+ZLIB_LIBRARY_RELEASE:FILEPATH=/usr/lib/x86_64-linux-gnu/libz.so
+
+//The directory containing a CMake configuration file for boost_atomic.
+boost_atomic_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/boost_atomic-1.74.0
+
+//The directory containing a CMake configuration file for boost_headers.
+boost_headers_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/boost_headers-1.74.0
+
+//The directory containing a CMake configuration file for boost_program_options.
+boost_program_options_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/boost_program_options-1.74.0
+
+//The directory containing a CMake configuration file for boost_system.
+boost_system_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/boost_system-1.74.0
+
+//The directory containing a CMake configuration file for boost_thread.
+boost_thread_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/boost_thread-1.74.0
+
+//The directory containing a CMake configuration file for boost_unit_test_framework.
+boost_unit_test_framework_DIR:PATH=/usr/lib/x86_64-linux-gnu/cmake/boost_unit_test_framework-1.74.0
+
+//Value Computed by CMake
+kenlm_BINARY_DIR:STATIC=/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build
+
+//Value Computed by CMake
+kenlm_IS_TOP_LEVEL:STATIC=ON
+
+//Dependencies for the target
+kenlm_LIB_DEPENDS:STATIC=general;kenlm_util;
+
+//Value Computed by CMake
+kenlm_SOURCE_DIR:STATIC=/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm
+
+//Dependencies for the target
+kenlm_builder_LIB_DEPENDS:STATIC=general;kenlm;general;kenlm_util;
+
+//Dependencies for the target
+kenlm_filter_LIB_DEPENDS:STATIC=general;kenlm_util;
+
+//Dependencies for the target
+kenlm_util_LIB_DEPENDS:STATIC=general;/usr/lib/x86_64-linux-gnu/libz.so;general;/usr/lib/x86_64-linux-gnu/libbz2.so;general;/usr/lib/x86_64-linux-gnu/liblzma.so;general;rt;
+
+
+########################
+# INTERNAL cache entries
+########################
+
+//ADVANCED property for variable: BZIP2_INCLUDE_DIR
+BZIP2_INCLUDE_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: BZIP2_LIBRARY_DEBUG
+BZIP2_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: BZIP2_LIBRARY_RELEASE
+BZIP2_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
+//Have symbol BZ2_bzCompressInit
+BZIP2_NEED_PREFIX:INTERNAL=1
+//ADVANCED property for variable: Boost_DIR
+Boost_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_ADDR2LINE
+CMAKE_ADDR2LINE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_AR
+CMAKE_AR-ADVANCED:INTERNAL=1
+//This is the directory where this CMakeCache.txt was created
+CMAKE_CACHEFILE_DIR:INTERNAL=/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build
+//Major version of cmake used to create the current loaded cache
+CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
+//Minor version of cmake used to create the current loaded cache
+CMAKE_CACHE_MINOR_VERSION:INTERNAL=22
+//Patch version of cmake used to create the current loaded cache
+CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
+//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
+CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
+//Path to CMake executable.
+CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
+//Path to cpack program executable.
+CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
+//Path to ctest program executable.
+CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
+//ADVANCED property for variable: CMAKE_CXX_COMPILER
+CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_COMPILER_AR
+CMAKE_CXX_COMPILER_AR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_COMPILER_RANLIB
+CMAKE_CXX_COMPILER_RANLIB-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS
+CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
+CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
+CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
+CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
+CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_COMPILER
+CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_COMPILER_AR
+CMAKE_C_COMPILER_AR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_COMPILER_RANLIB
+CMAKE_C_COMPILER_RANLIB-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS
+CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
+CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
+CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
+CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
+CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_DLLTOOL
+CMAKE_DLLTOOL-ADVANCED:INTERNAL=1
+//Executable file format
+CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
+CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
+CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
+CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
+CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
+CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
+//Name of external makefile project generator.
+CMAKE_EXTRA_GENERATOR:INTERNAL=
+//Name of generator.
+CMAKE_GENERATOR:INTERNAL=Unix Makefiles
+//Generator instance identifier.
+CMAKE_GENERATOR_INSTANCE:INTERNAL=
+//Name of generator platform.
+CMAKE_GENERATOR_PLATFORM:INTERNAL=
+//Name of generator toolset.
+CMAKE_GENERATOR_TOOLSET:INTERNAL=
+//Test CMAKE_HAVE_LIBC_PTHREAD
+CMAKE_HAVE_LIBC_PTHREAD:INTERNAL=1
+//Have include pthread.h
+CMAKE_HAVE_PTHREAD_H:INTERNAL=1
+//Source directory with the top level CMakeLists.txt file for this
+// project
+CMAKE_HOME_DIRECTORY:INTERNAL=/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm
+//Install .so files without execute permission.
+CMAKE_INSTALL_SO_NO_EXE:INTERNAL=1
+//ADVANCED property for variable: CMAKE_LINKER
+CMAKE_LINKER-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
+CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
+CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
+CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
+CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
+CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_NM
+CMAKE_NM-ADVANCED:INTERNAL=1
+//number of local generators
+CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=9
+//ADVANCED property for variable: CMAKE_OBJCOPY
+CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_OBJDUMP
+CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
+//Platform information initialized
+CMAKE_PLATFORM_INFO_INITIALIZED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_RANLIB
+CMAKE_RANLIB-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_READELF
+CMAKE_READELF-ADVANCED:INTERNAL=1
+//Path to CMake installation.
+CMAKE_ROOT:INTERNAL=/usr/share/cmake-3.22
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
+CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
+CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
+CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
+CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
+CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_SKIP_RPATH
+CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
+CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
+CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
+CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
+CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
+CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: CMAKE_STRIP
+CMAKE_STRIP-ADVANCED:INTERNAL=1
+//uname command
+CMAKE_UNAME:INTERNAL=/usr/bin/uname
+//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
+CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
+//Details about finding BZip2
+FIND_PACKAGE_MESSAGE_DETAILS_BZip2:INTERNAL=[/usr/lib/x86_64-linux-gnu/libbz2.so][/usr/include][v1.0.8()]
+//Details about finding Boost
+FIND_PACKAGE_MESSAGE_DETAILS_Boost:INTERNAL=[/usr/lib/x86_64-linux-gnu/cmake/Boost-1.74.0/BoostConfig.cmake][cfound components: program_options system thread unit_test_framework ][v1.74.0(1.41.0)]
+//Details about finding LibLZMA
+FIND_PACKAGE_MESSAGE_DETAILS_LibLZMA:INTERNAL=[/usr/lib/x86_64-linux-gnu/liblzma.so][/usr/include][1][1][1][v5.2.5()]
+//Details about finding Threads
+FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
+//Details about finding ZLIB
+FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/x86_64-linux-gnu/libz.so][/usr/include][v1.2.11()]
+//Have library rt
+HAVE_CLOCKGETTIME_RT:INTERNAL=1
+//Have library /usr/lib/x86_64-linux-gnu/liblzma.so
+LIBLZMA_HAS_AUTO_DECODER:INTERNAL=1
+//Have library /usr/lib/x86_64-linux-gnu/liblzma.so
+LIBLZMA_HAS_EASY_ENCODER:INTERNAL=1
+//Have library /usr/lib/x86_64-linux-gnu/liblzma.so
+LIBLZMA_HAS_LZMA_PRESET:INTERNAL=1
+//ADVANCED property for variable: LIBLZMA_INCLUDE_DIR
+LIBLZMA_INCLUDE_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: LIBLZMA_LIBRARY_DEBUG
+LIBLZMA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: LIBLZMA_LIBRARY_RELEASE
+LIBLZMA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: ZLIB_INCLUDE_DIR
+ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: ZLIB_LIBRARY_DEBUG
+ZLIB_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: ZLIB_LIBRARY_RELEASE
+ZLIB_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: boost_atomic_DIR
+boost_atomic_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: boost_headers_DIR
+boost_headers_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: boost_program_options_DIR
+boost_program_options_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: boost_system_DIR
+boost_system_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: boost_thread_DIR
+boost_thread_DIR-ADVANCED:INTERNAL=1
+//ADVANCED property for variable: boost_unit_test_framework_DIR
+boost_unit_test_framework_DIR-ADVANCED:INTERNAL=1
+

cc-multilingual-main/cc_net/third_party/kenlm/build/Makefile

@@ -0,0 +1,371 @@
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "Unix Makefiles" Generator, CMake Version 3.22
+
+# Default target executed when no arguments are given to make.
+default_target: all
+.PHONY : default_target
+
+# Allow only one "make -f Makefile2" at a time, but pass parallelism.
+.NOTPARALLEL:
+
+#=============================================================================
+# Special targets provided by cmake.
+
+# Disable implicit rules so canonical targets will work.
+.SUFFIXES:
+
+# Disable VCS-based implicit rules.
+% : %,v
+
+# Disable VCS-based implicit rules.
+% : RCS/%
+
+# Disable VCS-based implicit rules.
+% : RCS/%,v
+
+# Disable VCS-based implicit rules.
+% : SCCS/s.%
+
+# Disable VCS-based implicit rules.
+% : s.%
+
+.SUFFIXES: .hpux_make_needs_suffix_list
+
+# Command-line flag to silence nested $(MAKE).
+$(VERBOSE)MAKESILENT = -s
+
+#Suppress display of executed commands.
+$(VERBOSE).SILENT:
+
+# A target that is always out of date.
+cmake_force:
+.PHONY : cmake_force
+
+#=============================================================================
+# Set environment variables for the build.
+
+# The shell in which to execute make rules.
+SHELL = /bin/sh
+
+# The CMake executable.
+CMAKE_COMMAND = /usr/bin/cmake
+
+# The command to remove a file.
+RM = /usr/bin/cmake -E rm -f
+
+# Escaping for special characters.
+EQUALS = =
+
+# The top-level source directory on which CMake was run.
+CMAKE_SOURCE_DIR = /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm
+
+# The top-level build directory on which CMake was run.
+CMAKE_BINARY_DIR = /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build
+
+#=============================================================================
+# Targets provided globally by CMake.
+
+# Special rule for the target edit_cache
+edit_cache:
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "No interactive CMake dialog available..."
+	/usr/bin/cmake -E echo No\ interactive\ CMake\ dialog\ available.
+.PHONY : edit_cache
+
+# Special rule for the target edit_cache
+edit_cache/fast: edit_cache
+.PHONY : edit_cache/fast
+
+# Special rule for the target rebuild_cache
+rebuild_cache:
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Running CMake to regenerate build system..."
+	/usr/bin/cmake --regenerate-during-build -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR)
+.PHONY : rebuild_cache
+
+# Special rule for the target rebuild_cache
+rebuild_cache/fast: rebuild_cache
+.PHONY : rebuild_cache/fast
+
+# Special rule for the target list_install_components
+list_install_components:
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Available install components are: \"Unspecified\" \"headers\""
+.PHONY : list_install_components
+
+# Special rule for the target list_install_components
+list_install_components/fast: list_install_components
+.PHONY : list_install_components/fast
+
+# Special rule for the target install
+install: preinstall
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Install the project..."
+	/usr/bin/cmake -P cmake_install.cmake
+.PHONY : install
+
+# Special rule for the target install
+install/fast: preinstall/fast
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Install the project..."
+	/usr/bin/cmake -P cmake_install.cmake
+.PHONY : install/fast
+
+# Special rule for the target install/local
+install/local: preinstall
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Installing only the local directory..."
+	/usr/bin/cmake -DCMAKE_INSTALL_LOCAL_ONLY=1 -P cmake_install.cmake
+.PHONY : install/local
+
+# Special rule for the target install/local
+install/local/fast: preinstall/fast
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Installing only the local directory..."
+	/usr/bin/cmake -DCMAKE_INSTALL_LOCAL_ONLY=1 -P cmake_install.cmake
+.PHONY : install/local/fast
+
+# Special rule for the target install/strip
+install/strip: preinstall
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Installing the project stripped..."
+	/usr/bin/cmake -DCMAKE_INSTALL_DO_STRIP=1 -P cmake_install.cmake
+.PHONY : install/strip
+
+# Special rule for the target install/strip
+install/strip/fast: preinstall/fast
+	@$(CMAKE_COMMAND) -E cmake_echo_color --switch=$(COLOR) --cyan "Installing the project stripped..."
+	/usr/bin/cmake -DCMAKE_INSTALL_DO_STRIP=1 -P cmake_install.cmake
+.PHONY : install/strip/fast
+
+# The main all target
+all: cmake_check_build_system
+	$(CMAKE_COMMAND) -E cmake_progress_start /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/CMakeFiles /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build//CMakeFiles/progress.marks
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 all
+	$(CMAKE_COMMAND) -E cmake_progress_start /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/CMakeFiles 0
+.PHONY : all
+
+# The main clean target
+clean:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 clean
+.PHONY : clean
+
+# The main clean target
+clean/fast: clean
+.PHONY : clean/fast
+
+# Prepare targets for installation.
+preinstall: all
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 preinstall
+.PHONY : preinstall
+
+# Prepare targets for installation.
+preinstall/fast:
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 preinstall
+.PHONY : preinstall/fast
+
+# clear depends
+depend:
+	$(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles/Makefile.cmake 1
+.PHONY : depend
+
+#=============================================================================
+# Target rules for targets named kenlm_util
+
+# Build rule for target.
+kenlm_util: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 kenlm_util
+.PHONY : kenlm_util
+
+# fast build rule for target.
+kenlm_util/fast:
+	$(MAKE) $(MAKESILENT) -f util/CMakeFiles/kenlm_util.dir/build.make util/CMakeFiles/kenlm_util.dir/build
+.PHONY : kenlm_util/fast
+
+#=============================================================================
+# Target rules for targets named probing_hash_table_benchmark
+
+# Build rule for target.
+probing_hash_table_benchmark: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 probing_hash_table_benchmark
+.PHONY : probing_hash_table_benchmark
+
+# fast build rule for target.
+probing_hash_table_benchmark/fast:
+	$(MAKE) $(MAKESILENT) -f util/CMakeFiles/probing_hash_table_benchmark.dir/build.make util/CMakeFiles/probing_hash_table_benchmark.dir/build
+.PHONY : probing_hash_table_benchmark/fast
+
+#=============================================================================
+# Target rules for targets named kenlm
+
+# Build rule for target.
+kenlm: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 kenlm
+.PHONY : kenlm
+
+# fast build rule for target.
+kenlm/fast:
+	$(MAKE) $(MAKESILENT) -f lm/CMakeFiles/kenlm.dir/build.make lm/CMakeFiles/kenlm.dir/build
+.PHONY : kenlm/fast
+
+#=============================================================================
+# Target rules for targets named query
+
+# Build rule for target.
+query: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 query
+.PHONY : query
+
+# fast build rule for target.
+query/fast:
+	$(MAKE) $(MAKESILENT) -f lm/CMakeFiles/query.dir/build.make lm/CMakeFiles/query.dir/build
+.PHONY : query/fast
+
+#=============================================================================
+# Target rules for targets named fragment
+
+# Build rule for target.
+fragment: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 fragment
+.PHONY : fragment
+
+# fast build rule for target.
+fragment/fast:
+	$(MAKE) $(MAKESILENT) -f lm/CMakeFiles/fragment.dir/build.make lm/CMakeFiles/fragment.dir/build
+.PHONY : fragment/fast
+
+#=============================================================================
+# Target rules for targets named build_binary
+
+# Build rule for target.
+build_binary: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 build_binary
+.PHONY : build_binary
+
+# fast build rule for target.
+build_binary/fast:
+	$(MAKE) $(MAKESILENT) -f lm/CMakeFiles/build_binary.dir/build.make lm/CMakeFiles/build_binary.dir/build
+.PHONY : build_binary/fast
+
+#=============================================================================
+# Target rules for targets named kenlm_benchmark
+
+# Build rule for target.
+kenlm_benchmark: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 kenlm_benchmark
+.PHONY : kenlm_benchmark
+
+# fast build rule for target.
+kenlm_benchmark/fast:
+	$(MAKE) $(MAKESILENT) -f lm/CMakeFiles/kenlm_benchmark.dir/build.make lm/CMakeFiles/kenlm_benchmark.dir/build
+.PHONY : kenlm_benchmark/fast
+
+#=============================================================================
+# Target rules for targets named kenlm_builder
+
+# Build rule for target.
+kenlm_builder: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 kenlm_builder
+.PHONY : kenlm_builder
+
+# fast build rule for target.
+kenlm_builder/fast:
+	$(MAKE) $(MAKESILENT) -f lm/builder/CMakeFiles/kenlm_builder.dir/build.make lm/builder/CMakeFiles/kenlm_builder.dir/build
+.PHONY : kenlm_builder/fast
+
+#=============================================================================
+# Target rules for targets named lmplz
+
+# Build rule for target.
+lmplz: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 lmplz
+.PHONY : lmplz
+
+# fast build rule for target.
+lmplz/fast:
+	$(MAKE) $(MAKESILENT) -f lm/builder/CMakeFiles/lmplz.dir/build.make lm/builder/CMakeFiles/lmplz.dir/build
+.PHONY : lmplz/fast
+
+#=============================================================================
+# Target rules for targets named count_ngrams
+
+# Build rule for target.
+count_ngrams: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 count_ngrams
+.PHONY : count_ngrams
+
+# fast build rule for target.
+count_ngrams/fast:
+	$(MAKE) $(MAKESILENT) -f lm/builder/CMakeFiles/count_ngrams.dir/build.make lm/builder/CMakeFiles/count_ngrams.dir/build
+.PHONY : count_ngrams/fast
+
+#=============================================================================
+# Target rules for targets named kenlm_filter
+
+# Build rule for target.
+kenlm_filter: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 kenlm_filter
+.PHONY : kenlm_filter
+
+# fast build rule for target.
+kenlm_filter/fast:
+	$(MAKE) $(MAKESILENT) -f lm/filter/CMakeFiles/kenlm_filter.dir/build.make lm/filter/CMakeFiles/kenlm_filter.dir/build
+.PHONY : kenlm_filter/fast
+
+#=============================================================================
+# Target rules for targets named filter
+
+# Build rule for target.
+filter: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 filter
+.PHONY : filter
+
+# fast build rule for target.
+filter/fast:
+	$(MAKE) $(MAKESILENT) -f lm/filter/CMakeFiles/filter.dir/build.make lm/filter/CMakeFiles/filter.dir/build
+.PHONY : filter/fast
+
+#=============================================================================
+# Target rules for targets named phrase_table_vocab
+
+# Build rule for target.
+phrase_table_vocab: cmake_check_build_system
+	$(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 phrase_table_vocab
+.PHONY : phrase_table_vocab
+
+# fast build rule for target.
+phrase_table_vocab/fast:
+	$(MAKE) $(MAKESILENT) -f lm/filter/CMakeFiles/phrase_table_vocab.dir/build.make lm/filter/CMakeFiles/phrase_table_vocab.dir/build
+.PHONY : phrase_table_vocab/fast
+
+# Help Target
+help:
+	@echo "The following are some of the valid targets for this Makefile:"
+	@echo "... all (the default if no target is provided)"
+	@echo "... clean"
+	@echo "... depend"
+	@echo "... edit_cache"
+	@echo "... install"
+	@echo "... install/local"
+	@echo "... install/strip"
+	@echo "... list_install_components"
+	@echo "... rebuild_cache"
+	@echo "... build_binary"
+	@echo "... count_ngrams"
+	@echo "... filter"
+	@echo "... fragment"
+	@echo "... kenlm"
+	@echo "... kenlm_benchmark"
+	@echo "... kenlm_builder"
+	@echo "... kenlm_filter"
+	@echo "... kenlm_util"
+	@echo "... lmplz"
+	@echo "... phrase_table_vocab"
+	@echo "... probing_hash_table_benchmark"
+	@echo "... query"
+.PHONY : help
+
+
+
+#=============================================================================
+# Special targets to cleanup operation of make.
+
+# Special rule to run CMake to check the build system integrity.
+# No rule that depends on this can have commands that come from listfiles
+# because they might be regenerated.
+cmake_check_build_system:
+	$(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles/Makefile.cmake 0
+.PHONY : cmake_check_build_system
+

cc-multilingual-main/cc_net/third_party/kenlm/build/cmake_install.cmake

@@ -0,0 +1,248 @@
+# Install script for directory: /home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm
+
+# Set the install prefix
+if(NOT DEFINED CMAKE_INSTALL_PREFIX)
+  set(CMAKE_INSTALL_PREFIX "/usr/local")
+endif()
+string(REGEX REPLACE "/$" "" CMAKE_INSTALL_PREFIX "${CMAKE_INSTALL_PREFIX}")
+
+# Set the install configuration name.
+if(NOT DEFINED CMAKE_INSTALL_CONFIG_NAME)
+  if(BUILD_TYPE)
+    string(REGEX REPLACE "^[^A-Za-z0-9_]+" ""
+           CMAKE_INSTALL_CONFIG_NAME "${BUILD_TYPE}")
+  else()
+    set(CMAKE_INSTALL_CONFIG_NAME "Release")
+  endif()
+  message(STATUS "Install configuration: \"${CMAKE_INSTALL_CONFIG_NAME}\"")
+endif()
+
+# Set the component getting installed.
+if(NOT CMAKE_INSTALL_COMPONENT)
+  if(COMPONENT)
+    message(STATUS "Install component: \"${COMPONENT}\"")
+    set(CMAKE_INSTALL_COMPONENT "${COMPONENT}")
+  else()
+    set(CMAKE_INSTALL_COMPONENT)
+  endif()
+endif()
+
+# Install shared libraries without execute permission?
+if(NOT DEFINED CMAKE_INSTALL_SO_NO_EXE)
+  set(CMAKE_INSTALL_SO_NO_EXE "1")
+endif()
+
+# Is this installation the result of a crosscompile?
+if(NOT DEFINED CMAKE_CROSSCOMPILING)
+  set(CMAKE_CROSSCOMPILING "FALSE")
+endif()
+
+# Set default install directory permissions.
+if(NOT DEFINED CMAKE_OBJDUMP)
+  set(CMAKE_OBJDUMP "/usr/bin/objdump")
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xUnspecifiedx" OR NOT CMAKE_INSTALL_COMPONENT)
+  if(EXISTS "$ENV{DESTDIR}${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake/kenlmTargets.cmake")
+    file(DIFFERENT EXPORT_FILE_CHANGED FILES
+         "$ENV{DESTDIR}${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake/kenlmTargets.cmake"
+         "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/CMakeFiles/Export/share/kenlm/cmake/kenlmTargets.cmake")
+    if(EXPORT_FILE_CHANGED)
+      file(GLOB OLD_CONFIG_FILES "$ENV{DESTDIR}${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake/kenlmTargets-*.cmake")
+      if(OLD_CONFIG_FILES)
+        message(STATUS "Old export file \"$ENV{DESTDIR}${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake/kenlmTargets.cmake\" will be replaced.  Removing files [${OLD_CONFIG_FILES}].")
+        file(REMOVE ${OLD_CONFIG_FILES})
+      endif()
+    endif()
+  endif()
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake" TYPE FILE FILES "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/CMakeFiles/Export/share/kenlm/cmake/kenlmTargets.cmake")
+  if("${CMAKE_INSTALL_CONFIG_NAME}" MATCHES "^([Rr][Ee][Ll][Ee][Aa][Ss][Ee])$")
+    file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake" TYPE FILE FILES "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/CMakeFiles/Export/share/kenlm/cmake/kenlmTargets-release.cmake")
+  endif()
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/util" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/bit_packing.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/ersatz_progress.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/exception.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/fake_ostream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/file.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/file_piece.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/file_stream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/fixed_array.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/float_to_string.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/getopt.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/have.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/integer_to_string.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/joint_sort.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/mmap.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/multi_intersection.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/murmur_hash.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/parallel_read.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/pcqueue.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/pool.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/probing_hash_table.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/proxy_iterator.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/read_compressed.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/scoped.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/sized_iterator.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/sorted_uniform.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/spaces.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/string_piece.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/string_piece_hash.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/string_stream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/thread_pool.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/tokenize_piece.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/usage.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/util/double-conversion" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/bignum-dtoa.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/bignum.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/cached-powers.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/diy-fp.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/double-conversion.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/fast-dtoa.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/fixed-dtoa.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/ieee.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/strtod.h"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/double-conversion/utils.h"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/util/stream" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/block.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/chain.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/config.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/count_records.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/io.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/line_input.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/multi_progress.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/multi_stream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/rewindable_stream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/sort.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/stream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/util/stream/typed_stream.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/lm" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/bhiksha.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/binary_format.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/blank.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/config.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/enumerate_vocab.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/facade.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/left.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/lm_exception.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/max_order.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/model.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/model_type.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/ngram_query.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/partial.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/quantize.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/read_arpa.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/return.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/search_hashed.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/search_trie.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/sizes.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/state.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/trie.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/trie_sort.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/value.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/value_build.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/virtual_interface.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/vocab.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/weights.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/word_index.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/lm/builder" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/adjust_counts.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/combine_counts.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/corpus_count.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/debug_print.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/discount.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/hash_gamma.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/header_info.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/initial_probabilities.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/interpolate.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/output.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/payload.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/builder/pipeline.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/lm/common" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/compare.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/joint_order.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/model_buffer.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/ngram.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/ngram_stream.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/print.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/renumber.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/size_option.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/common/special.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/lm/filter" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/arpa_io.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/count_io.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/format.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/phrase.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/thread.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/vocab.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/filter/wrapper.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xheadersx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/include/kenlm/lm/interpolate" TYPE FILE FILES
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/backoff_matrix.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/backoff_reunification.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/bounded_sequence_encoding.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/interpolate_info.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/merge_probabilities.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/merge_vocab.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/normalize.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/pipeline.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/split_worker.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/tune_derivatives.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/tune_instances.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/tune_matrix.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/tune_weights.hh"
+    "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/lm/interpolate/universal_vocab.hh"
+    )
+endif()
+
+if("x${CMAKE_INSTALL_COMPONENT}x" STREQUAL "xUnspecifiedx" OR NOT CMAKE_INSTALL_COMPONENT)
+  file(INSTALL DESTINATION "${CMAKE_INSTALL_PREFIX}/share/kenlm/cmake" TYPE FILE FILES "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/kenlmConfig.cmake")
+endif()
+
+if(NOT CMAKE_INSTALL_LOCAL_ONLY)
+  # Include the install script for each subdirectory.
+  include("/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/util/cmake_install.cmake")
+  include("/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/lm/cmake_install.cmake")
+
+endif()
+
+if(CMAKE_INSTALL_COMPONENT)
+  set(CMAKE_INSTALL_MANIFEST "install_manifest_${CMAKE_INSTALL_COMPONENT}.txt")
+else()
+  set(CMAKE_INSTALL_MANIFEST "install_manifest.txt")
+endif()
+
+string(REPLACE ";" "\n" CMAKE_INSTALL_MANIFEST_CONTENT
+       "${CMAKE_INSTALL_MANIFEST_FILES}")
+file(WRITE "/home/sdp/Common_crawl/cc-multilingual-main/cc-multilingual-main/cc_net/third_party/kenlm/build/${CMAKE_INSTALL_MANIFEST}"
+     "${CMAKE_INSTALL_MANIFEST_CONTENT}")

cc-multilingual-main/cc_net/third_party/kenlm/build/kenlmConfig.cmake

@@ -0,0 +1,26 @@
+
+####### Expanded from @PACKAGE_INIT@ by configure_package_config_file() #######
+####### Any changes to this file will be overwritten by the next CMake run ####
+####### The input file was kenlmConfig.cmake.in                            ########
+
+get_filename_component(PACKAGE_PREFIX_DIR "${CMAKE_CURRENT_LIST_DIR}/../../../" ABSOLUTE)
+
+####################################################################################
+
+include(CMakeFindDependencyMacro)
+
+find_dependency(Boost)
+find_dependency(Threads)
+
+# Compression libs
+if ()
+  find_dependency(ZLIB)
+endif()
+if ()
+  find_dependency(BZip2)
+endif()
+if ()
+  find_dependency(LibLZMA)
+endif()
+
+include("${CMAKE_CURRENT_LIST_DIR}/kenlmTargets.cmake")

cc-multilingual-main/cc_net/third_party/kenlm/cmake/KenLMFunctions.cmake

@@ -0,0 +1,81 @@
+# Helper functions used across the CMake build system
+
+include(CMakeParseArguments)
+
+# Adds a bunch of executables to the build, each depending on the specified
+# dependent object files and linking against the specified libraries
+function(AddExes)
+  set(multiValueArgs EXES DEPENDS LIBRARIES)
+  cmake_parse_arguments(AddExes "" "" "${multiValueArgs}" ${ARGN})
+
+  # Iterate through the executable list
+  foreach(exe ${AddExes_EXES})
+
+    # Compile the executable, linking against the requisite dependent object files
+    add_executable(${exe} ${exe}_main.cc ${AddExes_DEPENDS})
+
+    # Link the executable against the supplied libraries
+    target_link_libraries(${exe} ${AddExes_LIBRARIES})
+
+    # Group executables together
+    set_target_properties(${exe} PROPERTIES FOLDER executables)
+
+  # End for loop
+  endforeach(exe)
+
+  # Install the executable files
+  install(TARGETS ${AddExes_EXES} DESTINATION bin)
+endfunction()
+
+# Adds a single test to the build, depending on the specified dependent
+# object files, linking against the specified libraries, and with the
+# specified command line arguments
+function(KenLMAddTest)
+  cmake_parse_arguments(KenLMAddTest "" "TEST"
+                        "DEPENDS;LIBRARIES;TEST_ARGS" ${ARGN})
+
+  # Compile the executable, linking against the requisite dependent object files
+  add_executable(${KenLMAddTest_TEST}
+                 ${KenLMAddTest_TEST}.cc
+                 ${KenLMAddTest_DEPENDS})
+
+  if (Boost_USE_STATIC_LIBS)
+    set(DYNLINK_FLAGS)
+  else()
+    set(DYNLINK_FLAGS COMPILE_FLAGS -DBOOST_TEST_DYN_LINK)
+  endif()
+
+  # Require the following compile flag
+  set_target_properties(${KenLMAddTest_TEST} PROPERTIES
+                        ${DYNLINK_FLAGS}
+                        RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/tests)
+
+  target_link_libraries(${KenLMAddTest_TEST} ${KenLMAddTest_LIBRARIES} ${TIMER_LINK})
+
+  set(test_params "")
+  if(KenLMAddTest_TEST_ARGS)
+    set(test_params ${KenLMAddTest_TEST_ARGS})
+  endif()
+
+  # Specify command arguments for how to run each unit test
+  add_test(NAME ${KenLMAddTest_TEST}
+           COMMAND ${KenLMAddTest_TEST} ${test_params})
+
+  # Group unit tests together
+  set_target_properties(${KenLMAddTest_TEST} PROPERTIES FOLDER "unit_tests")
+endfunction()
+
+# Adds a bunch of tests to the build, each depending on the specified
+# dependent object files and linking against the specified libraries
+function(AddTests)
+  set(multiValueArgs TESTS DEPENDS LIBRARIES TEST_ARGS)
+  cmake_parse_arguments(AddTests "" "" "${multiValueArgs}" ${ARGN})
+
+  # Iterate through the Boost tests list
+  foreach(test ${AddTests_TESTS})
+    KenLMAddTest(TEST ${test}
+                 DEPENDS ${AddTests_DEPENDS}
+                 LIBRARIES ${AddTests_LIBRARIES}
+                 TEST_ARGS ${AddTests_TEST_ARGS})
+  endforeach(test)
+endfunction()

cc-multilingual-main/cc_net/third_party/kenlm/cmake/kenlmConfig.cmake.in

@@ -0,0 +1,19 @@
+@PACKAGE_INIT@
+
+include(CMakeFindDependencyMacro)
+
+find_dependency(Boost)
+find_dependency(Threads)
+
+# Compression libs
+if (@ZLIB_FOUND@)
+  find_dependency(ZLIB)
+endif()
+if (@BZIP2_FOUND@)
+  find_dependency(BZip2)
+endif()
+if (@LIBLZMA_FOUND@)
+  find_dependency(LibLZMA)
+endif()
+
+include("${CMAKE_CURRENT_LIST_DIR}/kenlmTargets.cmake")

cc-multilingual-main/cc_net/third_party/kenlm/cmake/modules/FindEigen3.cmake

@@ -0,0 +1,90 @@
+# - Try to find Eigen3 lib
+#
+# This module supports requiring a minimum version, e.g. you can do
+#   find_package(Eigen3 3.1.2)
+# to require version 3.1.2 or newer of Eigen3.
+#
+# Once done this will define
+#
+#  EIGEN3_FOUND - system has eigen lib with correct version
+#  EIGEN3_INCLUDE_DIR - the eigen include directory
+#  EIGEN3_VERSION - eigen version
+#
+# This module reads hints about search locations from 
+# the following enviroment variables:
+#
+# EIGEN3_ROOT
+# EIGEN3_ROOT_DIR
+
+# Copyright (c) 2006, 2007 Montel Laurent, <[email protected]>
+# Copyright (c) 2008, 2009 Gael Guennebaud, <[email protected]>
+# Copyright (c) 2009 Benoit Jacob <[email protected]>
+# Redistribution and use is allowed according to the terms of the 2-clause BSD license.
+
+if(NOT Eigen3_FIND_VERSION)
+  if(NOT Eigen3_FIND_VERSION_MAJOR)
+    set(Eigen3_FIND_VERSION_MAJOR 2)
+  endif(NOT Eigen3_FIND_VERSION_MAJOR)
+  if(NOT Eigen3_FIND_VERSION_MINOR)
+    set(Eigen3_FIND_VERSION_MINOR 91)
+  endif(NOT Eigen3_FIND_VERSION_MINOR)
+  if(NOT Eigen3_FIND_VERSION_PATCH)
+    set(Eigen3_FIND_VERSION_PATCH 0)
+  endif(NOT Eigen3_FIND_VERSION_PATCH)
+
+  set(Eigen3_FIND_VERSION "${Eigen3_FIND_VERSION_MAJOR}.${Eigen3_FIND_VERSION_MINOR}.${Eigen3_FIND_VERSION_PATCH}")
+endif(NOT Eigen3_FIND_VERSION)
+
+macro(_eigen3_check_version)
+  file(READ "${EIGEN3_INCLUDE_DIR}/Eigen/src/Core/util/Macros.h" _eigen3_version_header)
+
+  string(REGEX MATCH "define[ \t]+EIGEN_WORLD_VERSION[ \t]+([0-9]+)" _eigen3_world_version_match "${_eigen3_version_header}")
+  set(EIGEN3_WORLD_VERSION "${CMAKE_MATCH_1}")
+  string(REGEX MATCH "define[ \t]+EIGEN_MAJOR_VERSION[ \t]+([0-9]+)" _eigen3_major_version_match "${_eigen3_version_header}")
+  set(EIGEN3_MAJOR_VERSION "${CMAKE_MATCH_1}")
+  string(REGEX MATCH "define[ \t]+EIGEN_MINOR_VERSION[ \t]+([0-9]+)" _eigen3_minor_version_match "${_eigen3_version_header}")
+  set(EIGEN3_MINOR_VERSION "${CMAKE_MATCH_1}")
+
+  set(EIGEN3_VERSION ${EIGEN3_WORLD_VERSION}.${EIGEN3_MAJOR_VERSION}.${EIGEN3_MINOR_VERSION})
+  if(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+    set(EIGEN3_VERSION_OK FALSE)
+  else(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+    set(EIGEN3_VERSION_OK TRUE)
+  endif(${EIGEN3_VERSION} VERSION_LESS ${Eigen3_FIND_VERSION})
+
+  if(NOT EIGEN3_VERSION_OK)
+
+    message(STATUS "Eigen3 version ${EIGEN3_VERSION} found in ${EIGEN3_INCLUDE_DIR}, "
+                   "but at least version ${Eigen3_FIND_VERSION} is required")
+  endif(NOT EIGEN3_VERSION_OK)
+endmacro(_eigen3_check_version)
+
+if (EIGEN3_INCLUDE_DIR)
+
+  # in cache already
+  _eigen3_check_version()
+  set(EIGEN3_FOUND ${EIGEN3_VERSION_OK})
+
+else (EIGEN3_INCLUDE_DIR)
+
+  find_path(EIGEN3_INCLUDE_DIR NAMES signature_of_eigen3_matrix_library
+      HINTS
+      ENV EIGEN3_ROOT 
+      ENV EIGEN3_ROOT_DIR
+      PATHS
+      ${CMAKE_INSTALL_PREFIX}/include
+      ${KDE4_INCLUDE_DIR}
+      PATH_SUFFIXES eigen3 eigen
+    )
+
+  if(EIGEN3_INCLUDE_DIR)
+    _eigen3_check_version()
+  endif(EIGEN3_INCLUDE_DIR)
+
+  include(FindPackageHandleStandardArgs)
+  find_package_handle_standard_args(Eigen3 DEFAULT_MSG EIGEN3_INCLUDE_DIR EIGEN3_VERSION_OK)
+
+  mark_as_advanced(EIGEN3_INCLUDE_DIR)
+
+endif(EIGEN3_INCLUDE_DIR)
+

cc-multilingual-main/cc_net/third_party/kenlm/compile_query_only.sh

@@ -0,0 +1,34 @@
+#!/bin/bash
+#This is just an example compilation.  You should integrate these files into your build system.  Boost jam is provided and preferred.
+
+echo You must use ./bjam if you want language model estimation, filtering, or support for compressed files \(.gz, .bz2, .xz\) 1>&2
+
+rm {lm,util}/*.o 2>/dev/null
+set -e
+
+CXX=${CXX:-g++}
+
+CXXFLAGS+=" -I. -O3 -DNDEBUG -DKENLM_MAX_ORDER=6"
+
+#If this fails for you, consider using bjam.
+if [ ${#NPLM} != 0 ]; then
+  CXXFLAGS+=" -DHAVE_NPLM -lneuralLM -L$NPLM/src -I$NPLM/src -lboost_thread-mt -fopenmp"
+  ADDED_PATHS="lm/wrappers/*.cc"
+fi
+echo 'Compiling with '$CXX $CXXFLAGS
+
+#Grab all cc files in these directories except those ending in test.cc or main.cc
+objects=""
+for i in util/double-conversion/*.cc util/*.cc lm/*.cc $ADDED_PATHS; do
+  if [ "${i%test.cc}" == "$i" ] && [ "${i%main.cc}" == "$i" ]; then
+    $CXX $CXXFLAGS -c $i -o ${i%.cc}.o
+    objects="$objects ${i%.cc}.o"
+  fi
+done
+
+mkdir -p bin
+if [ "$(uname)" != Darwin ]; then
+  CXXFLAGS="$CXXFLAGS -lrt"
+fi
+$CXX lm/build_binary_main.cc $objects -o bin/build_binary $CXXFLAGS $LDFLAGS
+$CXX lm/query_main.cc $objects -o bin/query $CXXFLAGS $LDFLAGS

cc-multilingual-main/cc_net/third_party/kenlm/setup.py

@@ -0,0 +1,62 @@
+from setuptools import setup, Extension
+import glob
+import platform
+import os
+import sys
+import re
+
+#Does gcc compile with this header and library?
+def compile_test(header, library):
+    dummy_path = os.path.join(os.path.dirname(__file__), "dummy")
+    command = "bash -c \"g++ -include " + header + " -l" + library + " -x c++ - <<<'int main() {}' -o " + dummy_path + " >/dev/null 2>/dev/null && rm " + dummy_path + " 2>/dev/null\""
+    return os.system(command) == 0
+
+max_order = "6"
+is_max_order = [s for s in sys.argv if "--max_order" in s]
+for element in is_max_order:
+    max_order = re.split('[= ]',element)[1]
+    sys.argv.remove(element)
+
+FILES = glob.glob('util/*.cc') + glob.glob('lm/*.cc') + glob.glob('util/double-conversion/*.cc') + glob.glob('python/*.cc')
+FILES = [fn for fn in FILES if not (fn.endswith('main.cc') or fn.endswith('test.cc'))]
+
+if platform.system() == 'Linux':
+    LIBS = ['stdc++', 'rt']
+elif platform.system() == 'Darwin':
+    LIBS = ['c++']
+else:
+    LIBS = []
+
+#We don't need -std=c++11 but python seems to be compiled with it now.  https://github.com/kpu/kenlm/issues/86
+ARGS = ['-O3', '-DNDEBUG', '-DKENLM_MAX_ORDER='+max_order, '-std=c++11']
+
+#Attempted fix to https://github.com/kpu/kenlm/issues/186 and https://github.com/kpu/kenlm/issues/197
+if platform.system() == 'Darwin':
+    ARGS += ["-stdlib=libc++", "-mmacosx-version-min=10.7"]
+
+if compile_test('zlib.h', 'z'):
+    ARGS.append('-DHAVE_ZLIB')
+    LIBS.append('z')
+
+if compile_test('bzlib.h', 'bz2'):
+    ARGS.append('-DHAVE_BZLIB')
+    LIBS.append('bz2')
+
+if compile_test('lzma.h', 'lzma'):
+    ARGS.append('-DHAVE_XZLIB')
+    LIBS.append('lzma')
+
+ext_modules = [
+    Extension(name='kenlm',
+        sources=FILES + ['python/kenlm.cpp'],
+        language='C++', 
+        include_dirs=['.'],
+        libraries=LIBS, 
+        extra_compile_args=ARGS)
+]
+
+setup(
+    name='kenlm',
+    ext_modules=ext_modules,
+    include_package_data=True,
+)

cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/CMakeFiles/sentencepiece_train-static.dir/builder.cc.o

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:976b84fde8bfb7971b25df0fc93e046d5ffd234aac0b2863eb43a0dab4307d8f
+size 1117264

cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.a

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:843738e17346c8b3edf05f5c13cc172f2291243fd855a261c6b46052bd0d839b
+size 2025446

cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.so

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d852b5a0f12c183a9a51eff748b3dafd9135e655d574228201f87387d793eb00
+size 1126472

cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece.so.0.0.0

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d852b5a0f12c183a9a51eff748b3dafd9135e655d574228201f87387d793eb00
+size 1126472

cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece_train.a

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:34b423aaa7273e14f6cd064179f3660c5f17047a410799da24937df72e49d75a
+size 1921634

cc-multilingual-main/cc_net/third_party/sentencepiece/build/src/libsentencepiece_train.so.0

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2ec684eaf2a6f1d19285c97f5d3a0382c4a983fa08d78aeede21d6cf2563ff4d
+size 1544648

cc-multilingual-main/cc_net/third_party/sentencepiece/src/CMakeLists.txt

@@ -0,0 +1,288 @@
+# Copyright 2018 Google Inc.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.!
+
+if (SPM_USE_BUILTIN_PROTOBUF)
+  set(SPM_PROTO_HDRS builtin_pb/sentencepiece.pb.h)
+  set(SPM_PROTO_SRCS builtin_pb/sentencepiece.pb.cc)
+  set(SPM_MODEL_PROTO_HDRS builtin_pb/sentencepiece_model.pb.h)
+  set(SPM_MODEL_PROTO_SRCS builtin_pb/sentencepiece_model.pb.cc)
+  set(PROTOBUF_LITE_LIBRARY "")
+  set(PROTOBUF_LITE_SRCS
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/arena.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/arenastring.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/bytestream.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/coded_stream.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/common.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/extension_set.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/generated_message_table_driven_lite.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/generated_message_util.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/implicit_weak_message.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/int128.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/io_win32.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/message_lite.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/repeated_field.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/status.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/statusor.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/stringpiece.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/stringprintf.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/structurally_valid.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/strutil.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/time.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/wire_format_lite.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/zero_copy_stream.cc
+    ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite/zero_copy_stream_impl_lite.cc)
+  if (MSVC)
+    add_definitions("/DHAVE_PTHREAD /wd4018 /wd4514")
+  else()
+    add_definitions("-pthread -DHAVE_PTHREAD=1 -Wno-sign-compare")
+  endif()
+  include_directories(${CMAKE_CURRENT_SOURCE_DIR}/../third_party/protobuf-lite)
+  include_directories(builtin_pb)
+else()
+  find_package(Protobuf REQUIRED)
+  include_directories(${Protobuf_INCLUDE_DIRS})
+  protobuf_generate_cpp(SPM_PROTO_SRCS SPM_PROTO_HDRS sentencepiece.proto)
+  protobuf_generate_cpp(SPM_MODEL_PROTO_SRCS SPM_MODEL_PROTO_HDRS sentencepiece_model.proto)
+  set(PROTOBUF_LITE_SRCS "")
+  include_directories(${PROTOBUF_INCLUDE_DIR})
+endif()
+
+include_directories(${CMAKE_CURRENT_BINARY_DIR})
+
+set(SPM_SRCS
+  ${PROTOBUF_LITE_SRCS}
+  ${SPM_PROTO_HDRS}
+  ${SPM_PROTO_SRCS}
+  ${SPM_MODEL_PROTO_HDRS}
+  ${SPM_MODEL_PROTO_SRCS}
+  bpe_model.h
+  common.h
+  normalizer.h
+  util.h
+  freelist.h
+  filesystem.h
+  flags.h
+  sentencepiece_processor.h
+  word_model.h
+  model_factory.h
+  char_model.h
+  model_interface.h
+  testharness.h
+  unigram_model.h
+  bpe_model.cc
+  char_model.cc
+  error.cc
+  filesystem.cc
+  flags.cc
+  model_factory.cc
+  model_interface.cc
+  normalizer.cc
+  sentencepiece_processor.cc
+  unigram_model.cc
+  util.cc
+  word_model.cc
+  ${CMAKE_CURRENT_SOURCE_DIR}/../third_party/absl/strings/string_view.cc)
+
+set(SPM_TRAIN_SRCS
+  ${SPM_PROTO_HDRS}
+  ${SPM_MODEL_PROTO_HDRS}
+  builder.h
+  normalization_rule.h
+  unicode_script.h
+  unicode_script_map.h
+  trainer_factory.h
+  trainer_interface.h
+  unigram_model_trainer.h
+  word_model_trainer.h
+  char_model_trainer.h
+  bpe_model_trainer.h
+  sentencepiece_trainer.h
+  builder.cc
+  unicode_script.cc
+  trainer_factory.cc
+  trainer_interface.cc
+  unigram_model_trainer.cc
+  word_model_trainer.cc
+  char_model_trainer.cc
+  bpe_model_trainer.cc
+  sentencepiece_trainer.cc)
+
+set(SPM_TEST_SRCS
+  ${SPM_PROTO_HDRS}
+  ${SPM_MODEL_PROTO_HDRS}
+  testharness.h
+  bpe_model_test.cc
+  bpe_model_trainer_test.cc
+  builder_test.cc
+  char_model_test.cc
+  char_model_trainer_test.cc
+  filesystem_test.cc
+  flags_test.cc
+  model_factory_test.cc
+  model_interface_test.cc
+  normalizer_test.cc
+  sentencepiece_processor_test.cc
+  sentencepiece_trainer_test.cc
+  test_main.cc
+  testharness.cc
+  trainer_factory_test.cc
+  trainer_interface_test.cc
+  unicode_script_test.cc
+  unigram_model_test.cc
+  unigram_model_trainer_test.cc
+  util_test.cc
+  word_model_test.cc
+  word_model_trainer_test.cc)
+
+find_package(Threads REQUIRED)
+
+set(SPM_LIBS ${PROTOBUF_LITE_LIBRARY} Threads::Threads)
+
+if (SPM_ENABLE_NFKC_COMPILE)
+  find_package(ICU 4.4 COMPONENTS i18n data uc REQUIRED)
+  include_directories(${ICU_INCLUDE_DIRS})
+  add_definitions(-DENABLE_NFKC_COMPILE)
+  list(APPEND SPM_LIBS ICU::i18n ICU::data ICU::uc)
+endif()
+
+if (SPM_ENABLE_TCMALLOC)
+  if (SPM_TCMALLOC_STATIC)
+    find_library(TCMALLOC_LIB NAMES libtcmalloc_minimal.a)
+  else()
+    find_library(TCMALLOC_LIB NAMES tcmalloc_minimal)
+  endif()
+  if (TCMALLOC_LIB)
+    message(STATUS "Found TCMalloc: ${TCMALLOC_LIB}")
+    list(APPEND SPM_LIBS ${TCMALLOC_LIB})
+    add_definitions(-fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-free)
+  else()
+    message(STATUS "Not Found TCMalloc: ${TCMALLOC_LIB}")
+  endif()
+endif()
+
+if (SPM_ENABLE_SHARED)
+  add_library(sentencepiece SHARED ${SPM_SRCS})
+  add_library(sentencepiece_train SHARED ${SPM_TRAIN_SRCS})
+endif()
+
+add_library(sentencepiece-static STATIC ${SPM_SRCS})
+add_library(sentencepiece_train-static STATIC ${SPM_TRAIN_SRCS})
+
+target_link_libraries(sentencepiece-static INTERFACE ${SPM_LIBS})
+target_link_libraries(sentencepiece_train-static INTERFACE sentencepiece-static ${SPM_LIBS})
+
+if (SPM_ENABLE_SHARED)
+  target_link_libraries(sentencepiece ${SPM_LIBS})
+  target_link_libraries(sentencepiece_train ${SPM_LIBS} sentencepiece)
+  set(SPM_INSTALLTARGETS sentencepiece sentencepiece_train sentencepiece-static sentencepiece_train-static)
+  set_target_properties(sentencepiece sentencepiece_train PROPERTIES SOVERSION 0 VERSION 0.0.0)
+  set_target_properties(sentencepiece PROPERTIES WINDOWS_EXPORT_ALL_SYMBOLS YES)
+  set_target_properties(sentencepiece_train PROPERTIES WINDOWS_EXPORT_ALL_SYMBOLS YES)
+  if (MSVC)
+    set_target_properties(sentencepiece PROPERTIES IMPORT_SUFFIX "_import.lib")
+    set_target_properties(sentencepiece_train PROPERTIES IMPORT_SUFFIX "_import.lib")
+  elseif (MINGW)
+    set_target_properties(sentencepiece PROPERTIES IMPORT_SUFFIX ".dll.a")
+    set_target_properties(sentencepiece_train PROPERTIES IMPORT_SUFFIX ".dll.a")
+  endif()
+else()
+  add_library(sentencepiece ALIAS sentencepiece-static)
+  add_library(sentencepiece_train ALIAS sentencepiece_train-static)
+  set(SPM_INSTALLTARGETS sentencepiece-static sentencepiece_train-static)
+endif()
+
+set_target_properties(sentencepiece-static PROPERTIES OUTPUT_NAME "sentencepiece")
+set_target_properties(sentencepiece_train-static PROPERTIES OUTPUT_NAME "sentencepiece_train")
+
+if (NOT MSVC)
+  if (SPM_COVERAGE)
+    set(CMAKE_CXX_FLAGS "-O0 -Wall -fPIC -coverage ${CMAKE_CXX_FLAGS}")
+  else()
+    set(CMAKE_CXX_FLAGS "-O3 -Wall -fPIC ${CMAKE_CXX_FLAGS}")
+  endif()
+  if (SPM_ENABLE_TENSORFLOW_SHARED)
+    add_definitions(-D_GLIBCXX_USE_CXX11_ABI=0)
+  endif()
+  if (SPM_NO_THREADLOCAL)
+    add_definitions(-DSPM_NO_THREADLOCAL=1)
+    add_definitions(-DGOOGLE_PROTOBUF_NO_THREADLOCAL=1)
+  endif()
+  set_source_files_properties(
+    sentencepiece.pb.cc sentencepiece_model.pb.cc
+    PROPERTIES COMPILE_FLAGS "-Wno-misleading-indentation")
+  set_source_files_properties(${SPM_TEST_SRCS}
+    PROPERTIES COMPILE_FLAGS "-Wno-sign-compare")
+  if (SPM_ENABLE_SHARED)
+    set_property(TARGET sentencepiece APPEND_STRING PROPERTY COMPILE_FLAGS " -DPIC")
+    set_property(TARGET sentencepiece_train APPEND_STRING PROPERTY COMPILE_FLAGS " -DPIC")
+  endif()
+endif()
+
+add_executable(spm_encode spm_encode_main.cc)
+add_executable(spm_decode spm_decode_main.cc)
+add_executable(spm_normalize spm_normalize_main.cc)
+add_executable(spm_train spm_train_main.cc)
+add_executable(spm_export_vocab spm_export_vocab_main.cc)
+
+target_link_libraries(spm_encode sentencepiece)
+target_link_libraries(spm_decode sentencepiece)
+target_link_libraries(spm_normalize sentencepiece sentencepiece_train)
+target_link_libraries(spm_train sentencepiece sentencepiece_train)
+target_link_libraries(spm_export_vocab sentencepiece)
+
+if (SPM_ENABLE_NFKC_COMPILE)
+  add_executable(compile_charsmap compile_charsmap_main.cc)
+  target_link_libraries(compile_charsmap sentencepiece sentencepiece_train)
+endif()
+
+list(APPEND SPM_INSTALLTARGETS
+  spm_encode spm_decode spm_normalize spm_train spm_export_vocab)
+
+install(TARGETS ${SPM_INSTALLTARGETS}
+  RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
+  LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
+  ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR})
+install(FILES sentencepiece_trainer.h sentencepiece_processor.h
+  DESTINATION ${CMAKE_INSTALL_INCDIR})
+
+file(TO_NATIVE_PATH "${PROJECT_SOURCE_DIR}/data" data_dir)
+
+if (SPM_BUILD_TEST OR SPM_COVERAGE)
+  enable_testing()
+  add_executable(spm_test test_main.cc ${SPM_TEST_SRCS})
+
+  if (SPM_COVERAGE)
+    target_link_libraries(spm_test sentencepiece sentencepiece_train "-lgcov")
+  else()
+    target_link_libraries(spm_test sentencepiece sentencepiece_train)
+  endif()
+
+  set(MEMORYCHECK_COMMAND_OPTIONS "--leak-check=full --show-leak-kinds=definite,possible --error-exitcode=1")
+  find_program(CTEST_MEMORYCHECK_COMMAND NAMES valgrind)
+  include(Dart)
+
+  add_test(NAME sentencepiece_test
+    COMMAND $<TARGET_FILE:spm_test> --data_dir=${data_dir})
+endif()
+
+if (SPM_COVERAGE)
+  add_custom_target(coverage
+    COMMAND mkdir -p coverage
+    COMMAND $<TARGET_FILE:spm_test> --data_dir=${data_dir}
+    COMMAND lcov -c -d . -o coverage.info
+    COMMAND lcov --remove coverage.info "include*" "/c++" "_test*" "testharness*" "third_party*" ".pb.*" -o coverage.info
+    COMMAND mkdir -p lcov_html
+    COMMAND genhtml -o lcov_html coverage.info)
+  add_dependencies(coverage spm_test)
+endif()

cc-multilingual-main/cc_net/third_party/sentencepiece/src/bpe_model.cc

@@ -0,0 +1,189 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "bpe_model.h"
+
+#include <functional>
+#include <memory>
+#include <queue>
+#include <unordered_map>
+#include <utility>
+#include <vector>
+#include "freelist.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace bpe {
+
+Model::Model(const ModelProto &model_proto) {
+  model_proto_ = &model_proto;
+  InitializePieces();
+}
+
+Model::~Model() {}
+
+std::vector<std::pair<absl::string_view, int>> Model::Encode(
+    absl::string_view normalized) const {
+  if (!status().ok() || normalized.empty()) {
+    return {};
+  }
+
+  struct SymbolPair {
+    int left;     // left index of this pair
+    int right;    // right index of this pair
+    float score;  // score of this pair. large is better.
+    size_t size;  // length of this piece
+  };
+
+  class SymbolPairComparator {
+   public:
+    const bool operator()(SymbolPair *h1, SymbolPair *h2) {
+      return (h1->score < h2->score ||
+              (h1->score == h2->score && h1->left > h2->left));
+    }
+  };
+
+  struct Symbol {
+    int prev;     // prev index of this symbol. -1 for BOS.
+    int next;     // next index of tihs symbol. -1 for EOS.
+    bool freeze;  // this symbol is never be merged.
+    absl::string_view piece;
+  };
+
+  using Agenda = std::priority_queue<SymbolPair *, std::vector<SymbolPair *>,
+                                     SymbolPairComparator>;
+  Agenda agenda;
+  std::vector<Symbol> symbols;
+  symbols.reserve(normalized.size());
+
+  // Reverse merge rules.
+  // key: merged symbol, value: pair of original symbols.
+  std::unordered_map<absl::string_view,
+                     std::pair<absl::string_view, absl::string_view>,
+                     string_util::string_view_hash>
+      rev_merge;
+
+  // Pre-allocates SymbolPair for efficiency.
+  constexpr size_t kPreallocateSymbolPairSize = 256;
+  model::FreeList<SymbolPair> symbol_pair_allocator(kPreallocateSymbolPairSize);
+
+  // Lookup new symbol pair at [left, right] and inserts it to agenda.
+  auto MaybeAddNewSymbolPair = [this, &symbol_pair_allocator, &symbols, &agenda,
+                                &rev_merge](int left, int right) {
+    if (left == -1 || right == -1 || symbols[left].freeze ||
+        symbols[right].freeze)
+      return;
+    const absl::string_view piece(
+        symbols[left].piece.data(),
+        symbols[left].piece.size() + symbols[right].piece.size());
+    const auto it = pieces_.find(piece);
+    if (it == pieces_.end()) {
+      return;
+    }
+    auto *h = symbol_pair_allocator.Allocate();
+    h->left = left;
+    h->right = right;
+    h->score = GetScore(it->second);
+    h->size = piece.size();
+    agenda.push(h);
+
+    // Makes `rev_merge` for resegmentation.
+    if (IsUnusedInlined(it->second)) {
+      rev_merge[piece] =
+          std::make_pair(symbols[left].piece, symbols[right].piece);
+    }
+  };
+
+  // Splits the input into character sequence
+  int index = 0;
+  while (!normalized.empty()) {
+    Symbol s;
+    const int mblen = matcher_->PrefixMatch(normalized, &s.freeze);
+    s.piece = absl::string_view(normalized.data(), mblen);
+    s.prev = index == 0 ? -1 : index - 1;
+    normalized.remove_prefix(mblen);
+    s.next = normalized.empty() ? -1 : index + 1;
+    ++index;
+    symbols.emplace_back(s);
+  }
+
+  if (symbols.empty()) {
+    return {};
+  }
+
+  // Lookup all bigrams.
+  for (size_t i = 1; i < symbols.size(); ++i) {
+    MaybeAddNewSymbolPair(i - 1, i);
+  }
+
+  // Main loop.
+  while (!agenda.empty()) {
+    SymbolPair *top = agenda.top();
+    agenda.pop();
+
+    // `top` is no longer available.
+    if (symbols[top->left].piece.empty() || symbols[top->right].piece.empty() ||
+        symbols[top->left].piece.size() + symbols[top->right].piece.size() !=
+            top->size) {
+      continue;
+    }
+
+    // Replaces symbols with `top` rule.
+    symbols[top->left].piece = absl::string_view(
+        symbols[top->left].piece.data(),
+        symbols[top->left].piece.size() + symbols[top->right].piece.size());
+
+    // Updates prev/next pointers.
+    symbols[top->left].next = symbols[top->right].next;
+    if (symbols[top->right].next >= 0) {
+      symbols[symbols[top->right].next].prev = top->left;
+    }
+    symbols[top->right].piece = absl::string_view("");
+
+    // Adds new symbol pairs which are newly added after symbol replacement.
+    MaybeAddNewSymbolPair(symbols[top->left].prev, top->left);
+    MaybeAddNewSymbolPair(top->left, symbols[top->left].next);
+  }
+
+  std::function<void(absl::string_view, EncodeResult *)> resegment;
+  resegment = [this, &resegment, &rev_merge](absl::string_view w,
+                                             EncodeResult *output) -> void {
+    const int id = PieceToId(w);
+    if (id == -1 || !IsUnusedInlined(id)) {
+      output->emplace_back(w, id);
+      return;
+    }
+    const auto p = rev_merge.find(w);
+    if (p == rev_merge.end()) {
+      // This block will never be called, as `rev_merge` stores all the
+      // resegmentation info for unused id.
+      output->emplace_back(w, id);
+      return;
+    }
+    // Recursively resegment left and right symbols.
+    resegment(p->second.first, output);
+    resegment(p->second.second, output);
+  };
+
+  EncodeResult output;
+  for (int index = 0; index != -1; index = symbols[index].next) {
+    CHECK_GE(index, 0);
+    CHECK_LT(index, static_cast<int>(symbols.size()));
+    resegment(symbols[index].piece, &output);
+  }
+
+  return output;
+}
+}  // namespace bpe
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/bpe_model_trainer.h

@@ -0,0 +1,125 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef BPE_MODEL_TRAINER_H_
+#define BPE_MODEL_TRAINER_H_
+
+#include <set>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+#include "sentencepiece_model.pb.h"
+#include "trainer_interface.h"
+
+namespace sentencepiece {
+namespace bpe {
+
+// Trainer class for BPE model.
+class Trainer : public TrainerInterface {
+ public:
+  Trainer(const TrainerSpec &trainer_spec,
+          const NormalizerSpec &normalizer_spec)
+      : TrainerInterface::TrainerInterface(trainer_spec, normalizer_spec) {}
+
+  util::Status Train() override;
+
+ private:
+  // Symbol represents a character or symbol bigram.
+  struct Symbol {
+    const Symbol *left;              // left symbol in bigram
+    const Symbol *right;             // right symbol in bigram
+    string_util::UnicodeText chars;  // all flattend chracter sequence
+    bool is_unk;                     // true if this symbol is unknown.
+    uint64 fp;                       // fingerprint of this symbol.
+    uint64 freq;                     // frequency of this symbol.
+
+    // Position list. Use set so that we can keep the order of occurrence.
+    // See EncodePos/DecodePos.
+    std::set<uint64> positions;
+
+    bool IsBigram() const { return left != nullptr && right != nullptr; }
+    std::string ToString() const;
+    Symbol() : left(nullptr), right(nullptr), is_unk(false), fp(0), freq(0) {}
+  };
+
+  struct Position {
+    int sid;    // sentence id
+    int left;   // left symbol index
+    int right;  // right symbol index
+  };
+
+  // Encodes sid, left and right bigram index into uint64.
+  // Encoded value keeps the order of sid, left and right.
+  static uint64 EncodePos(int sid, int l, int r) {
+    CHECK_GE(l, 0);
+    CHECK_GE(r, 0);
+    CHECK_LE(l, kuint16max);
+    CHECK_LE(r, kuint16max);
+    const uint64 n = (static_cast<uint64>(sid) << 32 | (l << 16 | r));
+    return n;
+  }
+
+  // Decodes sid, left and right bigram index from uint64.
+  static Position DecodePos(uint64 n) {
+    Position p;
+    p.sid = n >> 32;
+    p.left = (n >> 16) & 0xffff;
+    p.right = n & 0xffff;
+    return p;
+  }
+
+  // Gets unary (character) symbol from the char code |c|.
+  // The return value is cached.
+  Symbol *GetCharSymbol(char32 c);
+
+  // Gets symbol pair from left/right symbols. The return value is cached.
+  Symbol *GetPairSymbol(const Symbol *left, const Symbol *right);
+
+  // Computes the frequency of |symbol| and update symbol->freq field.
+  void ComputeFreq(Symbol *symbol) const;
+
+  // Returns the valid index before symbols_[sid][index].
+  int GetNextIndex(int sid, int index) const;
+
+  // Returns the valid index after symbols_[sid][index].
+  int GetPrevIndex(int sid, int index) const;
+
+  // Makes a new bigram from [symbols_[sid][left], symbols_[sid][right]] and
+  // Adds it to symbols_cache_ and active_symbols_.
+  void AddNewPair(int sid, int left, int right);
+
+  // Resets the fequency of bigram [symbols_[sid][left] symbols_[sid][right]],
+  // if this bigram is not |best|.
+  void ResetFreq(int sid, int left, int right, const Symbol *best);
+
+  // Updates |active_symbols_| by copying the top 5% frequent symbols in
+  // symbols_cache_.
+  void UpdateActiveSymbols();
+
+  // All unique symbols. Key is a fingerprint of Symbol.
+  std::unordered_map<uint64, Symbol *> symbols_cache_;
+
+  // Set of symbols from which we find the best symbol in each iteration.
+  std::set<Symbol *> active_symbols_;
+
+  // Stores symbols allocated in heap so that we can delete them at onece.
+  std::vector<Symbol *> allocated_;
+
+  // Sentences. symbols_[sid][index] stores a symbol in sentence_[sid][index].
+  std::vector<std::vector<Symbol *>> symbols_;
+};
+}  // namespace bpe
+}  // namespace sentencepiece
+#endif  // BPE_MODEL_TRAINER_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/bpe_model_trainer_test.cc

@@ -0,0 +1,129 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "bpe_model_trainer.h"
+
+#include <string>
+#include <vector>
+#include "filesystem.h"
+#include "flags.h"
+#include "sentencepiece_processor.h"
+#include "sentencepiece_trainer.h"
+#include "testharness.h"
+#include "util.h"
+
+DECLARE_string(data_dir);
+
+namespace sentencepiece {
+namespace bpe {
+namespace {
+
+// Space symbol
+#define WS "\xe2\x96\x81"
+
+std::string RunTrainer(
+    const std::vector<std::string> &input, int size,
+    const std::vector<std::string> &user_defined_symbols = {}) {
+  test::ScopedTempFile input_scoped_file("input");
+  test::ScopedTempFile model_scoped_file("model");
+  const std::string input_file = input_scoped_file.filename();
+  const std::string model_prefix = model_scoped_file.filename();
+  {
+    auto output = filesystem::NewWritableFile(input_file);
+    for (const auto &line : input) {
+      output->WriteLine(line);
+    }
+  }
+
+  TrainerSpec trainer_spec;
+  trainer_spec.set_model_type(TrainerSpec::BPE);
+  trainer_spec.add_input(input_file);
+  trainer_spec.set_vocab_size(size - 3);  // remove <unk>, <s>, </s>
+  trainer_spec.set_model_prefix(model_prefix);
+
+  NormalizerSpec normalizer_spec;
+  normalizer_spec.set_name("identity");
+  normalizer_spec.set_add_dummy_prefix(false);
+
+  for (const auto &w : user_defined_symbols) {
+    trainer_spec.add_user_defined_symbols(w);
+  }
+
+  Trainer trainer(trainer_spec, normalizer_spec);
+  EXPECT_OK(trainer.Train());
+
+  SentencePieceProcessor processor;
+  EXPECT_OK(processor.Load(model_prefix + ".model"));
+
+  const auto &model = processor.model_proto();
+  std::vector<std::string> pieces;
+
+  // remove <unk>, <s>, </s>
+  for (int i = 3; i < model.pieces_size(); ++i) {
+    pieces.emplace_back(model.pieces(i).piece());
+  }
+
+  return string_util::Join(pieces, " ");
+}
+
+TEST(BPETrainerTest, BasicTest) {
+  EXPECT_EQ("ab ra abra ad cad abracad abracadabra ac br a b r c d",
+            RunTrainer({"abracadabra"}, 20));
+  EXPECT_EQ("ap le app apple en in ine pen p e a l n i",
+            RunTrainer({"pen", "pineapple", "apple"}, 20));
+  EXPECT_EQ("he ll llo hello hellohe el lo oh hel ohe e h l o",
+            RunTrainer({"hellohe"}, 20));
+  EXPECT_EQ("app le en in ine pen pine ne pe e l n p i",
+            RunTrainer({"pen", "pineapple", "apple"}, 20, {"app"}));
+}
+
+TEST(BPETrainerTest, EndToEndTest) {
+  const test::ScopedTempFile sf("tmp_model");
+  const std::string input =
+      util::JoinPath(FLAGS_data_dir, "wagahaiwa_nekodearu.txt");
+
+  EXPECT_OK(SentencePieceTrainer::Train(string_util::StrCat(
+      "--model_prefix=", sf.filename(), " --input=", input,
+      " --vocab_size=8000 --normalization_rule_name=identity"
+      " --model_type=bpe --control_symbols=<ctrl> "
+      "--max_sentence_length=2048")));
+
+  SentencePieceProcessor sp;
+  EXPECT_OK(sp.Load(std::string(sf.filename()) + ".model"));
+  EXPECT_EQ(8000, sp.GetPieceSize());
+
+  const int cid = sp.PieceToId("<ctrl>");
+  EXPECT_TRUE(sp.IsControl(cid));
+
+  std::vector<std::string> tok;
+  EXPECT_OK(sp.Encode("", &tok));
+  EXPECT_TRUE(tok.empty());
+
+  EXPECT_OK(sp.Encode(
+      "吾輩《わがはい》は猫である。名前はまだ無い。"
+      "どこで生れたかとんと見当《けんとう》がつかぬ。"
+      "何でも薄暗いじめじめした所でニャーニャー泣いていた事だけは記憶している"
+      "。",
+      &tok));
+  EXPECT_EQ(WS
+            " 吾輩 《 わが はい 》 は猫 である 。 名前 はまだ 無い 。 "
+            "どこで 生 れた か とん と見 当 《 けんとう 》 が つかぬ 。 "
+            "何でも 薄 暗 いじ め じ め した 所で ニャー ニャー 泣 いていた "
+            "事 だけは 記憶 している 。",
+            string_util::Join(tok, " "));
+}
+
+}  // namespace
+}  // namespace bpe
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/builder.cc

@@ -0,0 +1,581 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "builder.h"
+#include <algorithm>
+#include <functional>
+#include <utility>
+#include "filesystem.h"
+
+#include "config.h"
+
+#ifdef ENABLE_NFKC_COMPILE
+#include <unicode/errorcode.h>
+#include <unicode/locid.h>
+#include <unicode/normlzr.h>
+#include <unicode/numfmt.h>
+#include <unicode/rbnf.h>
+#include <unicode/utypes.h>
+#endif
+
+#include <set>
+
+#include "normalization_rule.h"
+#include "normalizer.h"
+#include "third_party/darts_clone/darts.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace normalizer {
+namespace {
+
+constexpr int kMaxUnicode = 0x10FFFF;
+
+static constexpr char kDefaultNormalizerName[] = "nfkc";
+
+#ifdef ENABLE_NFKC_COMPILE
+// Normalize `input` with ICU's normalizer with `mode`.
+Builder::Chars UnicodeNormalize(UNormalizationMode mode,
+                                const Builder::Chars &input) {
+  const std::string utf8 = string_util::UnicodeTextToUTF8(input);
+  CHECK(!utf8.empty());
+
+  icu::UnicodeString ustr;
+  const size_t utf8_length = utf8.size();
+  UChar *utf16 = ustr.getBuffer(utf8.size() + 1);
+  int32 utf16_length = 0;
+  icu::ErrorCode icuerrorcode;
+  u_strFromUTF8Lenient(utf16, ustr.getCapacity(), &utf16_length, utf8.data(),
+                       utf8_length, icuerrorcode);
+  ustr.releaseBuffer(utf16_length);
+
+  UErrorCode status = U_ZERO_ERROR;
+  icu::UnicodeString dst;
+  icu::Normalizer::normalize(ustr, mode, 0, dst, status);
+  CHECK(U_SUCCESS(status));
+  std::string normalized;
+  normalized.reserve(dst.length() * 3);
+  dst.toUTF8String(normalized);
+  return string_util::UTF8ToUnicodeText(normalized);
+}
+
+Builder::Chars ToNFKD(const Builder::Chars &input) {
+  return UnicodeNormalize(UNORM_NFKD, input);
+}
+
+Builder::Chars ToNFKC(const Builder::Chars &input) {
+  return UnicodeNormalize(UNORM_NFKC, input);
+}
+
+Builder::Chars ToNFC(const Builder::Chars &input) {
+  return UnicodeNormalize(UNORM_NFC, input);
+}
+
+Builder::Chars ToNFD(const Builder::Chars &input) {
+  return UnicodeNormalize(UNORM_NFD, input);
+}
+
+// Given an NFKD-normalized string, returns a set of all strings which are
+// normalized into the same `nfkd`. `norm2orig` is the normalized to
+// un-normalized character mapping.
+std::vector<Builder::Chars> ExpandUnnormalized(
+    const Builder::Chars &nfkd,
+    const std::map<char32, std::set<char32>> &norm2orig) {
+  CHECK(!nfkd.empty());
+  std::vector<Builder::Chars> results;
+  for (const auto c : port::FindOrDie(norm2orig, nfkd[0])) {
+    results.push_back({c});
+  }
+  for (size_t i = 1; i < nfkd.size(); ++i) {
+    const auto &orig = port::FindOrDie(norm2orig, nfkd[i]);
+    std::vector<Builder::Chars> new_results;
+    for (const auto &r : results) {
+      for (const auto c : orig) {
+        new_results.emplace_back(r);
+        new_results.back().push_back(c);
+      }
+    }
+    results = std::move(new_results);
+  }
+  CHECK_EQ(nfkd.size(), results[0].size());
+  return results;
+}
+#endif
+
+// Normalizes `src` with `chars_map` and returns normalized Chars.
+// `max_len` specifies the maximum length of the key in `chars_map`.
+Builder::Chars Normalize(const Builder::CharsMap &chars_map,
+                         const Builder::Chars &src, int max_len) {
+  CHECK_GE(max_len, 1);
+  Builder::Chars normalized;
+
+  for (size_t i = 0; i < src.size();) {
+    Builder::CharsMap::const_iterator it = chars_map.end();
+    const size_t slice = std::min<size_t>(i + max_len, src.size());
+    // starts with the longest prefix.
+    Builder::Chars key(src.begin() + i, src.begin() + slice);
+    while (!key.empty()) {
+      it = chars_map.find(key);
+      if (it != chars_map.end()) {
+        break;
+      }
+      key.pop_back();  // remove the last character.
+    }
+
+    // Consumes one character when no rule is found.
+    if (it == chars_map.end()) {
+      normalized.push_back(src[i]);
+      ++i;
+    } else {
+      std::copy(it->second.begin(), it->second.end(),
+                std::back_inserter(normalized));
+      i += it->first.size();
+    }
+  }
+
+  return normalized;
+}
+}  // namespace
+
+// static
+util::Status Builder::CompileCharsMap(const CharsMap &chars_map,
+                                      std::string *output) {
+  CHECK_OR_RETURN(output);
+  CHECK_OR_RETURN(!chars_map.empty());
+
+  LOG(INFO) << "Loading CharsMap of size=" << chars_map.size();
+
+  // Aggregates the same target strings to save footprint.
+  std::map<Chars, int> normalized2pos;
+  for (const auto &p : chars_map) {
+    normalized2pos[p.second] = 0;
+  }
+
+  std::string normalized;
+  for (auto &p : normalized2pos) {
+    p.second = normalized.size();  // stores the pointer (position).
+    const std::string utf8_out = string_util::UnicodeTextToUTF8(p.first);
+    CHECK_OR_RETURN(string_util::IsStructurallyValid(utf8_out));
+    normalized += utf8_out;
+    normalized += '\0';
+  }
+
+  std::vector<std::pair<std::string, int>> kv;  // key-value of Trie.
+  for (const auto &p : chars_map) {
+    // The value of Trie stores the pointer to the normalized string.
+    const std::string utf8_in = string_util::UnicodeTextToUTF8(p.first);
+    CHECK_OR_RETURN(!utf8_in.empty());
+    CHECK_OR_RETURN(string_util::IsStructurallyValid(utf8_in));
+    kv.emplace_back(utf8_in, port::FindOrDie(normalized2pos, p.second));
+  }
+
+  std::sort(kv.begin(), kv.end());
+  std::vector<const char *> key(kv.size());
+  std::vector<int> value(kv.size());
+  for (size_t i = 0; i < kv.size(); ++i) {
+    key[i] = kv[i].first.c_str();
+    value[i] = kv[i].second;
+  }
+
+  Darts::DoubleArray trie;
+  CHECK_EQ_OR_RETURN(0, trie.build(key.size(), const_cast<char **>(&key[0]),
+                                   nullptr, &value[0]))
+      << "cannot build double-array";
+
+  int max_nodes_size = 0;
+  std::vector<Darts::DoubleArray::result_pair_type> results(
+      2 * Normalizer::kMaxTrieResultsSize);
+  for (const char *str : key) {
+    const int num_nodes = trie.commonPrefixSearch(str, results.data(),
+                                                  results.size(), strlen(str));
+    max_nodes_size = std::max(num_nodes, max_nodes_size);
+  }
+  CHECK_LT_OR_RETURN(max_nodes_size, Normalizer::kMaxTrieResultsSize)
+      << "This charmaps contain many shared prefix. "
+      << "The number of shared prefix must be less than "
+      << Normalizer::kMaxTrieResultsSize;
+
+  absl::string_view trie_blob(static_cast<const char *>(trie.array()),
+                              trie.size() * trie.unit_size());
+  *output = Normalizer::EncodePrecompiledCharsMap(trie_blob, normalized);
+
+  LOG(INFO) << "Generated normalizer blob. size=" << output->size();
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::DecompileCharsMap(absl::string_view blob,
+                                        Builder::CharsMap *chars_map) {
+  CHECK_OR_RETURN(chars_map);
+  chars_map->clear();
+
+  absl::string_view trie_blob, normalized;
+  RETURN_IF_ERROR(
+      Normalizer::DecodePrecompiledCharsMap(blob, &trie_blob, &normalized));
+
+  Darts::DoubleArray trie;
+  trie.set_array(const_cast<char *>(trie_blob.data()),
+                 trie_blob.size() / trie.unit_size());
+
+  std::string key;
+  std::function<void(size_t, size_t)> traverse;
+
+  // Given a Trie node at `node_pos` and the key position at `key_position`,
+  // Expands children nodes from `node_pos`.
+  // When leaf nodes are found, stores them into `chars_map`.
+  traverse = [&traverse, &key, &trie, &normalized, &chars_map](
+                 size_t node_pos, size_t key_pos) -> void {
+    for (int c = 0; c <= 255; ++c) {
+      key.push_back(static_cast<char>(c));
+      size_t copied_node_pos = node_pos;
+      size_t copied_key_pos = key_pos;
+      // Note: `copied_(node|key)_pos` are non-const references.
+      // They store the new positions after node traversal.
+      const Darts::DoubleArray::result_type result = trie.traverse(
+          key.data(), copied_node_pos, copied_key_pos, key.size());
+      if (result >= -1) {   // node exists.
+        if (result >= 0) {  // has a value after transition.
+          const absl::string_view value = normalized.data() + result;
+          Chars key_chars, value_chars;
+          for (const auto c : string_util::UTF8ToUnicodeText(key))
+            key_chars.push_back(c);
+          for (const auto c : string_util::UTF8ToUnicodeText(value))
+            value_chars.push_back(c);
+          (*chars_map)[key_chars] = value_chars;
+        }
+        // Recursively traverse.
+        traverse(copied_node_pos, copied_key_pos);
+      }
+      key.pop_back();
+    }
+  };
+
+  traverse(0, 0);
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::GetPrecompiledCharsMap(const std::string &name,
+                                             std::string *output) {
+  CHECK_OR_RETURN(output);
+
+  if (name == "identity") {
+    output->clear();
+    return util::OkStatus();
+  }
+
+  std::string result;
+  for (size_t i = 0; i < kNormalizationRules_size; ++i) {
+    const auto *blob = &kNormalizationRules_blob[i];
+    if (blob->name == name) {
+      output->assign(blob->data, blob->size);
+      return util::OkStatus();
+    }
+  }
+  return util::StatusBuilder(util::error::NOT_FOUND)
+         << "No precompiled charsmap is found: " << name;
+}
+
+// static
+util::Status Builder::BuildNFKCMap(CharsMap *chars_map) {
+#ifdef ENABLE_NFKC_COMPILE
+  LOG(INFO) << "Running BuildNFKCMap";
+
+  // Set of fully NFKD decomposed characters.
+  std::set<Builder::Chars> nfkd_decomposed;
+
+  // Fully normalized one character to unnormalized one character map.
+  std::map<char32, std::set<char32>> norm2orig;
+
+  Builder::CharsMap nfkc_map;  // The final NFKC mapping.
+
+  constexpr int kMaxUnicode = 0x10FFFF;
+  for (char32 cp = 1; cp <= kMaxUnicode; ++cp) {
+    if (!U_IS_UNICODE_CHAR(cp)) {
+      continue;
+    }
+    // Aggregates single character to fully NFKC normalized characters.
+    const auto nfkc = ToNFKC({cp});
+    if (nfkc.size() >= 2 || (nfkc.size() == 1 && nfkc[0] != cp)) {
+      nfkc_map[{cp}] = nfkc;
+    }
+    const auto nfkd = ToNFKD({cp});
+    if (nfkd.size() == 1) {
+      // Aggregates reverse mapping from normalized to unnormalized character.
+      norm2orig[nfkd[0]].insert(cp);
+    } else {
+      // One character is decomposed into multiple characters.
+      nfkd_decomposed.insert(nfkd);
+    }
+  }
+
+  for (const auto &nfkd : nfkd_decomposed) {
+    const auto nfkc = ToNFC(nfkd);
+    // This case is already covered by single-character to NFKC mapping.
+    if (nfkc == nfkd) {
+      continue;
+    }
+    // Expand all possible sequences which are normalized into the same
+    // `nfkd`.
+    for (const auto &nfkd_orig : ExpandUnnormalized(nfkd, norm2orig)) {
+      if (nfkd_orig != nfkc) {
+        nfkc_map[nfkd_orig] = nfkc;
+      }
+    }
+  }
+
+  RETURN_IF_ERROR(RemoveRedundantMap(&nfkc_map));
+  *chars_map = std::move(nfkc_map);
+
+#else
+  LOG(ERROR) << "NFKC compile is not enabled."
+             << " rebuild with ./configure --enable-nfkc-compile";
+#endif
+
+  return util::OkStatus();
+}
+
+util::Status Builder::BuildNmtNFKCMap(CharsMap *chars_map) {
+#ifdef ENABLE_NFKC_COMPILE
+  LOG(INFO) << "Running BuildNmtNFKCMap";
+
+  CharsMap nfkc_map;
+  RETURN_IF_ERROR(Builder::BuildNFKCMap(&nfkc_map));
+
+  // Other code points considered as whitespace.
+  nfkc_map[{0x0009}] = {0x20};  // TAB
+  nfkc_map[{0x000A}] = {0x20};  // LINE FEED
+  nfkc_map[{0x000C}] = {0x20};  // FORM FEED
+  nfkc_map[{0x000D}] = {0x20};  // CARRIAGE RETURN
+  nfkc_map[{0x1680}] = {0x20};  // OGHAM SPACE MARK
+  nfkc_map[{0x200B}] = {0x20};  // ZERO WIDTH SPACE
+  nfkc_map[{0x200E}] = {0x20};  // LEFT-TO-RIGHT MARK
+  nfkc_map[{0x200F}] = {0x20};  // RIGHT-TO-LEFT MARK
+  nfkc_map[{0x2028}] = {0x20};  // LINE SEPARATOR
+  nfkc_map[{0x2029}] = {0x20};  // PARAGRAPH SEPARATOR
+  nfkc_map[{0x2581}] = {0x20};  // LOWER ONE EIGHT BLOCK
+  nfkc_map[{0xFEFF}] = {0x20};  // ZERO WIDTH NO-BREAK
+  nfkc_map[{0xFFFD}] = {0x20};  // REPLACEMENT CHARACTER
+  nfkc_map[{0x200C}] = {0x20};  // ZERO WIDTH NON-JOINER
+  nfkc_map[{0x200D}] = {0x20};  // ZERO WIDTH JOINER
+
+  // Ascii Control characters
+  nfkc_map[{0x0001}] = {};
+  nfkc_map[{0x0002}] = {};
+  nfkc_map[{0x0003}] = {};
+  nfkc_map[{0x0004}] = {};
+  nfkc_map[{0x0005}] = {};
+  nfkc_map[{0x0006}] = {};
+  nfkc_map[{0x0007}] = {};
+  nfkc_map[{0x0008}] = {};
+  nfkc_map[{0x000B}] = {};
+  nfkc_map[{0x000E}] = {};
+  nfkc_map[{0x000F}] = {};
+  nfkc_map[{0x0010}] = {};
+  nfkc_map[{0x0011}] = {};
+  nfkc_map[{0x0012}] = {};
+  nfkc_map[{0x0013}] = {};
+  nfkc_map[{0x0014}] = {};
+  nfkc_map[{0x0015}] = {};
+  nfkc_map[{0x0016}] = {};
+  nfkc_map[{0x0017}] = {};
+  nfkc_map[{0x0018}] = {};
+  nfkc_map[{0x0019}] = {};
+  nfkc_map[{0x001A}] = {};
+  nfkc_map[{0x001B}] = {};
+  nfkc_map[{0x001C}] = {};
+  nfkc_map[{0x001D}] = {};
+  nfkc_map[{0x001E}] = {};
+  nfkc_map[{0x001F}] = {};
+
+  //  <control-007F>..<control-009F>
+  nfkc_map[{0x007F}] = {};
+  nfkc_map[{0x008F}] = {};
+  nfkc_map[{0x009F}] = {};
+
+  // Do not normalize FULL_WIDTH TILDE, since FULL_WIDTH TILDE
+  // and HALF_WIDTH TILDE are used differently in Japanese.
+  nfkc_map.erase({0xFF5E});
+
+  RETURN_IF_ERROR(RemoveRedundantMap(&nfkc_map));
+
+  *chars_map = std::move(nfkc_map);
+
+#else
+  LOG(ERROR) << "NFKC compile is not enabled."
+             << " rebuild with ./configure --enable-nfkc-compile";
+#endif
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::MergeUnicodeCaseFoldMap(Builder::CharsMap *chars_map) {
+#ifdef ENABLE_NFKC_COMPILE
+  for (auto &c : *chars_map) {
+    std::vector<char32> trg;
+    for (char32 c : c.second) trg.push_back(u_foldCase(c, U_FOLD_CASE_DEFAULT));
+    c.second = trg;
+  }
+
+  constexpr int kMaxUnicode = 0x10FFFF;
+  for (char32 cp = 1; cp <= kMaxUnicode; ++cp) {
+    if (!U_IS_UNICODE_CHAR(cp)) {
+      continue;
+    }
+    if (chars_map->find({cp}) != chars_map->end()) continue;
+    const char32 trg = u_foldCase(cp, U_FOLD_CASE_DEFAULT);
+    if (trg != cp) (*chars_map)[{cp}] = {trg};
+  }
+
+  RETURN_IF_ERROR(RemoveRedundantMap(chars_map));
+#endif
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::BuildNFKC_CFMap(CharsMap *chars_map) {
+#ifdef ENABLE_NFKC_COMPILE
+  CharsMap nfkc_map;
+  RETURN_IF_ERROR(Builder::BuildNFKCMap(&nfkc_map));
+  RETURN_IF_ERROR(Builder::MergeUnicodeCaseFoldMap(&nfkc_map));
+  *chars_map = std::move(nfkc_map);
+#else
+  LOG(ERROR) << "NFKC_CF compile is not enabled."
+             << " rebuild with ./configure --enable-nfkc-compile";
+#endif
+
+  return util::OkStatus();
+}
+
+//  static
+util::Status Builder::BuildNmtNFKC_CFMap(CharsMap *chars_map) {
+#ifdef ENABLE_NFKC_COMPILE
+  CharsMap nfkc_map;
+  RETURN_IF_ERROR(Builder::BuildNmtNFKCMap(&nfkc_map));
+  RETURN_IF_ERROR(Builder::MergeUnicodeCaseFoldMap(&nfkc_map));
+  *chars_map = std::move(nfkc_map);
+#else
+  LOG(ERROR) << "NMT_NFKC_CF compile is not enabled."
+             << " rebuild with ./configure --enable-nfkc-compile";
+#endif
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::LoadCharsMap(absl::string_view filename,
+                                   CharsMap *chars_map) {
+  LOG(INFO) << "Loading maping file: " << filename.data();
+  CHECK_OR_RETURN(chars_map);
+
+  auto input = filesystem::NewReadableFile(filename);
+
+  RETURN_IF_ERROR(input->status());
+
+  std::string line;
+  chars_map->clear();
+  while (input->ReadLine(&line)) {
+    auto fields = string_util::SplitPiece(line, "\t", true /* allow empty*/);
+    CHECK_GE(fields.size(), 1);
+    if (fields.size() == 1) fields.push_back("");  // Deletion rule.
+    std::vector<char32> src, trg;
+    for (auto &s : string_util::SplitPiece(fields[0], " ")) {
+      if (s.empty()) continue;
+      string_util::ConsumePrefix(&s, "U+");
+      src.push_back(string_util::HexToInt<char32>(s));
+    }
+    for (auto &s : string_util::SplitPiece(fields[1], " ")) {
+      if (s.empty()) continue;
+      string_util::ConsumePrefix(&s, "U+");
+      trg.push_back(string_util::HexToInt<char32>(s));
+    }
+    CHECK_OR_RETURN(!src.empty());
+    (*chars_map)[src] = trg;
+  }
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::SaveCharsMap(absl::string_view filename,
+                                   const Builder::CharsMap &chars_map) {
+  auto output = filesystem::NewWritableFile(filename);
+  RETURN_IF_ERROR(output->status());
+
+  for (const auto &c : chars_map) {
+    std::vector<std::string> src, trg;
+    string_util::UnicodeText srcu, trgu;
+    for (char32 v : c.first) {
+      src.push_back(string_util::IntToHex(v));
+      srcu.push_back(v);
+    }
+    for (char32 v : c.second) {
+      trg.push_back(string_util::IntToHex(v));
+      trgu.push_back(v);
+    }
+    std::string line = string_util::Join(src, " ") + "\t" +
+                       string_util::Join(trg, " ") + "\t# " +
+                       string_util::UnicodeTextToUTF8(c.first) + " => " +
+                       string_util::UnicodeTextToUTF8(c.second);
+    line = string_util::StringReplace(line, "\b", " ", true);
+    line = string_util::StringReplace(line, "\v", " ", true);
+    line = string_util::StringReplace(line, "\f", " ", true);
+    line = string_util::StringReplace(line, "\n", " ", true);
+    line = string_util::StringReplace(line, "\r", " ", true);
+    output->WriteLine(line);
+  }
+
+  return util::OkStatus();
+}
+
+// static
+util::Status Builder::RemoveRedundantMap(CharsMap *chars_map) {
+  CHECK_OR_RETURN(chars_map);
+
+  CharsMap new_chars_map;
+  size_t max_len = 0;
+  for (const auto &p : *chars_map) {
+    max_len = std::max(p.first.size(), max_len);
+    if (p.first.size() == 1) {
+      new_chars_map.insert(p);
+    }
+  }
+  CHECK_GT_OR_RETURN(max_len, 0);
+
+  // Checks whether the rules with size of `len` can be normalized by
+  // the rules with size of [1 .. len - 1].
+  for (size_t len = 2; len <= max_len; ++len) {
+    for (const auto &p : *chars_map) {
+      if (p.first.size() == len &&
+          p.second != Normalize(new_chars_map, p.first, len - 1)) {
+        new_chars_map.insert(p);
+      }
+    }
+  }
+
+  // Verify all characters in `chars_map` are normalized by `new_chars_map`.
+  for (const auto &p : *chars_map) {
+    CHECK_EQ_OR_RETURN(p.second, Normalize(new_chars_map, p.first, max_len));
+  }
+
+  *chars_map = std::move(new_chars_map);
+
+  return util::OkStatus();
+}
+}  // namespace normalizer
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/builder.h

@@ -0,0 +1,127 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef BUILDER_H_
+#define BUILDER_H_
+
+#include <map>
+#include <string>
+#include <vector>
+#include "common.h"
+#include "sentencepiece_model.pb.h"
+#include "sentencepiece_processor.h"
+#include "third_party/absl/strings/string_view.h"
+
+namespace sentencepiece {
+namespace normalizer {
+
+// Builder creates a text normalization rule from user-defined string
+// to string mappings. The normalization mapping is compiled into
+// a single and compact blob index which is stored into the model proto.
+// This class also provides pre-defined rules based on Unicode NFKC.
+// https://en.wikipedia.org/wiki/Unicode_equivalence#Normalization
+class Builder {
+ public:
+  Builder() = delete;
+  ~Builder() = delete;
+
+  // Basic Unicode character sequence.
+  using Chars = std::vector<char32>;
+
+  // String-to-string mapping.
+  using CharsMap = std::map<Chars, Chars>;
+
+  static util::Status CompileCharsMap(const CharsMap &chars_map,
+                                      std::string *output);
+
+  // Decompiles `blob` into `chars_map`.
+  static util::Status DecompileCharsMap(absl::string_view blob,
+                                        CharsMap *chars_map);
+
+  // Returns a pre-compiled binary index with `name`.
+  static util::Status GetPrecompiledCharsMap(const std::string &name,
+                                             std::string *output);
+
+  // Makes a normalization mapping based on NFKC.
+  //
+  // Note that Normalizer/Builder classes do not support
+  // full NFKC normalization, since full NFKC normalization cannot
+  // be implemented with a simple longest matching string-to-string
+  // replacement. One unsupported normalization is multiple combining
+  // marks.
+  //
+  // Strings with multiple combining marks cannot correctly
+  // be normalized, because it needs to sort the combining marks
+  // with Canonical_Combining_Class (CCC).
+  // http://unicode.org/reports/tr15/#Multiple_Mark_Figure
+  //
+  // Example:
+  //  Original:    U+1E0B U+0323
+  //  Decomposed:  U+0064 U+0307 U+0323
+  //  NFKD:        U+0064 U+0323 U+0307 (Combining characters are sorted by CCC)
+  //  NFKC:        U+1E0D U+0307 (U+0064 U+0323 => U+1E0D)
+  //
+  // To support the normalization above with a longest matching, we need to
+  // enumerate all possible permutations of combining marks in advance,
+  // which is not feasible. For example, suppose the case there are three
+  // combining marks X, Y and Z, which are sorted into one canonical order
+  // Z, Y, X with NFK(D|C).  In this case, all permutations (XYZ, XZY, YXZ...)
+  // are normalized into ZYX. When we implement this normalization with
+  // a longest matching, we need to have 3! rules. XYZ=>ZYX, XZY=>ZYX..
+  // Since Unicode has more than 100 combining characters, it is not possible
+  // to expand all permutations.
+  //
+  // We will not implement the full NFKC in SentencePiece because
+  //  1) It is unusual to see decomposed Unicode characters in real text.
+  //  2) Providing a flexible, user-customizable, and self-contained
+  //     normalizer is the goal of SentencePiece.
+  //
+  // TODO(taku): Make NFC, NFD, and NFKD mapping if necessary.
+  static util::Status BuildNFKCMap(CharsMap *chars_map);
+
+  // Makes an NFKC-based mapping with NMT specific modifications around
+  // whitespaces.
+  static util::Status BuildNmtNFKCMap(CharsMap *chars_map);
+
+  // Merge Unicode case folding mapping into `chars_map`.
+  static util::Status MergeUnicodeCaseFoldMap(CharsMap *chars_map);
+
+  // Makes NFKC with Unicode case folding.
+  static util::Status BuildNFKC_CFMap(CharsMap *chars_map);
+
+  // Makes NMT NFKC with Unicode case folding.
+  static util::Status BuildNmtNFKC_CFMap(CharsMap *chars_map);
+
+  // Builds Chars map save in `filename`.
+  // Format:
+  // src_uchar1 src_uchar2 ... <tab> trg_uchar1 trg_uchar2...
+  // (src|trg)_ucharX must be a hex of Unicode code point.
+  static util::Status LoadCharsMap(absl::string_view filename,
+                                   CharsMap *chars_map);
+
+  // Saves Chars map to `filename` as TSV.
+  static util::Status SaveCharsMap(absl::string_view filename,
+                                   const CharsMap &chars_map);
+
+ private:
+  FRIEND_TEST(BuilderTest, RemoveRedundantMapTest);
+
+  // Removes redundant rules from `chars_map`.
+  // When char_maps have "aa" => "bb" and "a" => "b", the first
+  // rule is not necessary since the second rule can cover the first rule.
+  static util::Status RemoveRedundantMap(CharsMap *chars_map);
+};
+}  // namespace normalizer
+}  // namespace sentencepiece
+#endif  // BUILDER_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/builder_test.cc

@@ -0,0 +1,205 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "builder.h"
+#include "common.h"
+#include "filesystem.h"
+#include "flags.h"
+#include "normalizer.h"
+#include "sentencepiece_trainer.h"
+#include "testharness.h"
+#include "util.h"
+
+DECLARE_string(data_dir);
+
+namespace sentencepiece {
+namespace normalizer {
+
+// Space symbol
+#define WS "\xe2\x96\x81"
+
+TEST(BuilderTest, RemoveRedundantMapTest) {
+  Builder::CharsMap chars_map;
+
+  // ab => AB, a => A, b => B, abc => BCA
+  chars_map[{0x0061}] = {0x0041};
+  chars_map[{0x0062}] = {0x0042};
+  chars_map[{0x0061, 0x0062}] = {0x0041, 0x0042};
+  chars_map[{0x0061, 0x0062, 0x0063}] = {0x0043, 0x0042, 0x0041};
+
+  EXPECT_OK(Builder::RemoveRedundantMap(&chars_map));
+  EXPECT_EQ(3, chars_map.size());
+  EXPECT_EQ(chars_map.end(), chars_map.find({0x0061, 0x0062}));
+  EXPECT_NE(chars_map.end(), chars_map.find({0x0061}));
+  EXPECT_NE(chars_map.end(), chars_map.find({0x0062}));
+  EXPECT_NE(chars_map.end(), chars_map.find({0x0061, 0x0062, 0x0063}));
+}
+
+TEST(BuilderTest, GetPrecompiledCharsMapWithInvalidNameTest) {
+  std::string output;
+  EXPECT_NOT_OK(Builder::GetPrecompiledCharsMap("", &output));
+  EXPECT_NOT_OK(Builder::GetPrecompiledCharsMap("__UNKNOWN__", &output));
+}
+
+TEST(BuilderTest, BuildNFKCMapTest) {
+  Builder::CharsMap chars_map;
+#ifdef ENABLE_NFKC_COMPILE
+  EXPECT_OK(Builder::BuildNFKCMap(&chars_map));
+  EXPECT_TRUE(!chars_map.empty());
+#else
+  EXPECT_OK(Builder::BuildNFKCMap(&chars_map));
+#endif
+}
+
+TEST(BuilderTest, GetPrecompiledCharsMapTest) {
+  {
+    const NormalizerSpec spec =
+        SentencePieceTrainer::GetNormalizerSpec("nmt_nfkc");
+    const Normalizer normalizer(spec);
+    EXPECT_EQ(WS "ABC", normalizer.Normalize("ＡＢＣ"));
+    EXPECT_EQ(WS "(株)", normalizer.Normalize("㈱"));
+    EXPECT_EQ(WS "グーグル", normalizer.Normalize("ｸﾞｰｸﾞﾙ"));
+  }
+
+  {
+    const NormalizerSpec spec =
+        SentencePieceTrainer::GetNormalizerSpec("nfkc_cf");
+    const Normalizer normalizer(spec);
+    EXPECT_EQ(WS "abc", normalizer.Normalize("ＡＢＣ"));
+    EXPECT_EQ(WS "abc", normalizer.Normalize("ABC"));
+  }
+
+  {
+    const NormalizerSpec spec =
+        SentencePieceTrainer::GetNormalizerSpec("nmt_nfkc_cf");
+    const Normalizer normalizer(spec);
+    EXPECT_EQ(WS "abc", normalizer.Normalize("ＡＢＣ"));
+    EXPECT_EQ(WS "abc", normalizer.Normalize("ABC"));
+  }
+
+  {
+    const NormalizerSpec spec =
+        SentencePieceTrainer::GetNormalizerSpec("identity");
+    EXPECT_TRUE(spec.precompiled_charsmap().empty());
+    const Normalizer normalizer(spec);
+    EXPECT_EQ(WS "ＡＢＣ", normalizer.Normalize("ＡＢＣ"));
+    EXPECT_EQ(WS "㈱", normalizer.Normalize("㈱"));
+    EXPECT_EQ(WS "ｸﾞｰｸﾞﾙ", normalizer.Normalize("ｸﾞｰｸﾞﾙ"));
+  }
+}
+
+TEST(BuilderTest, CompileCharsMap) {
+  Builder::CharsMap chars_map;
+
+  // Lowercase => Uppercase
+  for (char32 lc = static_cast<char32>('a'); lc <= static_cast<char32>('z');
+       ++lc) {
+    const char32 uc = lc + 'A' - 'a';
+    chars_map[{lc}] = {uc};
+  }
+
+  // あいう => abc
+  chars_map[{0x3042, 0x3044, 0x3046}] = {0x0061, 0x0062, 0x0063};
+
+  // えお => remove
+  chars_map[{0x3048, 0x304A}] = {};
+
+  NormalizerSpec spec;
+  EXPECT_OK(
+      Builder::CompileCharsMap(chars_map, spec.mutable_precompiled_charsmap()));
+  Builder::CharsMap decompiled_chars_map;
+  EXPECT_OK(Builder::DecompileCharsMap(spec.precompiled_charsmap(),
+                                       &decompiled_chars_map));
+  EXPECT_EQ(chars_map, decompiled_chars_map);
+
+  spec.set_add_dummy_prefix(false);
+  const Normalizer normalizer(spec);
+
+  EXPECT_EQ("ABC", normalizer.Normalize("abc"));
+  EXPECT_EQ("ABC", normalizer.Normalize("ABC"));
+  EXPECT_EQ("XY" WS "Z", normalizer.Normalize("xy z"));
+
+  EXPECT_EQ("あ", normalizer.Normalize("あ"));
+  EXPECT_EQ("abc", normalizer.Normalize("あいう"));
+  EXPECT_EQ("abcえ", normalizer.Normalize("あいうえ"));
+  EXPECT_EQ("ABCabcD", normalizer.Normalize("abcあいうd"));
+  EXPECT_EQ("abcか", normalizer.Normalize("あいうえおか"));
+}
+
+TEST(BuilderTest, LoadCharsMapTest) {
+  Builder::CharsMap chars_map;
+  EXPECT_OK(Builder::LoadCharsMap(util::JoinPath(FLAGS_data_dir, "nfkc.tsv"),
+                                  &chars_map));
+
+  std::string precompiled, expected;
+  EXPECT_OK(Builder::CompileCharsMap(chars_map, &precompiled));
+
+  // Round-trip.
+  Builder::CharsMap decompiled_chars_map;
+  EXPECT_OK(Builder::DecompileCharsMap(precompiled, &decompiled_chars_map));
+  EXPECT_EQ(chars_map, decompiled_chars_map);
+
+  test::ScopedTempFile output_tsv("output.tsv");
+  EXPECT_OK(Builder::SaveCharsMap(output_tsv.filename(), chars_map));
+
+  Builder::CharsMap saved_chars_map;
+  EXPECT_OK(Builder::LoadCharsMap(output_tsv.filename(), &saved_chars_map));
+  EXPECT_EQ(chars_map, saved_chars_map);
+
+#ifdef ENABLE_NFKC_COMPILE
+  Builder::CharsMap nfkc_map;
+  EXPECT_OK(Builder::BuildNFKCMap(&nfkc_map));
+  EXPECT_OK(Builder::CompileCharsMap(nfkc_map, &expected));
+#endif
+}
+
+TEST(BuilderTest, LoadCharsMapWithEmptyeTest) {
+  test::ScopedTempFile test_tsv("test.tsv");
+  test::ScopedTempFile test_out_tsv("test_out.tsv");
+  {
+    auto output = filesystem::NewWritableFile(test_tsv.filename());
+    output->WriteLine("0061\t0041");
+    output->WriteLine("0062");
+    output->WriteLine("0063\t\t#foo=>bar");
+  }
+
+  Builder::CharsMap chars_map;
+  EXPECT_OK(Builder::LoadCharsMap(test_tsv.filename(), &chars_map));
+
+  EXPECT_EQ(3, chars_map.size());
+  EXPECT_EQ(std::vector<char32>({0x0041}), chars_map[{0x0061}]);
+  EXPECT_EQ(std::vector<char32>({}), chars_map[{0x0062}]);
+  EXPECT_EQ(std::vector<char32>({}), chars_map[{0x0063}]);
+
+  EXPECT_OK(Builder::SaveCharsMap(test_out_tsv.filename(), chars_map));
+
+  Builder::CharsMap new_chars_map;
+  EXPECT_OK(Builder::LoadCharsMap(test_out_tsv.filename(), &new_chars_map));
+  EXPECT_EQ(chars_map, new_chars_map);
+}
+
+TEST(BuilderTest, ContainsTooManySharedPrefixTest) {
+  Builder::CharsMap chars_map;
+  std::vector<char32> keys;
+  // chars_map contains too many shared prefix ("aaaa...");
+  for (int i = 0; i < 100; ++i) {
+    keys.push_back('a');
+    chars_map[keys] = {'b'};
+  }
+  std::string output;
+  EXPECT_FALSE(Builder::CompileCharsMap(chars_map, &output).ok());
+}
+
+}  // namespace normalizer
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/builtin_pb/sentencepiece.pb.cc

@@ -0,0 +1,953 @@
+// Generated by the protocol buffer compiler.  DO NOT EDIT!
+// source: sentencepiece.proto
+
+#include "sentencepiece.pb.h"
+
+#include <algorithm>
+
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/stubs/port.h>
+#include <google/protobuf/io/coded_stream.h>
+#include <google/protobuf/wire_format_lite_inl.h>
+#include <google/protobuf/io/zero_copy_stream_impl_lite.h>
+// This is a temporary google only hack
+#ifdef GOOGLE_PROTOBUF_ENFORCE_UNIQUENESS
+#include "third_party/protobuf/version.h"
+#endif
+// @@protoc_insertion_point(includes)
+
+namespace protobuf_sentencepiece_2eproto {
+extern PROTOBUF_INTERNAL_EXPORT_protobuf_sentencepiece_2eproto ::google::protobuf::internal::SCCInfo<0> scc_info_SentencePieceText_SentencePiece;
+extern PROTOBUF_INTERNAL_EXPORT_protobuf_sentencepiece_2eproto ::google::protobuf::internal::SCCInfo<1> scc_info_SentencePieceText;
+}  // namespace protobuf_sentencepiece_2eproto
+namespace sentencepiece {
+class SentencePieceText_SentencePieceDefaultTypeInternal {
+ public:
+  ::google::protobuf::internal::ExplicitlyConstructed<SentencePieceText_SentencePiece>
+      _instance;
+} _SentencePieceText_SentencePiece_default_instance_;
+class SentencePieceTextDefaultTypeInternal {
+ public:
+  ::google::protobuf::internal::ExplicitlyConstructed<SentencePieceText>
+      _instance;
+} _SentencePieceText_default_instance_;
+class NBestSentencePieceTextDefaultTypeInternal {
+ public:
+  ::google::protobuf::internal::ExplicitlyConstructed<NBestSentencePieceText>
+      _instance;
+} _NBestSentencePieceText_default_instance_;
+}  // namespace sentencepiece
+namespace protobuf_sentencepiece_2eproto {
+static void InitDefaultsSentencePieceText_SentencePiece() {
+  GOOGLE_PROTOBUF_VERIFY_VERSION;
+
+  {
+    void* ptr = &::sentencepiece::_SentencePieceText_SentencePiece_default_instance_;
+    new (ptr) ::sentencepiece::SentencePieceText_SentencePiece();
+    ::google::protobuf::internal::OnShutdownDestroyMessage(ptr);
+  }
+  ::sentencepiece::SentencePieceText_SentencePiece::InitAsDefaultInstance();
+}
+
+::google::protobuf::internal::SCCInfo<0> scc_info_SentencePieceText_SentencePiece =
+    {{ATOMIC_VAR_INIT(::google::protobuf::internal::SCCInfoBase::kUninitialized), 0, InitDefaultsSentencePieceText_SentencePiece}, {}};
+
+static void InitDefaultsSentencePieceText() {
+  GOOGLE_PROTOBUF_VERIFY_VERSION;
+
+  {
+    void* ptr = &::sentencepiece::_SentencePieceText_default_instance_;
+    new (ptr) ::sentencepiece::SentencePieceText();
+    ::google::protobuf::internal::OnShutdownDestroyMessage(ptr);
+  }
+  ::sentencepiece::SentencePieceText::InitAsDefaultInstance();
+}
+
+::google::protobuf::internal::SCCInfo<1> scc_info_SentencePieceText =
+    {{ATOMIC_VAR_INIT(::google::protobuf::internal::SCCInfoBase::kUninitialized), 1, InitDefaultsSentencePieceText}, {
+      &protobuf_sentencepiece_2eproto::scc_info_SentencePieceText_SentencePiece.base,}};
+
+static void InitDefaultsNBestSentencePieceText() {
+  GOOGLE_PROTOBUF_VERIFY_VERSION;
+
+  {
+    void* ptr = &::sentencepiece::_NBestSentencePieceText_default_instance_;
+    new (ptr) ::sentencepiece::NBestSentencePieceText();
+    ::google::protobuf::internal::OnShutdownDestroyMessage(ptr);
+  }
+  ::sentencepiece::NBestSentencePieceText::InitAsDefaultInstance();
+}
+
+::google::protobuf::internal::SCCInfo<1> scc_info_NBestSentencePieceText =
+    {{ATOMIC_VAR_INIT(::google::protobuf::internal::SCCInfoBase::kUninitialized), 1, InitDefaultsNBestSentencePieceText}, {
+      &protobuf_sentencepiece_2eproto::scc_info_SentencePieceText.base,}};
+
+void InitDefaults() {
+  ::google::protobuf::internal::InitSCC(&scc_info_SentencePieceText_SentencePiece.base);
+  ::google::protobuf::internal::InitSCC(&scc_info_SentencePieceText.base);
+  ::google::protobuf::internal::InitSCC(&scc_info_NBestSentencePieceText.base);
+}
+
+}  // namespace protobuf_sentencepiece_2eproto
+namespace sentencepiece {
+
+// ===================================================================
+
+void SentencePieceText_SentencePiece::InitAsDefaultInstance() {
+}
+#if !defined(_MSC_VER) || _MSC_VER >= 1900
+const int SentencePieceText_SentencePiece::kPieceFieldNumber;
+const int SentencePieceText_SentencePiece::kIdFieldNumber;
+const int SentencePieceText_SentencePiece::kSurfaceFieldNumber;
+const int SentencePieceText_SentencePiece::kBeginFieldNumber;
+const int SentencePieceText_SentencePiece::kEndFieldNumber;
+#endif  // !defined(_MSC_VER) || _MSC_VER >= 1900
+
+SentencePieceText_SentencePiece::SentencePieceText_SentencePiece()
+  : ::google::protobuf::MessageLite(), _internal_metadata_(NULL) {
+  ::google::protobuf::internal::InitSCC(
+      &protobuf_sentencepiece_2eproto::scc_info_SentencePieceText_SentencePiece.base);
+  SharedCtor();
+  // @@protoc_insertion_point(constructor:sentencepiece.SentencePieceText.SentencePiece)
+}
+SentencePieceText_SentencePiece::SentencePieceText_SentencePiece(const SentencePieceText_SentencePiece& from)
+  : ::google::protobuf::MessageLite(),
+      _internal_metadata_(NULL),
+      _has_bits_(from._has_bits_) {
+  _internal_metadata_.MergeFrom(from._internal_metadata_);
+  _extensions_.MergeFrom(from._extensions_);
+  piece_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  if (from.has_piece()) {
+    piece_.AssignWithDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from.piece_);
+  }
+  surface_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  if (from.has_surface()) {
+    surface_.AssignWithDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from.surface_);
+  }
+  ::memcpy(&id_, &from.id_,
+    static_cast<size_t>(reinterpret_cast<char*>(&end_) -
+    reinterpret_cast<char*>(&id_)) + sizeof(end_));
+  // @@protoc_insertion_point(copy_constructor:sentencepiece.SentencePieceText.SentencePiece)
+}
+
+void SentencePieceText_SentencePiece::SharedCtor() {
+  piece_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  surface_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  ::memset(&id_, 0, static_cast<size_t>(
+      reinterpret_cast<char*>(&end_) -
+      reinterpret_cast<char*>(&id_)) + sizeof(end_));
+}
+
+SentencePieceText_SentencePiece::~SentencePieceText_SentencePiece() {
+  // @@protoc_insertion_point(destructor:sentencepiece.SentencePieceText.SentencePiece)
+  SharedDtor();
+}
+
+void SentencePieceText_SentencePiece::SharedDtor() {
+  piece_.DestroyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  surface_.DestroyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+}
+
+void SentencePieceText_SentencePiece::SetCachedSize(int size) const {
+  _cached_size_.Set(size);
+}
+const SentencePieceText_SentencePiece& SentencePieceText_SentencePiece::default_instance() {
+  ::google::protobuf::internal::InitSCC(&protobuf_sentencepiece_2eproto::scc_info_SentencePieceText_SentencePiece.base);
+  return *internal_default_instance();
+}
+
+
+void SentencePieceText_SentencePiece::Clear() {
+// @@protoc_insertion_point(message_clear_start:sentencepiece.SentencePieceText.SentencePiece)
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  // Prevent compiler warnings about cached_has_bits being unused
+  (void) cached_has_bits;
+
+  _extensions_.Clear();
+  cached_has_bits = _has_bits_[0];
+  if (cached_has_bits & 3u) {
+    if (cached_has_bits & 0x00000001u) {
+      piece_.ClearNonDefaultToEmptyNoArena();
+    }
+    if (cached_has_bits & 0x00000002u) {
+      surface_.ClearNonDefaultToEmptyNoArena();
+    }
+  }
+  if (cached_has_bits & 28u) {
+    ::memset(&id_, 0, static_cast<size_t>(
+        reinterpret_cast<char*>(&end_) -
+        reinterpret_cast<char*>(&id_)) + sizeof(end_));
+  }
+  _has_bits_.Clear();
+  _internal_metadata_.Clear();
+}
+
+bool SentencePieceText_SentencePiece::MergePartialFromCodedStream(
+    ::google::protobuf::io::CodedInputStream* input) {
+#define DO_(EXPRESSION) if (!GOOGLE_PREDICT_TRUE(EXPRESSION)) goto failure
+  ::google::protobuf::uint32 tag;
+  ::google::protobuf::internal::LiteUnknownFieldSetter unknown_fields_setter(
+      &_internal_metadata_);
+  ::google::protobuf::io::StringOutputStream unknown_fields_output(
+      unknown_fields_setter.buffer());
+  ::google::protobuf::io::CodedOutputStream unknown_fields_stream(
+      &unknown_fields_output, false);
+  // @@protoc_insertion_point(parse_start:sentencepiece.SentencePieceText.SentencePiece)
+  for (;;) {
+    ::std::pair<::google::protobuf::uint32, bool> p = input->ReadTagWithCutoffNoLastTag(127u);
+    tag = p.first;
+    if (!p.second) goto handle_unusual;
+    switch (::google::protobuf::internal::WireFormatLite::GetTagFieldNumber(tag)) {
+      // optional string piece = 1;
+      case 1: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(10u /* 10 & 0xFF */)) {
+          DO_(::google::protobuf::internal::WireFormatLite::ReadString(
+                input, this->mutable_piece()));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      // optional uint32 id = 2;
+      case 2: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(16u /* 16 & 0xFF */)) {
+          set_has_id();
+          DO_((::google::protobuf::internal::WireFormatLite::ReadPrimitive<
+                   ::google::protobuf::uint32, ::google::protobuf::internal::WireFormatLite::TYPE_UINT32>(
+                 input, &id_)));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      // optional string surface = 3;
+      case 3: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(26u /* 26 & 0xFF */)) {
+          DO_(::google::protobuf::internal::WireFormatLite::ReadString(
+                input, this->mutable_surface()));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      // optional uint32 begin = 4;
+      case 4: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(32u /* 32 & 0xFF */)) {
+          set_has_begin();
+          DO_((::google::protobuf::internal::WireFormatLite::ReadPrimitive<
+                   ::google::protobuf::uint32, ::google::protobuf::internal::WireFormatLite::TYPE_UINT32>(
+                 input, &begin_)));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      // optional uint32 end = 5;
+      case 5: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(40u /* 40 & 0xFF */)) {
+          set_has_end();
+          DO_((::google::protobuf::internal::WireFormatLite::ReadPrimitive<
+                   ::google::protobuf::uint32, ::google::protobuf::internal::WireFormatLite::TYPE_UINT32>(
+                 input, &end_)));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      default: {
+      handle_unusual:
+        if (tag == 0) {
+          goto success;
+        }
+        if ((1600u <= tag)) {
+          DO_(_extensions_.ParseField(tag, input,
+              internal_default_instance(),
+              &unknown_fields_stream));
+          continue;
+        }
+        DO_(::google::protobuf::internal::WireFormatLite::SkipField(
+            input, tag, &unknown_fields_stream));
+        break;
+      }
+    }
+  }
+success:
+  // @@protoc_insertion_point(parse_success:sentencepiece.SentencePieceText.SentencePiece)
+  return true;
+failure:
+  // @@protoc_insertion_point(parse_failure:sentencepiece.SentencePieceText.SentencePiece)
+  return false;
+#undef DO_
+}
+
+void SentencePieceText_SentencePiece::SerializeWithCachedSizes(
+    ::google::protobuf::io::CodedOutputStream* output) const {
+  // @@protoc_insertion_point(serialize_start:sentencepiece.SentencePieceText.SentencePiece)
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  (void) cached_has_bits;
+
+  cached_has_bits = _has_bits_[0];
+  // optional string piece = 1;
+  if (cached_has_bits & 0x00000001u) {
+    ::google::protobuf::internal::WireFormatLite::WriteStringMaybeAliased(
+      1, this->piece(), output);
+  }
+
+  // optional uint32 id = 2;
+  if (cached_has_bits & 0x00000004u) {
+    ::google::protobuf::internal::WireFormatLite::WriteUInt32(2, this->id(), output);
+  }
+
+  // optional string surface = 3;
+  if (cached_has_bits & 0x00000002u) {
+    ::google::protobuf::internal::WireFormatLite::WriteStringMaybeAliased(
+      3, this->surface(), output);
+  }
+
+  // optional uint32 begin = 4;
+  if (cached_has_bits & 0x00000008u) {
+    ::google::protobuf::internal::WireFormatLite::WriteUInt32(4, this->begin(), output);
+  }
+
+  // optional uint32 end = 5;
+  if (cached_has_bits & 0x00000010u) {
+    ::google::protobuf::internal::WireFormatLite::WriteUInt32(5, this->end(), output);
+  }
+
+  // Extension range [200, 536870912)
+  _extensions_.SerializeWithCachedSizes(
+      200, 536870912, output);
+
+  output->WriteRaw(_internal_metadata_.unknown_fields().data(),
+                   static_cast<int>(_internal_metadata_.unknown_fields().size()));
+  // @@protoc_insertion_point(serialize_end:sentencepiece.SentencePieceText.SentencePiece)
+}
+
+size_t SentencePieceText_SentencePiece::ByteSizeLong() const {
+// @@protoc_insertion_point(message_byte_size_start:sentencepiece.SentencePieceText.SentencePiece)
+  size_t total_size = 0;
+
+  total_size += _extensions_.ByteSize();
+
+  total_size += _internal_metadata_.unknown_fields().size();
+
+  if (_has_bits_[0 / 32] & 31u) {
+    // optional string piece = 1;
+    if (has_piece()) {
+      total_size += 1 +
+        ::google::protobuf::internal::WireFormatLite::StringSize(
+          this->piece());
+    }
+
+    // optional string surface = 3;
+    if (has_surface()) {
+      total_size += 1 +
+        ::google::protobuf::internal::WireFormatLite::StringSize(
+          this->surface());
+    }
+
+    // optional uint32 id = 2;
+    if (has_id()) {
+      total_size += 1 +
+        ::google::protobuf::internal::WireFormatLite::UInt32Size(
+          this->id());
+    }
+
+    // optional uint32 begin = 4;
+    if (has_begin()) {
+      total_size += 1 +
+        ::google::protobuf::internal::WireFormatLite::UInt32Size(
+          this->begin());
+    }
+
+    // optional uint32 end = 5;
+    if (has_end()) {
+      total_size += 1 +
+        ::google::protobuf::internal::WireFormatLite::UInt32Size(
+          this->end());
+    }
+
+  }
+  int cached_size = ::google::protobuf::internal::ToCachedSize(total_size);
+  SetCachedSize(cached_size);
+  return total_size;
+}
+
+void SentencePieceText_SentencePiece::CheckTypeAndMergeFrom(
+    const ::google::protobuf::MessageLite& from) {
+  MergeFrom(*::google::protobuf::down_cast<const SentencePieceText_SentencePiece*>(&from));
+}
+
+void SentencePieceText_SentencePiece::MergeFrom(const SentencePieceText_SentencePiece& from) {
+// @@protoc_insertion_point(class_specific_merge_from_start:sentencepiece.SentencePieceText.SentencePiece)
+  GOOGLE_DCHECK_NE(&from, this);
+  _extensions_.MergeFrom(from._extensions_);
+  _internal_metadata_.MergeFrom(from._internal_metadata_);
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  (void) cached_has_bits;
+
+  cached_has_bits = from._has_bits_[0];
+  if (cached_has_bits & 31u) {
+    if (cached_has_bits & 0x00000001u) {
+      set_has_piece();
+      piece_.AssignWithDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from.piece_);
+    }
+    if (cached_has_bits & 0x00000002u) {
+      set_has_surface();
+      surface_.AssignWithDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from.surface_);
+    }
+    if (cached_has_bits & 0x00000004u) {
+      id_ = from.id_;
+    }
+    if (cached_has_bits & 0x00000008u) {
+      begin_ = from.begin_;
+    }
+    if (cached_has_bits & 0x00000010u) {
+      end_ = from.end_;
+    }
+    _has_bits_[0] |= cached_has_bits;
+  }
+}
+
+void SentencePieceText_SentencePiece::CopyFrom(const SentencePieceText_SentencePiece& from) {
+// @@protoc_insertion_point(class_specific_copy_from_start:sentencepiece.SentencePieceText.SentencePiece)
+  if (&from == this) return;
+  Clear();
+  MergeFrom(from);
+}
+
+bool SentencePieceText_SentencePiece::IsInitialized() const {
+  if (!_extensions_.IsInitialized()) {
+    return false;
+  }
+
+  return true;
+}
+
+void SentencePieceText_SentencePiece::Swap(SentencePieceText_SentencePiece* other) {
+  if (other == this) return;
+  InternalSwap(other);
+}
+void SentencePieceText_SentencePiece::InternalSwap(SentencePieceText_SentencePiece* other) {
+  using std::swap;
+  piece_.Swap(&other->piece_, &::google::protobuf::internal::GetEmptyStringAlreadyInited(),
+    GetArenaNoVirtual());
+  surface_.Swap(&other->surface_, &::google::protobuf::internal::GetEmptyStringAlreadyInited(),
+    GetArenaNoVirtual());
+  swap(id_, other->id_);
+  swap(begin_, other->begin_);
+  swap(end_, other->end_);
+  swap(_has_bits_[0], other->_has_bits_[0]);
+  _internal_metadata_.Swap(&other->_internal_metadata_);
+  _extensions_.Swap(&other->_extensions_);
+}
+
+::std::string SentencePieceText_SentencePiece::GetTypeName() const {
+  return "sentencepiece.SentencePieceText.SentencePiece";
+}
+
+
+// ===================================================================
+
+void SentencePieceText::InitAsDefaultInstance() {
+}
+#if !defined(_MSC_VER) || _MSC_VER >= 1900
+const int SentencePieceText::kTextFieldNumber;
+const int SentencePieceText::kPiecesFieldNumber;
+const int SentencePieceText::kScoreFieldNumber;
+#endif  // !defined(_MSC_VER) || _MSC_VER >= 1900
+
+SentencePieceText::SentencePieceText()
+  : ::google::protobuf::MessageLite(), _internal_metadata_(NULL) {
+  ::google::protobuf::internal::InitSCC(
+      &protobuf_sentencepiece_2eproto::scc_info_SentencePieceText.base);
+  SharedCtor();
+  // @@protoc_insertion_point(constructor:sentencepiece.SentencePieceText)
+}
+SentencePieceText::SentencePieceText(const SentencePieceText& from)
+  : ::google::protobuf::MessageLite(),
+      _internal_metadata_(NULL),
+      _has_bits_(from._has_bits_),
+      pieces_(from.pieces_) {
+  _internal_metadata_.MergeFrom(from._internal_metadata_);
+  _extensions_.MergeFrom(from._extensions_);
+  text_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  if (from.has_text()) {
+    text_.AssignWithDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from.text_);
+  }
+  score_ = from.score_;
+  // @@protoc_insertion_point(copy_constructor:sentencepiece.SentencePieceText)
+}
+
+void SentencePieceText::SharedCtor() {
+  text_.UnsafeSetDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+  score_ = 0;
+}
+
+SentencePieceText::~SentencePieceText() {
+  // @@protoc_insertion_point(destructor:sentencepiece.SentencePieceText)
+  SharedDtor();
+}
+
+void SentencePieceText::SharedDtor() {
+  text_.DestroyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited());
+}
+
+void SentencePieceText::SetCachedSize(int size) const {
+  _cached_size_.Set(size);
+}
+const SentencePieceText& SentencePieceText::default_instance() {
+  ::google::protobuf::internal::InitSCC(&protobuf_sentencepiece_2eproto::scc_info_SentencePieceText.base);
+  return *internal_default_instance();
+}
+
+
+void SentencePieceText::Clear() {
+// @@protoc_insertion_point(message_clear_start:sentencepiece.SentencePieceText)
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  // Prevent compiler warnings about cached_has_bits being unused
+  (void) cached_has_bits;
+
+  _extensions_.Clear();
+  pieces_.Clear();
+  cached_has_bits = _has_bits_[0];
+  if (cached_has_bits & 0x00000001u) {
+    text_.ClearNonDefaultToEmptyNoArena();
+  }
+  score_ = 0;
+  _has_bits_.Clear();
+  _internal_metadata_.Clear();
+}
+
+bool SentencePieceText::MergePartialFromCodedStream(
+    ::google::protobuf::io::CodedInputStream* input) {
+#define DO_(EXPRESSION) if (!GOOGLE_PREDICT_TRUE(EXPRESSION)) goto failure
+  ::google::protobuf::uint32 tag;
+  ::google::protobuf::internal::LiteUnknownFieldSetter unknown_fields_setter(
+      &_internal_metadata_);
+  ::google::protobuf::io::StringOutputStream unknown_fields_output(
+      unknown_fields_setter.buffer());
+  ::google::protobuf::io::CodedOutputStream unknown_fields_stream(
+      &unknown_fields_output, false);
+  // @@protoc_insertion_point(parse_start:sentencepiece.SentencePieceText)
+  for (;;) {
+    ::std::pair<::google::protobuf::uint32, bool> p = input->ReadTagWithCutoffNoLastTag(127u);
+    tag = p.first;
+    if (!p.second) goto handle_unusual;
+    switch (::google::protobuf::internal::WireFormatLite::GetTagFieldNumber(tag)) {
+      // optional string text = 1;
+      case 1: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(10u /* 10 & 0xFF */)) {
+          DO_(::google::protobuf::internal::WireFormatLite::ReadString(
+                input, this->mutable_text()));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      // repeated .sentencepiece.SentencePieceText.SentencePiece pieces = 2;
+      case 2: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(18u /* 18 & 0xFF */)) {
+          DO_(::google::protobuf::internal::WireFormatLite::ReadMessage(
+                input, add_pieces()));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      // optional float score = 3;
+      case 3: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(29u /* 29 & 0xFF */)) {
+          set_has_score();
+          DO_((::google::protobuf::internal::WireFormatLite::ReadPrimitive<
+                   float, ::google::protobuf::internal::WireFormatLite::TYPE_FLOAT>(
+                 input, &score_)));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      default: {
+      handle_unusual:
+        if (tag == 0) {
+          goto success;
+        }
+        if ((1600u <= tag)) {
+          DO_(_extensions_.ParseField(tag, input,
+              internal_default_instance(),
+              &unknown_fields_stream));
+          continue;
+        }
+        DO_(::google::protobuf::internal::WireFormatLite::SkipField(
+            input, tag, &unknown_fields_stream));
+        break;
+      }
+    }
+  }
+success:
+  // @@protoc_insertion_point(parse_success:sentencepiece.SentencePieceText)
+  return true;
+failure:
+  // @@protoc_insertion_point(parse_failure:sentencepiece.SentencePieceText)
+  return false;
+#undef DO_
+}
+
+void SentencePieceText::SerializeWithCachedSizes(
+    ::google::protobuf::io::CodedOutputStream* output) const {
+  // @@protoc_insertion_point(serialize_start:sentencepiece.SentencePieceText)
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  (void) cached_has_bits;
+
+  cached_has_bits = _has_bits_[0];
+  // optional string text = 1;
+  if (cached_has_bits & 0x00000001u) {
+    ::google::protobuf::internal::WireFormatLite::WriteStringMaybeAliased(
+      1, this->text(), output);
+  }
+
+  // repeated .sentencepiece.SentencePieceText.SentencePiece pieces = 2;
+  for (unsigned int i = 0,
+      n = static_cast<unsigned int>(this->pieces_size()); i < n; i++) {
+    ::google::protobuf::internal::WireFormatLite::WriteMessage(
+      2,
+      this->pieces(static_cast<int>(i)),
+      output);
+  }
+
+  // optional float score = 3;
+  if (cached_has_bits & 0x00000002u) {
+    ::google::protobuf::internal::WireFormatLite::WriteFloat(3, this->score(), output);
+  }
+
+  // Extension range [200, 536870912)
+  _extensions_.SerializeWithCachedSizes(
+      200, 536870912, output);
+
+  output->WriteRaw(_internal_metadata_.unknown_fields().data(),
+                   static_cast<int>(_internal_metadata_.unknown_fields().size()));
+  // @@protoc_insertion_point(serialize_end:sentencepiece.SentencePieceText)
+}
+
+size_t SentencePieceText::ByteSizeLong() const {
+// @@protoc_insertion_point(message_byte_size_start:sentencepiece.SentencePieceText)
+  size_t total_size = 0;
+
+  total_size += _extensions_.ByteSize();
+
+  total_size += _internal_metadata_.unknown_fields().size();
+
+  // repeated .sentencepiece.SentencePieceText.SentencePiece pieces = 2;
+  {
+    unsigned int count = static_cast<unsigned int>(this->pieces_size());
+    total_size += 1UL * count;
+    for (unsigned int i = 0; i < count; i++) {
+      total_size +=
+        ::google::protobuf::internal::WireFormatLite::MessageSize(
+          this->pieces(static_cast<int>(i)));
+    }
+  }
+
+  if (_has_bits_[0 / 32] & 3u) {
+    // optional string text = 1;
+    if (has_text()) {
+      total_size += 1 +
+        ::google::protobuf::internal::WireFormatLite::StringSize(
+          this->text());
+    }
+
+    // optional float score = 3;
+    if (has_score()) {
+      total_size += 1 + 4;
+    }
+
+  }
+  int cached_size = ::google::protobuf::internal::ToCachedSize(total_size);
+  SetCachedSize(cached_size);
+  return total_size;
+}
+
+void SentencePieceText::CheckTypeAndMergeFrom(
+    const ::google::protobuf::MessageLite& from) {
+  MergeFrom(*::google::protobuf::down_cast<const SentencePieceText*>(&from));
+}
+
+void SentencePieceText::MergeFrom(const SentencePieceText& from) {
+// @@protoc_insertion_point(class_specific_merge_from_start:sentencepiece.SentencePieceText)
+  GOOGLE_DCHECK_NE(&from, this);
+  _extensions_.MergeFrom(from._extensions_);
+  _internal_metadata_.MergeFrom(from._internal_metadata_);
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  (void) cached_has_bits;
+
+  pieces_.MergeFrom(from.pieces_);
+  cached_has_bits = from._has_bits_[0];
+  if (cached_has_bits & 3u) {
+    if (cached_has_bits & 0x00000001u) {
+      set_has_text();
+      text_.AssignWithDefault(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from.text_);
+    }
+    if (cached_has_bits & 0x00000002u) {
+      score_ = from.score_;
+    }
+    _has_bits_[0] |= cached_has_bits;
+  }
+}
+
+void SentencePieceText::CopyFrom(const SentencePieceText& from) {
+// @@protoc_insertion_point(class_specific_copy_from_start:sentencepiece.SentencePieceText)
+  if (&from == this) return;
+  Clear();
+  MergeFrom(from);
+}
+
+bool SentencePieceText::IsInitialized() const {
+  if (!_extensions_.IsInitialized()) {
+    return false;
+  }
+
+  if (!::google::protobuf::internal::AllAreInitialized(this->pieces())) return false;
+  return true;
+}
+
+void SentencePieceText::Swap(SentencePieceText* other) {
+  if (other == this) return;
+  InternalSwap(other);
+}
+void SentencePieceText::InternalSwap(SentencePieceText* other) {
+  using std::swap;
+  CastToBase(&pieces_)->InternalSwap(CastToBase(&other->pieces_));
+  text_.Swap(&other->text_, &::google::protobuf::internal::GetEmptyStringAlreadyInited(),
+    GetArenaNoVirtual());
+  swap(score_, other->score_);
+  swap(_has_bits_[0], other->_has_bits_[0]);
+  _internal_metadata_.Swap(&other->_internal_metadata_);
+  _extensions_.Swap(&other->_extensions_);
+}
+
+::std::string SentencePieceText::GetTypeName() const {
+  return "sentencepiece.SentencePieceText";
+}
+
+
+// ===================================================================
+
+void NBestSentencePieceText::InitAsDefaultInstance() {
+}
+#if !defined(_MSC_VER) || _MSC_VER >= 1900
+const int NBestSentencePieceText::kNbestsFieldNumber;
+#endif  // !defined(_MSC_VER) || _MSC_VER >= 1900
+
+NBestSentencePieceText::NBestSentencePieceText()
+  : ::google::protobuf::MessageLite(), _internal_metadata_(NULL) {
+  ::google::protobuf::internal::InitSCC(
+      &protobuf_sentencepiece_2eproto::scc_info_NBestSentencePieceText.base);
+  SharedCtor();
+  // @@protoc_insertion_point(constructor:sentencepiece.NBestSentencePieceText)
+}
+NBestSentencePieceText::NBestSentencePieceText(const NBestSentencePieceText& from)
+  : ::google::protobuf::MessageLite(),
+      _internal_metadata_(NULL),
+      _has_bits_(from._has_bits_),
+      nbests_(from.nbests_) {
+  _internal_metadata_.MergeFrom(from._internal_metadata_);
+  // @@protoc_insertion_point(copy_constructor:sentencepiece.NBestSentencePieceText)
+}
+
+void NBestSentencePieceText::SharedCtor() {
+}
+
+NBestSentencePieceText::~NBestSentencePieceText() {
+  // @@protoc_insertion_point(destructor:sentencepiece.NBestSentencePieceText)
+  SharedDtor();
+}
+
+void NBestSentencePieceText::SharedDtor() {
+}
+
+void NBestSentencePieceText::SetCachedSize(int size) const {
+  _cached_size_.Set(size);
+}
+const NBestSentencePieceText& NBestSentencePieceText::default_instance() {
+  ::google::protobuf::internal::InitSCC(&protobuf_sentencepiece_2eproto::scc_info_NBestSentencePieceText.base);
+  return *internal_default_instance();
+}
+
+
+void NBestSentencePieceText::Clear() {
+// @@protoc_insertion_point(message_clear_start:sentencepiece.NBestSentencePieceText)
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  // Prevent compiler warnings about cached_has_bits being unused
+  (void) cached_has_bits;
+
+  nbests_.Clear();
+  _has_bits_.Clear();
+  _internal_metadata_.Clear();
+}
+
+bool NBestSentencePieceText::MergePartialFromCodedStream(
+    ::google::protobuf::io::CodedInputStream* input) {
+#define DO_(EXPRESSION) if (!GOOGLE_PREDICT_TRUE(EXPRESSION)) goto failure
+  ::google::protobuf::uint32 tag;
+  ::google::protobuf::internal::LiteUnknownFieldSetter unknown_fields_setter(
+      &_internal_metadata_);
+  ::google::protobuf::io::StringOutputStream unknown_fields_output(
+      unknown_fields_setter.buffer());
+  ::google::protobuf::io::CodedOutputStream unknown_fields_stream(
+      &unknown_fields_output, false);
+  // @@protoc_insertion_point(parse_start:sentencepiece.NBestSentencePieceText)
+  for (;;) {
+    ::std::pair<::google::protobuf::uint32, bool> p = input->ReadTagWithCutoffNoLastTag(127u);
+    tag = p.first;
+    if (!p.second) goto handle_unusual;
+    switch (::google::protobuf::internal::WireFormatLite::GetTagFieldNumber(tag)) {
+      // repeated .sentencepiece.SentencePieceText nbests = 1;
+      case 1: {
+        if (static_cast< ::google::protobuf::uint8>(tag) ==
+            static_cast< ::google::protobuf::uint8>(10u /* 10 & 0xFF */)) {
+          DO_(::google::protobuf::internal::WireFormatLite::ReadMessage(
+                input, add_nbests()));
+        } else {
+          goto handle_unusual;
+        }
+        break;
+      }
+
+      default: {
+      handle_unusual:
+        if (tag == 0) {
+          goto success;
+        }
+        DO_(::google::protobuf::internal::WireFormatLite::SkipField(
+            input, tag, &unknown_fields_stream));
+        break;
+      }
+    }
+  }
+success:
+  // @@protoc_insertion_point(parse_success:sentencepiece.NBestSentencePieceText)
+  return true;
+failure:
+  // @@protoc_insertion_point(parse_failure:sentencepiece.NBestSentencePieceText)
+  return false;
+#undef DO_
+}
+
+void NBestSentencePieceText::SerializeWithCachedSizes(
+    ::google::protobuf::io::CodedOutputStream* output) const {
+  // @@protoc_insertion_point(serialize_start:sentencepiece.NBestSentencePieceText)
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  (void) cached_has_bits;
+
+  // repeated .sentencepiece.SentencePieceText nbests = 1;
+  for (unsigned int i = 0,
+      n = static_cast<unsigned int>(this->nbests_size()); i < n; i++) {
+    ::google::protobuf::internal::WireFormatLite::WriteMessage(
+      1,
+      this->nbests(static_cast<int>(i)),
+      output);
+  }
+
+  output->WriteRaw(_internal_metadata_.unknown_fields().data(),
+                   static_cast<int>(_internal_metadata_.unknown_fields().size()));
+  // @@protoc_insertion_point(serialize_end:sentencepiece.NBestSentencePieceText)
+}
+
+size_t NBestSentencePieceText::ByteSizeLong() const {
+// @@protoc_insertion_point(message_byte_size_start:sentencepiece.NBestSentencePieceText)
+  size_t total_size = 0;
+
+  total_size += _internal_metadata_.unknown_fields().size();
+
+  // repeated .sentencepiece.SentencePieceText nbests = 1;
+  {
+    unsigned int count = static_cast<unsigned int>(this->nbests_size());
+    total_size += 1UL * count;
+    for (unsigned int i = 0; i < count; i++) {
+      total_size +=
+        ::google::protobuf::internal::WireFormatLite::MessageSize(
+          this->nbests(static_cast<int>(i)));
+    }
+  }
+
+  int cached_size = ::google::protobuf::internal::ToCachedSize(total_size);
+  SetCachedSize(cached_size);
+  return total_size;
+}
+
+void NBestSentencePieceText::CheckTypeAndMergeFrom(
+    const ::google::protobuf::MessageLite& from) {
+  MergeFrom(*::google::protobuf::down_cast<const NBestSentencePieceText*>(&from));
+}
+
+void NBestSentencePieceText::MergeFrom(const NBestSentencePieceText& from) {
+// @@protoc_insertion_point(class_specific_merge_from_start:sentencepiece.NBestSentencePieceText)
+  GOOGLE_DCHECK_NE(&from, this);
+  _internal_metadata_.MergeFrom(from._internal_metadata_);
+  ::google::protobuf::uint32 cached_has_bits = 0;
+  (void) cached_has_bits;
+
+  nbests_.MergeFrom(from.nbests_);
+}
+
+void NBestSentencePieceText::CopyFrom(const NBestSentencePieceText& from) {
+// @@protoc_insertion_point(class_specific_copy_from_start:sentencepiece.NBestSentencePieceText)
+  if (&from == this) return;
+  Clear();
+  MergeFrom(from);
+}
+
+bool NBestSentencePieceText::IsInitialized() const {
+  if (!::google::protobuf::internal::AllAreInitialized(this->nbests())) return false;
+  return true;
+}
+
+void NBestSentencePieceText::Swap(NBestSentencePieceText* other) {
+  if (other == this) return;
+  InternalSwap(other);
+}
+void NBestSentencePieceText::InternalSwap(NBestSentencePieceText* other) {
+  using std::swap;
+  CastToBase(&nbests_)->InternalSwap(CastToBase(&other->nbests_));
+  swap(_has_bits_[0], other->_has_bits_[0]);
+  _internal_metadata_.Swap(&other->_internal_metadata_);
+}
+
+::std::string NBestSentencePieceText::GetTypeName() const {
+  return "sentencepiece.NBestSentencePieceText";
+}
+
+
+// @@protoc_insertion_point(namespace_scope)
+}  // namespace sentencepiece
+namespace google {
+namespace protobuf {
+template<> GOOGLE_PROTOBUF_ATTRIBUTE_NOINLINE ::sentencepiece::SentencePieceText_SentencePiece* Arena::CreateMaybeMessage< ::sentencepiece::SentencePieceText_SentencePiece >(Arena* arena) {
+  return Arena::CreateInternal< ::sentencepiece::SentencePieceText_SentencePiece >(arena);
+}
+template<> GOOGLE_PROTOBUF_ATTRIBUTE_NOINLINE ::sentencepiece::SentencePieceText* Arena::CreateMaybeMessage< ::sentencepiece::SentencePieceText >(Arena* arena) {
+  return Arena::CreateInternal< ::sentencepiece::SentencePieceText >(arena);
+}
+template<> GOOGLE_PROTOBUF_ATTRIBUTE_NOINLINE ::sentencepiece::NBestSentencePieceText* Arena::CreateMaybeMessage< ::sentencepiece::NBestSentencePieceText >(Arena* arena) {
+  return Arena::CreateInternal< ::sentencepiece::NBestSentencePieceText >(arena);
+}
+}  // namespace protobuf
+}  // namespace google
+
+// @@protoc_insertion_point(global_scope)

cc-multilingual-main/cc_net/third_party/sentencepiece/src/char_model.h

@@ -0,0 +1,34 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef CHAR_MODEL_H_
+#define CHAR_MODEL_H_
+
+#include "model_interface.h"
+#include "sentencepiece_model.pb.h"
+
+namespace sentencepiece {
+namespace character {
+
+// Tokenize text into character sequence
+class Model : public ModelInterface {
+ public:
+  explicit Model(const ModelProto &model_proto);
+  ~Model() override;
+
+  EncodeResult Encode(absl::string_view normalized) const override;
+};
+}  // namespace character
+}  // namespace sentencepiece
+#endif  // CHAR_MODEL_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/char_model_test.cc

@@ -0,0 +1,121 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "char_model.h"
+
+#include <string>
+#include <unordered_map>
+#include <unordered_set>
+
+#include "testharness.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace character {
+namespace {
+
+// Space symbol (U+2581)
+#define WS "\xe2\x96\x81"
+
+ModelProto MakeBaseModelProto() {
+  ModelProto model_proto;
+  auto *sp1 = model_proto.add_pieces();
+  auto *sp2 = model_proto.add_pieces();
+  auto *sp3 = model_proto.add_pieces();
+
+  sp1->set_type(ModelProto::SentencePiece::UNKNOWN);
+  sp1->set_piece("<unk>");
+  sp2->set_type(ModelProto::SentencePiece::CONTROL);
+  sp2->set_piece("<s>");
+  sp3->set_type(ModelProto::SentencePiece::CONTROL);
+  sp3->set_piece("</s>");
+
+  return model_proto;
+}
+
+void AddPiece(ModelProto *model_proto, const std::string &piece,
+              float score = 0.0) {
+  auto *sp = model_proto->add_pieces();
+  sp->set_piece(piece);
+  sp->set_score(score);
+}
+
+TEST(ModelTest, EncodeTest) {
+  ModelProto model_proto = MakeBaseModelProto();
+
+  AddPiece(&model_proto, WS, 0.0);
+  AddPiece(&model_proto, "a", 0.1);
+  AddPiece(&model_proto, "b", 0.2);
+  AddPiece(&model_proto, "c", 0.3);
+  AddPiece(&model_proto, "d", 0.4);
+  AddPiece(&model_proto, "ABC", 0.4);
+  model_proto.mutable_pieces(8)->set_type(
+      ModelProto::SentencePiece::USER_DEFINED);
+
+  const Model model(model_proto);
+
+  EncodeResult result;
+
+  result = model.Encode("");
+  EXPECT_TRUE(result.empty());
+
+  result = model.Encode(WS "a" WS "b" WS "c");
+  EXPECT_EQ(6, result.size());
+  EXPECT_EQ(WS, result[0].first);
+  EXPECT_EQ("a", result[1].first);
+  EXPECT_EQ(WS, result[2].first);
+  EXPECT_EQ("b", result[3].first);
+  EXPECT_EQ(WS, result[4].first);
+  EXPECT_EQ("c", result[5].first);
+
+  result = model.Encode(WS "ab" WS "cd" WS "abc");
+  EXPECT_EQ(10, result.size());
+  EXPECT_EQ(WS, result[0].first);
+  EXPECT_EQ("a", result[1].first);
+  EXPECT_EQ("b", result[2].first);
+  EXPECT_EQ(WS, result[3].first);
+  EXPECT_EQ("c", result[4].first);
+  EXPECT_EQ("d", result[5].first);
+  EXPECT_EQ(WS, result[6].first);
+  EXPECT_EQ("a", result[7].first);
+  EXPECT_EQ("b", result[8].first);
+  EXPECT_EQ("c", result[9].first);
+
+  // makes a broken utf-8
+  const std::string broken_utf8 = std::string("あ").substr(0, 1);
+  result = model.Encode(broken_utf8);
+  EXPECT_EQ(1, result.size());
+  EXPECT_EQ(broken_utf8, result[0].first);
+
+  // "ABC" is treated as one piece, as it is USER_DEFINED.
+  result = model.Encode(WS "abABCcd");
+  EXPECT_EQ(6, result.size());
+  EXPECT_EQ(WS, result[0].first);
+  EXPECT_EQ("a", result[1].first);
+  EXPECT_EQ("b", result[2].first);
+  EXPECT_EQ("ABC", result[3].first);
+  EXPECT_EQ("c", result[4].first);
+  EXPECT_EQ("d", result[5].first);
+}
+
+TEST(CharModelTest, NotSupportedTest) {
+  ModelProto model_proto = MakeBaseModelProto();
+  const Model model(model_proto);
+  EXPECT_EQ(NBestEncodeResult(), model.NBestEncode("test", 10));
+  EXPECT_EQ(EncodeResult(), model.SampleEncode("test", 0.1));
+}
+
+}  // namespace
+}  // namespace character
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/char_model_trainer.cc

@@ -0,0 +1,60 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "char_model_trainer.h"
+
+#include <cmath>
+
+#include "char_model.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace character {
+
+util::Status Trainer::Train() {
+  RETURN_IF_ERROR(status());
+
+  CHECK_OR_RETURN(normalizer_spec_.escape_whitespaces());
+  CHECK_EQ_OR_RETURN(TrainerSpec::CHAR, trainer_spec_.model_type());
+
+  RETURN_IF_ERROR(LoadSentences());
+
+  const int vocab_size = trainer_spec_.vocab_size() - meta_pieces_.size();
+  CHECK_GE_OR_RETURN(vocab_size, 0);
+
+  uint64 sum = 0;
+  for (const auto &it : required_chars_) {
+    sum += it.second;
+  }
+
+  const float logsum = log(sum);
+
+  CHECK_OR_RETURN(final_pieces_.empty());
+  for (const auto &it : Sorted(required_chars_)) {
+    if (!trainer_spec_.use_all_vocab() &&
+        final_pieces_.size() == static_cast<size_t>(vocab_size)) {
+      break;
+    }
+    final_pieces_.emplace_back(string_util::UnicodeCharToUTF8(it.first),
+                               log(it.second) - logsum);
+  }
+
+  if (trainer_spec_.use_all_vocab()) {
+    trainer_spec_.set_vocab_size(final_pieces_.size() + meta_pieces_.size());
+  }
+
+  return Save();
+}
+}  // namespace character
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/char_model_trainer_test.cc

@@ -0,0 +1,77 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "char_model_trainer.h"
+#include <string>
+#include <vector>
+#include "filesystem.h"
+#include "sentencepiece_processor.h"
+#include "testharness.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace character {
+namespace {
+
+// Space symbol (U+2581)
+#define WS "\xE2\x96\x81"
+
+std::string RunTrainer(const std::vector<std::string> &input, int size) {
+  test::ScopedTempFile input_scoped_file("input");
+  test::ScopedTempFile model_scoped_file("model");
+  const std::string input_file = input_scoped_file.filename();
+  const std::string model_prefix = model_scoped_file.filename();
+  {
+    auto output = filesystem::NewWritableFile(input_file);
+    for (const auto &line : input) {
+      output->WriteLine(line);
+    }
+  }
+
+  TrainerSpec trainer_spec;
+  trainer_spec.set_model_type(TrainerSpec::CHAR);
+  trainer_spec.add_input(input_file);
+  trainer_spec.set_vocab_size(size);
+  trainer_spec.set_model_prefix(model_prefix);
+
+  NormalizerSpec normalizer_spec;
+  normalizer_spec.set_name("identity");
+
+  Trainer trainer(trainer_spec, normalizer_spec);
+  EXPECT_OK(trainer.Train());
+
+  SentencePieceProcessor processor;
+  EXPECT_OK(processor.Load(model_prefix + ".model"));
+
+  const auto &model = processor.model_proto();
+  std::vector<std::string> pieces;
+
+  // remove <unk>, <s>, </s>
+  for (int i = 3; i < model.pieces_size(); ++i) {
+    pieces.emplace_back(model.pieces(i).piece());
+  }
+
+  return string_util::Join(pieces, " ");
+}
+
+TEST(TrainerTest, BasicTest) {
+  EXPECT_EQ(WS " a e p n I h l v",
+            RunTrainer({"I have a pen", "I have an apple", "apple pen"}, 100));
+  EXPECT_EQ(WS " a",  // <unk>, <s>, </s>, _, a
+            RunTrainer({"I have a pen", "I have an apple", "apple pen"}, 5));
+}
+
+}  // namespace
+}  // namespace character
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/common.h

@@ -0,0 +1,202 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef COMMON_H_
+#define COMMON_H_
+
+#include <setjmp.h>
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+#include <iostream>
+#include <memory>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include "config.h"
+#include "flags.h"
+
+#if defined(_WIN32) && !defined(__CYGWIN__)
+#define OS_WIN
+#else
+#define OS_UNIX
+#endif
+
+#ifdef OS_WIN
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif
+#include <windows.h>
+#endif
+
+typedef int8_t int8;
+typedef int16_t int16;
+typedef int32_t int32;
+typedef int64_t int64;
+typedef uint8_t uint8;
+typedef uint16_t uint16;
+typedef uint32_t char32;
+typedef uint32_t uint32;
+typedef uint64_t uint64;
+
+static constexpr uint8 kuint8max = ((uint8)0xFF);
+static constexpr uint16 kuint16max = ((uint16)0xFFFF);
+static constexpr uint32 kuint32max = ((uint32)0xFFFFFFFF);
+static constexpr uint64 kuint64max = ((uint64)(0xFFFFFFFFFFFFFFFF));
+static constexpr int8 kint8min = ((int8)~0x7F);
+static constexpr int8 kint8max = ((int8)0x7F);
+static constexpr int16 kint16min = ((int16)~0x7FFF);
+static constexpr int16 kint16max = ((int16)0x7FFF);
+static constexpr int32 kint32min = ((int32)~0x7FFFFFFF);
+static constexpr int32 kint32max = ((int32)0x7FFFFFFF);
+static constexpr int64 kint64min = ((int64)(~0x7FFFFFFFFFFFFFFF));
+static constexpr int64 kint64max = ((int64)(0x7FFFFFFFFFFFFFFF));
+
+static constexpr uint32 kUnicodeError = 0xFFFD;
+
+#if defined(OS_WIN) && defined(UNICODE) && defined(_UNICODE)
+#define WPATH(path) (::sentencepiece::win32::Utf8ToWide(path).c_str())
+#else
+#define WPATH(path) (path)
+#endif
+
+template <typename T, size_t N>
+char (&ArraySizeHelper(T (&array)[N]))[N];
+
+#ifndef _MSC_VER
+template <typename T, size_t N>
+char (&ArraySizeHelper(const T (&array)[N]))[N];
+#endif  // !_MSC_VER
+
+#define arraysize(array) (sizeof(ArraySizeHelper(array)))
+
+namespace sentencepiece {
+#ifdef OS_WIN
+namespace win32 {
+std::wstring Utf8ToWide(const std::string &input);
+std::string WideToUtf8(const std::wstring &input);
+}  // namespace win32
+#endif
+
+namespace flags {
+int GetMinLogLevel();
+void SetMinLogLevel(int minloglevel);
+}  // namespace flags
+
+namespace error {
+
+void Abort();
+void Exit(int code);
+void SetTestCounter(int c);
+void ResetTestMode();
+bool GetTestCounter();
+
+class Die {
+ public:
+  explicit Die(bool die) : die_(die) {}
+  ~Die() {
+    std::cerr << std::endl;
+    if (die_) {
+      Abort();
+    }
+  }
+  int operator&(std::ostream &) { return 0; }
+
+ private:
+  bool die_;
+};
+
+template <typename T>
+T &&CheckNotNull(const char *file, int line, const char *exprtext, T &&t) {
+  if (t == nullptr) {
+    std::cerr << file << "(" << line << ") " << exprtext;
+    Abort();
+  }
+  return std::forward<T>(t);
+}
+}  // namespace error
+
+namespace logging {
+enum LogSeverity {
+  LOG_INFO = 0,
+  LOG_WARNING = 1,
+  LOG_ERROR = 2,
+  LOG_FATAL = 3,
+  LOG_SEVERITY_SIZE = 4,
+};
+
+inline const char *BaseName(const char *path) {
+#ifdef OS_WIN
+  const char *p = strrchr(path, '\\');
+#else
+  const char *p = strrchr(path, '/');
+#endif
+  if (p == nullptr) return path;
+  return p + 1;
+}
+}  // namespace logging
+}  // namespace sentencepiece
+
+#define LOG(severity)                                                        \
+  (sentencepiece::flags::GetMinLogLevel() >                                  \
+   ::sentencepiece::logging::LOG_##severity)                                 \
+      ? 0                                                                    \
+      : ::sentencepiece::error::Die(                                         \
+            ::sentencepiece::logging::LOG_##severity >=                      \
+            ::sentencepiece::logging::LOG_FATAL) &                           \
+            std::cerr << ::sentencepiece::logging::BaseName(__FILE__) << "(" \
+                      << __LINE__ << ") "                                    \
+                      << "LOG(" << #severity << ") "
+
+#define CHECK(condition)                                                      \
+  (condition) ? 0                                                             \
+              : ::sentencepiece::error::Die(true) &                           \
+                    std::cerr << ::sentencepiece::logging::BaseName(__FILE__) \
+                              << "(" << __LINE__ << ") [" << #condition       \
+                              << "] "
+
+#define CHECK_STREQ(a, b) CHECK_EQ(std::string(a), std::string(b))
+#define CHECK_EQ(a, b) CHECK((a) == (b))
+#define CHECK_NE(a, b) CHECK((a) != (b))
+#define CHECK_GE(a, b) CHECK((a) >= (b))
+#define CHECK_LE(a, b) CHECK((a) <= (b))
+#define CHECK_GT(a, b) CHECK((a) > (b))
+#define CHECK_LT(a, b) CHECK((a) < (b))
+#define CHECK_NOTNULL(val)                                    \
+  ::sentencepiece::error::CheckNotNull(                       \
+      ::sentencepiece::logging::BaseName(__FILE__), __LINE__, \
+      "'" #val "' Must be non NULL", (val))
+
+#define FRIEND_TEST(a, b) friend class a##_Test_##b;
+
+#define CHECK_OK(expr)                         \
+  do {                                         \
+    const auto _status = expr;                 \
+    CHECK(_status.ok()) << _status.ToString(); \
+  } while (0)
+
+#define CHECK_NOT_OK(expr)                      \
+  do {                                          \
+    const auto _status = expr;                  \
+    CHECK(!_status.ok()) << _status.ToString(); \
+  } while (0)
+
+#define RETURN_IF_ERROR(expr)          \
+  do {                                 \
+    const auto _status = expr;         \
+    if (!_status.ok()) return _status; \
+  } while (0)
+
+#endif  // COMMON_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/compile_charsmap_main.cc

@@ -0,0 +1,189 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include <functional>
+#include <iomanip>
+#include <iostream>
+#include <sstream>
+#include <string>
+#include "builder.h"
+#include "filesystem.h"
+#include "flags.h"
+#include "sentencepiece_processor.h"
+#include "third_party/absl/strings/string_view.h"
+
+using sentencepiece::normalizer::Builder;
+using sentencepiece::util::Status;
+
+DEFINE_bool(output_precompiled_header, false, "make normalization_rule.h file");
+
+namespace sentencepiece {
+namespace {
+
+std::string ToHexUInt64Array(
+    const std::vector<std::pair<std::string, std::string>> &data,
+    std::vector<size_t> *offset) {
+  std::stringstream os;
+  os.setf(std::ios_base::hex, std::ios_base::basefield);
+  os.setf(std::ios_base::uppercase);
+  os.setf(std::ios_base::right);
+  os.fill('0');
+  os.unsetf(std::ios_base::showbase);
+
+  size_t num = 0;
+  for (const auto &p : data) {
+    const char *begin = p.second.data();
+    const char *end = p.second.data() + p.second.size();
+
+    offset->push_back(num);
+    while (begin < end) {
+      unsigned long long int n = 0;
+      unsigned char *buf = reinterpret_cast<unsigned char *>(&n);
+      const size_t size = std::min<size_t>(end - begin, sizeof(n));
+      for (size_t i = 0; i < size; ++i) {
+        buf[i] = static_cast<unsigned char>(begin[i]);
+      }
+      begin += sizeof(n);
+      os << "0x" << std::setw(2 * sizeof(n)) << n << ", ";
+      if (++num % 8 == 0) {
+        os << "\n";
+      }
+    }
+  }
+
+  return os.str();
+}
+
+std::string ToHexData(absl::string_view data) {
+  const char *begin = data.data();
+  const char *end = data.data() + data.size();
+  constexpr char kHex[] = "0123456789ABCDEF";
+  constexpr size_t kNumOfBytesOnOneLine = 20;
+
+  size_t output_count = 0;
+  std::stringstream os;
+  while (begin < end) {
+    const size_t bucket_size =
+        std::min<size_t>(end - begin, kNumOfBytesOnOneLine -
+                                          output_count % kNumOfBytesOnOneLine);
+    if (output_count % kNumOfBytesOnOneLine == 0 && bucket_size > 0) {
+      os << "\"";
+    }
+    for (size_t i = 0; i < bucket_size; ++i) {
+      os << "\\x" << kHex[(*begin & 0xF0) >> 4] << kHex[(*begin & 0x0F) >> 0];
+      ++begin;
+    }
+    output_count += bucket_size;
+    if (output_count % kNumOfBytesOnOneLine == 0 && bucket_size > 0 &&
+        begin < end) {
+      os << "\"\n";
+    }
+  }
+  os << "\"\n";
+
+  return os.str();
+}
+
+std::string MakeHeader(
+    const std::vector<std::pair<std::string, std::string>> &data) {
+  constexpr char kHeader[] =
+      R"(#ifndef NORMALIZATION_RULE_H_
+#define NORMALIZATION_RULE_H_
+#include <cstdio>
+namespace sentencepiece {
+namespace {
+
+struct BinaryBlob {
+ const char *name;
+ size_t size;
+ const char *data;
+};
+
+)";
+
+  constexpr char kFooter[] = R"(
+}  // namespace
+}  // namespace sentencepiece
+#endif  // NORMALIZATION_RULE_H_
+)";
+
+  std::stringstream os;
+  os << kHeader;
+
+  os << "#if defined(_WIN32) && !defined(__CYGWIN__)\n";
+  os << "constexpr unsigned long long int kNormalizationRules_blob_uint64[] = "
+        "{\n";
+  std::vector<size_t> offset;
+  os << ToHexUInt64Array(data, &offset);
+  CHECK_EQ(offset.size(), data.size());
+  os << "};\n\n";
+  os << "const BinaryBlob kNormalizationRules_blob[] = {\n";
+  for (size_t i = 0; i < data.size(); ++i) {
+    os << "{ \"" << data[i].first << "\", " << data[i].second.size() << ", ";
+    os << "reinterpret_cast<const char *>(kNormalizationRules_blob_uint64 + "
+       << offset[i] << ") },\n";
+  }
+  os << "};\n";
+  os << "#else\n";
+  os << "constexpr BinaryBlob kNormalizationRules_blob[] = {\n";
+  for (size_t i = 0; i < data.size(); ++i) {
+    os << "{ \"" << data[i].first << "\", " << data[i].second.size() << ", ";
+    os << ToHexData(data[i].second) << "},\n";
+  }
+  os << "};\n";
+  os << "#endif\n";
+
+  os << "constexpr size_t kNormalizationRules_size = " << data.size() << ";\n";
+  os << kFooter;
+
+  return os.str();
+}
+
+}  // namespace
+}  // namespace sentencepiece
+
+int main(int argc, char **argv) {
+  sentencepiece::flags::ParseCommandLineFlags(argc, argv);
+
+  const std::vector<
+      std::pair<std::string, std::function<Status(Builder::CharsMap *)>>>
+      kRuleList = {{"nfkc", Builder::BuildNFKCMap},
+                   {"nmt_nfkc", Builder::BuildNmtNFKCMap},
+                   {"nfkc_cf", Builder::BuildNFKC_CFMap},
+                   {"nmt_nfkc_cf", Builder::BuildNmtNFKC_CFMap}};
+
+  std::vector<std::pair<std::string, std::string>> data;
+  for (const auto &p : kRuleList) {
+    Builder::CharsMap normalized_map;
+    CHECK_OK(p.second(&normalized_map));
+
+    // Write Header.
+    std::string index;
+    CHECK_OK(Builder::CompileCharsMap(normalized_map, &index));
+    data.emplace_back(p.first, index);
+
+    // Write TSV file.
+    CHECK_OK(Builder::SaveCharsMap(p.first + ".tsv", normalized_map));
+  }
+
+  if (FLAGS_output_precompiled_header) {
+    constexpr char kPrecompiledHeaderFileName[] = "normalization_rule.h";
+    auto output =
+        sentencepiece::filesystem::NewWritableFile(kPrecompiledHeaderFileName);
+    CHECK_OK(output->status());
+    output->Write(sentencepiece::MakeHeader(data));
+  }
+
+  return 0;
+}

cc-multilingual-main/cc_net/third_party/sentencepiece/src/error.cc

@@ -0,0 +1,154 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include <cstring>
+#include "common.h"
+#include "sentencepiece_processor.h"
+
+namespace sentencepiece {
+namespace error {
+int gTestCounter = 0;
+
+void Abort() {
+  if (GetTestCounter() == 1) {
+    SetTestCounter(2);
+  } else {
+    std::cerr << "Program terminated with an unrecoverable error." << std::endl;
+    exit(-1);
+  }
+}
+
+void Exit(int code) {
+  if (GetTestCounter() == 1) {
+    SetTestCounter(2);
+  } else {
+    exit(code);
+  }
+}
+
+void SetTestCounter(int c) { gTestCounter = c; }
+bool GetTestCounter() { return gTestCounter; }
+}  // namespace error
+
+namespace util {
+
+Status::Status() {}
+Status::~Status() {}
+
+struct Status::Rep {
+  error::Code code;
+  std::string error_message;
+};
+
+Status::Status(error::Code code, const char* error_message) : rep_(new Rep) {
+  rep_->code = code;
+  rep_->error_message = error_message;
+}
+
+Status::Status(error::Code code, const std::string& error_message)
+    : rep_(new Rep) {
+  rep_->code = code;
+  rep_->error_message = error_message;
+}
+
+Status::Status(const Status& s)
+    : rep_((s.rep_ == nullptr) ? nullptr : new Rep(*s.rep_)) {}
+
+void Status::operator=(const Status& s) {
+  if (rep_ != s.rep_)
+    rep_.reset((s.rep_ == nullptr) ? nullptr : new Rep(*s.rep_));
+}
+
+bool Status::operator==(const Status& s) const { return (rep_ == s.rep_); }
+
+bool Status::operator!=(const Status& s) const { return (rep_ != s.rep_); }
+
+const char* Status::error_message() const {
+  return ok() ? "" : rep_->error_message.c_str();
+}
+
+void Status::set_error_message(const char* str) {
+  if (rep_ == nullptr) rep_.reset(new Rep);
+  rep_->error_message = str;
+}
+
+error::Code Status::code() const { return ok() ? error::OK : rep_->code; }
+
+std::string Status::ToString() const {
+  if (rep_ == nullptr) return "OK";
+
+  std::string result;
+  switch (code()) {
+    case error::CANCELLED:
+      result = "Cancelled";
+      break;
+    case error::UNKNOWN:
+      result = "Unknown";
+      break;
+    case error::INVALID_ARGUMENT:
+      result = "Invalid argument";
+      break;
+    case error::DEADLINE_EXCEEDED:
+      result = "Deadline exceeded";
+      break;
+    case error::NOT_FOUND:
+      result = "Not found";
+      break;
+    case error::ALREADY_EXISTS:
+      result = "Already exists";
+      break;
+    case error::PERMISSION_DENIED:
+      result = "Permission denied";
+      break;
+    case error::UNAUTHENTICATED:
+      result = "Unauthenticated";
+      break;
+    case error::RESOURCE_EXHAUSTED:
+      result = "Resource exhausted";
+      break;
+    case error::FAILED_PRECONDITION:
+      result = "Failed precondition";
+      break;
+    case error::ABORTED:
+      result = "Aborted";
+      break;
+    case error::OUT_OF_RANGE:
+      result = "Out of range";
+      break;
+    case error::UNIMPLEMENTED:
+      result = "Unimplemented";
+      break;
+    case error::INTERNAL:
+      result = "Internal";
+      break;
+    case error::UNAVAILABLE:
+      result = "Unavailable";
+      break;
+    case error::DATA_LOSS:
+      result = "Data loss";
+      break;
+    default:
+      result = "Unkown code:";
+      break;
+  }
+
+  result += ": ";
+  result += rep_->error_message;
+  return result;
+}
+
+void Status::IgnoreError() {}
+
+}  // namespace util
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/filesystem.cc

@@ -0,0 +1,103 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "filesystem.h"
+#include <iostream>
+
+#include "util.h"
+
+namespace sentencepiece {
+namespace filesystem {
+
+class PosixReadableFile : public ReadableFile {
+ public:
+  PosixReadableFile(absl::string_view filename, bool is_binary = false)
+      : is_(filename.empty()
+                ? &std::cin
+                : new std::ifstream(WPATH(filename.data()),
+                                    is_binary ? std::ios::binary | std::ios::in
+                                              : std::ios::in)) {
+    if (!*is_)
+      status_ = util::StatusBuilder(util::error::NOT_FOUND)
+                << "\"" << filename.data() << "\": " << util::StrError(errno);
+  }
+
+  ~PosixReadableFile() {
+    if (is_ != &std::cin) delete is_;
+  }
+
+  util::Status status() const { return status_; }
+
+  bool ReadLine(std::string *line) {
+    return static_cast<bool>(std::getline(*is_, *line));
+  }
+
+  bool ReadAll(std::string *line) {
+    if (is_ == &std::cin) {
+      LOG(ERROR) << "ReadAll is not supported for stdin.";
+      return false;
+    }
+    line->assign(std::istreambuf_iterator<char>(*is_),
+                 std::istreambuf_iterator<char>());
+    return true;
+  }
+
+ private:
+  util::Status status_;
+  std::istream *is_;
+};
+
+class PosixWritableFile : public WritableFile {
+ public:
+  PosixWritableFile(absl::string_view filename, bool is_binary = false)
+      : os_(filename.empty()
+                ? &std::cout
+                : new std::ofstream(WPATH(filename.data()),
+                                    is_binary ? std::ios::binary | std::ios::out
+                                              : std::ios::out)) {
+    if (!*os_)
+      status_ = util::StatusBuilder(util::error::PERMISSION_DENIED)
+                << "\"" << filename.data() << "\": " << util::StrError(errno);
+  }
+
+  ~PosixWritableFile() {
+    if (os_ != &std::cout) delete os_;
+  }
+
+  util::Status status() const { return status_; }
+
+  bool Write(absl::string_view text) {
+    os_->write(text.data(), text.size());
+    return os_->good();
+  }
+
+  bool WriteLine(absl::string_view text) { return Write(text) && Write("\n"); }
+
+ private:
+  util::Status status_;
+  std::ostream *os_;
+};
+
+std::unique_ptr<ReadableFile> NewReadableFile(absl::string_view filename,
+                                              bool is_binary) {
+  return port::MakeUnique<PosixReadableFile>(filename, is_binary);
+}
+
+std::unique_ptr<WritableFile> NewWritableFile(absl::string_view filename,
+                                              bool is_binary) {
+  return port::MakeUnique<PosixWritableFile>(filename, is_binary);
+}
+
+}  // namespace filesystem
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/filesystem.h

@@ -0,0 +1,58 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef FILESYSTEM_H_
+#define FILESYSTEM_H_
+
+#include <stdio.h>
+
+#include <fstream>
+#include <memory>
+#include <string>
+#include "common.h"
+#include "sentencepiece_processor.h"
+#include "third_party/absl/strings/string_view.h"
+
+namespace sentencepiece {
+namespace filesystem {
+class ReadableFile {
+ public:
+  ReadableFile() {}
+  explicit ReadableFile(absl::string_view filename, bool is_binary = false) {}
+  virtual ~ReadableFile() {}
+
+  virtual util::Status status() const = 0;
+  virtual bool ReadLine(std::string *line) = 0;
+  virtual bool ReadAll(std::string *line) = 0;
+};
+
+class WritableFile {
+ public:
+  WritableFile() {}
+  explicit WritableFile(absl::string_view filename, bool is_binary = false) {}
+  virtual ~WritableFile() {}
+
+  virtual util::Status status() const = 0;
+  virtual bool Write(absl::string_view text) = 0;
+  virtual bool WriteLine(absl::string_view text) = 0;
+};
+
+std::unique_ptr<ReadableFile> NewReadableFile(absl::string_view filename,
+                                              bool is_binary = false);
+std::unique_ptr<WritableFile> NewWritableFile(absl::string_view filename,
+                                              bool is_binary = false);
+
+}  // namespace filesystem
+}  // namespace sentencepiece
+#endif  // FILESYSTEM_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/filesystem_test.cc

@@ -0,0 +1,54 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "filesystem.h"
+
+#include "testharness.h"
+#include "util.h"
+
+namespace sentencepiece {
+
+TEST(UtilTest, FilesystemTest) {
+  test::ScopedTempFile sf("test_file");
+
+  const char *kData[] = {
+      "This"
+      "is"
+      "a"
+      "test"};
+
+  {
+    auto output = filesystem::NewWritableFile(sf.filename());
+    for (size_t i = 0; i < arraysize(kData); ++i) {
+      output->WriteLine(kData[i]);
+    }
+  }
+
+  {
+    auto input = filesystem::NewReadableFile(sf.filename());
+    std::string line;
+    for (size_t i = 0; i < arraysize(kData); ++i) {
+      EXPECT_TRUE(input->ReadLine(&line));
+      EXPECT_EQ(kData[i], line);
+    }
+    EXPECT_FALSE(input->ReadLine(&line));
+  }
+}
+
+TEST(UtilTest, FilesystemInvalidFileTest) {
+  auto input = filesystem::NewReadableFile("__UNKNOWN__FILE__");
+  EXPECT_NOT_OK(input->status());
+}
+
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/flags.cc

@@ -0,0 +1,223 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "flags.h"
+
+#include <algorithm>
+#include <cctype>
+#include <iostream>
+#include <map>
+#include <sstream>
+#include <string>
+#include <utility>
+
+#include "common.h"
+#include "config.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace flags {
+
+struct Flag {
+  int type;
+  void *storage;
+  const void *default_storage;
+  std::string help;
+};
+
+static int32 g_minloglevel = 0;
+
+int GetMinLogLevel() { return g_minloglevel; }
+void SetMinLogLevel(int minloglevel) { g_minloglevel = minloglevel; }
+
+namespace {
+using FlagMap = std::map<std::string, Flag *>;
+
+FlagMap *GetFlagMap() {
+  static FlagMap flag_map;
+  return &flag_map;
+}
+
+bool SetFlag(const std::string &name, const std::string &value) {
+  auto it = GetFlagMap()->find(name);
+  if (it == GetFlagMap()->end()) {
+    return false;
+  }
+
+  std::string v = value;
+  Flag *flag = it->second;
+
+  // If empty value is set, we assume true or emtpy string is set
+  // for boolean or string option. With other types, setting fails.
+  if (value.empty()) {
+    switch (flag->type) {
+      case B:
+        v = "true";
+        break;
+      case S:
+        v = "";
+        break;
+      default:
+        return false;
+    }
+  }
+
+#define DEFINE_ARG(FLAG_TYPE, CPP_TYPE)                        \
+  case FLAG_TYPE: {                                            \
+    CPP_TYPE *s = reinterpret_cast<CPP_TYPE *>(flag->storage); \
+    CHECK(string_util::lexical_cast<CPP_TYPE>(v, s));          \
+    break;                                                     \
+  }
+
+  switch (flag->type) {
+    DEFINE_ARG(I, int32);
+    DEFINE_ARG(B, bool);
+    DEFINE_ARG(I64, int64);
+    DEFINE_ARG(U64, uint64);
+    DEFINE_ARG(D, double);
+    DEFINE_ARG(S, std::string);
+    default:
+      break;
+  }
+
+  return true;
+}  // namespace
+
+bool CommandLineGetFlag(int argc, char **argv, std::string *key,
+                        std::string *value, int *used_args) {
+  key->clear();
+  value->clear();
+
+  *used_args = 1;
+  const char *start = argv[0];
+  if (start[0] != '-') {
+    return false;
+  }
+
+  ++start;
+  if (start[0] == '-') ++start;
+  const std::string arg = start;
+  const size_t n = arg.find("=");
+  if (n != std::string::npos) {
+    *key = arg.substr(0, n);
+    *value = arg.substr(n + 1, arg.size() - n);
+    return true;
+  }
+
+  key->assign(arg);
+  value->clear();
+
+  if (argc == 1) {
+    return true;
+  }
+  start = argv[1];
+  if (start[0] == '-') {
+    return true;
+  }
+
+  *used_args = 2;
+  value->assign(start);
+  return true;
+}
+}  // namespace
+
+FlagRegister::FlagRegister(const char *name, void *storage,
+                           const void *default_storage, int shortype,
+                           const char *help)
+    : flag_(new Flag) {
+  flag_->type = shortype;
+  flag_->storage = storage;
+  flag_->default_storage = default_storage;
+  flag_->help = help;
+  GetFlagMap()->insert(std::make_pair(std::string(name), flag_.get()));
+}
+
+FlagRegister::~FlagRegister() {}
+
+std::string PrintHelp(const char *programname) {
+  std::ostringstream os;
+  os << PACKAGE_STRING << "\n\n";
+  os << "Usage: " << programname << " [options] files\n\n";
+
+  for (const auto &it : *GetFlagMap()) {
+    os << "   --" << it.first << " (" << it.second->help << ")";
+    const Flag *flag = it.second;
+    switch (flag->type) {
+      case I:
+        os << "  type: int32  default: "
+           << *(reinterpret_cast<const int *>(flag->default_storage)) << '\n';
+        break;
+      case B:
+        os << "  type: bool  default: "
+           << (*(reinterpret_cast<const bool *>(flag->default_storage))
+                   ? "true"
+                   : "false")
+           << '\n';
+        break;
+      case I64:
+        os << "  type: int64 default: "
+           << *(reinterpret_cast<const int64 *>(flag->default_storage)) << '\n';
+        break;
+      case U64:
+        os << "  type: uint64  default: "
+           << *(reinterpret_cast<const uint64 *>(flag->default_storage))
+           << '\n';
+        break;
+      case D:
+        os << "  type: double  default: "
+           << *(reinterpret_cast<const double *>(flag->default_storage))
+           << '\n';
+        break;
+      case S:
+        os << "  type: string  default: "
+           << *(reinterpret_cast<const std::string *>(flag->default_storage))
+           << '\n';
+        break;
+      default:
+        break;
+    }
+  }
+
+  os << "\n\n";
+
+  return os.str();
+}
+
+void ParseCommandLineFlags(int argc, char **argv,
+                           std::vector<std::string> *rest_flags) {
+  int used_argc = 0;
+  std::string key, value;
+
+  for (int i = 1; i < argc; i += used_argc) {
+    if (!CommandLineGetFlag(argc - i, argv + i, &key, &value, &used_argc)) {
+      if (rest_flags) rest_flags->push_back(std::string(argv[i]));
+      continue;
+    }
+    if (key == "help") {
+      std::cout << PrintHelp(argv[0]);
+      error::Exit(0);
+    } else if (key == "version") {
+      std::cout << PACKAGE_STRING << " " << VERSION << std::endl;
+      error::Exit(0);
+    } else if (key == "minloglevel") {
+      flags::SetMinLogLevel(atoi(value.c_str()));
+    } else if (!SetFlag(key, value)) {
+      std::cerr << "Unknown/Invalid flag " << key << "\n\n"
+                << PrintHelp(argv[0]);
+      error::Exit(1);
+    }
+  }
+}
+}  // namespace flags
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/flags.h

@@ -0,0 +1,95 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef FLAGS_H_
+#define FLAGS_H_
+
+#include <memory>
+#include <string>
+#include <vector>
+
+namespace sentencepiece {
+namespace flags {
+
+enum { I, B, I64, U64, D, S };
+
+struct Flag;
+
+class FlagRegister {
+ public:
+  FlagRegister(const char *name, void *storage, const void *default_storage,
+               int shorttpe, const char *help);
+  ~FlagRegister();
+
+ private:
+  std::unique_ptr<Flag> flag_;
+};
+
+std::string PrintHelp(const char *programname);
+
+void ParseCommandLineFlags(int argc, char **argv,
+                           std::vector<std::string> *rest_args = nullptr);
+}  // namespace flags
+}  // namespace sentencepiece
+
+#define DEFINE_VARIABLE(type, shorttype, name, value, help)               \
+  namespace sentencepiece_flags_fL##shorttype {                           \
+    using namespace sentencepiece::flags;                                 \
+    type FLAGS_##name = value;                                            \
+    static const type FLAGS_DEFAULT_##name = value;                       \
+    static const sentencepiece::flags::FlagRegister fL##name(             \
+        #name, reinterpret_cast<void *>(&FLAGS_##name),                   \
+        reinterpret_cast<const void *>(&FLAGS_DEFAULT_##name), shorttype, \
+        help);                                                            \
+  }                                                                       \
+  using sentencepiece_flags_fL##shorttype::FLAGS_##name
+
+#define DECLARE_VARIABLE(type, shorttype, name) \
+  namespace sentencepiece_flags_fL##shorttype { \
+    extern type FLAGS_##name;                   \
+  }                                             \
+  using sentencepiece_flags_fL##shorttype::FLAGS_##name
+
+#define DEFINE_int32(name, value, help) \
+  DEFINE_VARIABLE(int32, I, name, value, help)
+#define DECLARE_int32(name) DECLARE_VARIABLE(int32, I, name)
+
+#define DEFINE_int64(name, value, help) \
+  DEFINE_VARIABLE(int64, I64, name, value, help)
+#define DECLARE_int64(name) DECLARE_VARIABLE(int64, I64, name)
+
+#define DEFINE_uint64(name, value, help) \
+  DEFINE_VARIABLE(uint64, U64, name, value, help)
+#define DECLARE_uint64(name) DECLARE_VARIABLE(uint64, U64, name)
+
+#define DEFINE_double(name, value, help) \
+  DEFINE_VARIABLE(double, D, name, value, help)
+#define DECLARE_double(name) DECLARE_VARIABLE(double, D, name)
+
+#define DEFINE_bool(name, value, help) \
+  DEFINE_VARIABLE(bool, B, name, value, help)
+#define DECLARE_bool(name) DECLARE_VARIABLE(bool, B, name)
+
+#define DEFINE_string(name, value, help) \
+  DEFINE_VARIABLE(std::string, S, name, value, help)
+#define DECLARE_string(name) DECLARE_VARIABLE(std::string, S, name)
+
+#define CHECK_OR_HELP(flag)                                        \
+  if (FLAGS_##flag.empty()) {                                      \
+    std::cout << "ERROR: --" << #flag << " must not be empty\n\n"; \
+    std::cout << sentencepiece::flags::PrintHelp(PACKAGE_STRING);  \
+    sentencepiece::error::Exit(0);                                 \
+  }
+
+#endif  // FLAGS_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/flags_test.cc

@@ -0,0 +1,138 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "flags.h"
+#include "common.h"
+#include "testharness.h"
+
+DEFINE_int32(int32_f, 10, "int32_flags");
+DEFINE_bool(bool_f, false, "bool_flags");
+DEFINE_int64(int64_f, 20, "int64_flags");
+DEFINE_uint64(uint64_f, 30, "uint64_flags");
+DEFINE_double(double_f, 40.0, "double_flags");
+DEFINE_string(string_f, "str", "string_flags");
+
+namespace sentencepiece {
+namespace flags {
+
+TEST(FlagsTest, DefaultValueTest) {
+  EXPECT_EQ(10, FLAGS_int32_f);
+  EXPECT_EQ(false, FLAGS_bool_f);
+  EXPECT_EQ(20, FLAGS_int64_f);
+  EXPECT_EQ(30, FLAGS_uint64_f);
+  EXPECT_EQ(40.0, FLAGS_double_f);
+  EXPECT_EQ("str", FLAGS_string_f);
+}
+
+TEST(FlagsTest, PrintHelpTest) {
+  const std::string help = PrintHelp("foobar");
+  EXPECT_NE(std::string::npos, help.find("foobar"));
+  EXPECT_NE(std::string::npos, help.find("int32_flags"));
+  EXPECT_NE(std::string::npos, help.find("bool_flags"));
+  EXPECT_NE(std::string::npos, help.find("int64_flags"));
+  EXPECT_NE(std::string::npos, help.find("uint64_flags"));
+  EXPECT_NE(std::string::npos, help.find("double_flags"));
+  EXPECT_NE(std::string::npos, help.find("string_flags"));
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsTest) {
+  const char *kFlags[] = {"program",        "--int32_f=100",  "other1",
+                          "--bool_f=true",  "--int64_f=200",  "--uint64_f=300",
+                          "--double_f=400", "--string_f=foo", "other2",
+                          "other3"};
+
+  std::vector<std::string> rest;
+  ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags), &rest);
+
+  EXPECT_EQ(100, FLAGS_int32_f);
+  EXPECT_EQ(true, FLAGS_bool_f);
+  EXPECT_EQ(200, FLAGS_int64_f);
+  EXPECT_EQ(300, FLAGS_uint64_f);
+  EXPECT_EQ(400.0, FLAGS_double_f);
+  EXPECT_EQ("foo", FLAGS_string_f);
+  EXPECT_EQ(3, rest.size());
+  EXPECT_EQ("other1", rest[0]);
+  EXPECT_EQ("other2", rest[1]);
+  EXPECT_EQ("other3", rest[2]);
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsTest2) {
+  const char *kFlags[] = {"program",       "--int32_f", "500",
+                          "-int64_f=600",  "-uint64_f", "700",
+                          "--bool_f=FALSE"};
+
+  std::vector<std::string> rest;
+  ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags), &rest);
+
+  EXPECT_EQ(500, FLAGS_int32_f);
+  EXPECT_EQ(600, FLAGS_int64_f);
+  EXPECT_EQ(700, FLAGS_uint64_f);
+  EXPECT_FALSE(FLAGS_bool_f);
+  EXPECT_TRUE(rest.empty());
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsTest3) {
+  const char *kFlags[] = {"program", "--bool_f", "--int32_f", "800"};
+
+  std::vector<std::string> rest;
+  ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags), &rest);
+
+  EXPECT_TRUE(FLAGS_bool_f);
+  EXPECT_EQ(800, FLAGS_int32_f);
+  EXPECT_TRUE(rest.empty());
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsHelpTest) {
+  const char *kFlags[] = {"program", "--help"};
+  EXPECT_DEATH(
+      ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags)));
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsVersionTest) {
+  const char *kFlags[] = {"program", "--version"};
+  EXPECT_DEATH(
+      ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags)));
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsUnknownTest) {
+  const char *kFlags[] = {"program", "--foo"};
+  EXPECT_DEATH(
+      ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags)));
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsInvalidBoolTest) {
+  const char *kFlags[] = {"program", "--bool_f=X"};
+  EXPECT_DEATH(
+      ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags)));
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsEmptyStringArgs) {
+  const char *kFlags[] = {"program", "--string_f="};
+  ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags));
+  EXPECT_EQ("", FLAGS_string_f);
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsEmptyBoolArgs) {
+  const char *kFlags[] = {"program", "--bool_f"};
+  ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags));
+  EXPECT_TRUE(FLAGS_bool_f);
+}
+
+TEST(FlagsTest, ParseCommandLineFlagsEmptyIntArgs) {
+  const char *kFlags[] = {"program", "--int32_f"};
+  EXPECT_DEATH(
+      ParseCommandLineFlags(arraysize(kFlags), const_cast<char **>(kFlags)));
+}
+}  // namespace flags
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/freelist.h

@@ -0,0 +1,82 @@
+// Copyright 2018 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#ifndef FREELIST_H_
+#define FREELIST_H_
+
+#include <string.h>
+#include <vector>
+
+namespace sentencepiece {
+namespace model {
+
+// Simple FreeList that allocates a chunk of T at once.
+template <class T>
+class FreeList {
+ public:
+  FreeList() = delete;
+  explicit FreeList(size_t chunk_size) : chunk_size_(chunk_size) {}
+  virtual ~FreeList() {
+    for (auto& chunk : freelist_) delete[] chunk;
+  }
+
+  // `Free` doesn't free the object but reuse the allocated memory chunks.
+  void Free() {
+    const int size = std::min<int>(chunk_index_ + 1, freelist_.size());
+    for (int i = 0; i < size; ++i) {
+      T* chunk = freelist_[i];
+      memset(chunk, 0, sizeof(*chunk) * chunk_size_);
+    }
+    chunk_index_ = 0;
+    element_index_ = 0;
+  }
+
+  // Returns the number of allocated elements.
+  size_t size() const { return chunk_size_ * chunk_index_ + element_index_; }
+
+  // Returns the element as an array.
+  T* operator[](size_t index) const {
+    return freelist_[index / chunk_size_] + index % chunk_size_;
+  }
+
+  // Allocates new element.
+  T* Allocate() {
+    if (element_index_ >= chunk_size_) {
+      ++chunk_index_;
+      element_index_ = 0;
+    }
+
+    if (chunk_index_ == freelist_.size()) {
+      T* chunk = new T[chunk_size_];
+      memset(chunk, 0, sizeof(*chunk) * chunk_size_);
+      freelist_.push_back(chunk);
+    }
+
+    T* result = freelist_[chunk_index_] + element_index_;
+    ++element_index_;
+
+    return result;
+  }
+
+ private:
+  std::vector<T*> freelist_;
+
+  // The last element is stored at freelist_[chunk_index_][element_index_]
+  size_t element_index_ = 0;
+  size_t chunk_index_ = 0;
+  const size_t chunk_size_ = 0;
+};
+}  // namespace model
+}  // namespace sentencepiece
+#endif  // FREELIST_H_

cc-multilingual-main/cc_net/third_party/sentencepiece/src/freelist_test.cc

@@ -0,0 +1,34 @@
+#include "freelist.h"
+#include "testharness.h"
+
+namespace sentencepiece {
+namespace model {
+
+TEST(FreeListTest, BasicTest) {
+  FreeList<int> l(5);
+  EXPECT_EQ(0, l.size());
+
+  constexpr size_t kSize = 32;
+
+  for (size_t i = 0; i < kSize; ++i) {
+    int *n = l.Allocate();
+    EXPECT_EQ(0, *n);
+    *n = i;
+  }
+
+  EXPECT_EQ(kSize, l.size());
+  for (size_t i = 0; i < kSize; ++i) {
+    EXPECT_EQ(i, *l[i]);
+  }
+
+  l.Free();
+  EXPECT_EQ(0, l.size());
+
+  // Zero-initialized after `Free`.
+  for (size_t i = 0; i < kSize; ++i) {
+    int *n = l.Allocate();
+    EXPECT_EQ(0, *n);
+  }
+}
+}  // namespace model
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/model_factory.cc

@@ -0,0 +1,51 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "model_factory.h"
+
+#include "bpe_model.h"
+#include "char_model.h"
+#include "unigram_model.h"
+#include "util.h"
+#include "word_model.h"
+
+namespace sentencepiece {
+
+// Instantiate Model instance from |model_proto|
+std::unique_ptr<ModelInterface> ModelFactory::Create(
+    const ModelProto& model_proto) {
+  const auto& trainer_spec = model_proto.trainer_spec();
+
+  switch (trainer_spec.model_type()) {
+    case TrainerSpec::UNIGRAM:
+      return port::MakeUnique<unigram::Model>(model_proto);
+      break;
+    case TrainerSpec::BPE:
+      return port::MakeUnique<bpe::Model>(model_proto);
+      break;
+    case TrainerSpec::WORD:
+      return port::MakeUnique<word::Model>(model_proto);
+      break;
+    case TrainerSpec::CHAR:
+      return port::MakeUnique<character::Model>(model_proto);
+      break;
+    default:
+      LOG(ERROR) << "Unknown model_type: " << trainer_spec.model_type();
+      return nullptr;
+      break;
+  }
+
+  return port::MakeUnique<unigram::Model>(model_proto);
+}
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/model_factory_test.cc

@@ -0,0 +1,58 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "model_factory.h"
+#include "testharness.h"
+
+namespace sentencepiece {
+
+TEST(ModelFactoryTest, BasicTest) {
+  ModelProto model_proto;
+
+  auto *sp1 = model_proto.add_pieces();
+  auto *sp2 = model_proto.add_pieces();
+  auto *sp3 = model_proto.add_pieces();
+
+  sp1->set_type(ModelProto::SentencePiece::UNKNOWN);
+  sp1->set_piece("<unk>");
+  sp2->set_type(ModelProto::SentencePiece::CONTROL);
+  sp2->set_piece("<s>");
+  sp3->set_type(ModelProto::SentencePiece::CONTROL);
+  sp3->set_piece("</s>");
+
+  auto *sp4 = model_proto.add_pieces();
+  sp4->set_piece("test");
+  sp4->set_score(1.0);
+
+  {
+    model_proto.mutable_trainer_spec()->set_model_type(TrainerSpec::UNIGRAM);
+    auto m = ModelFactory::Create(model_proto);
+  }
+
+  {
+    model_proto.mutable_trainer_spec()->set_model_type(TrainerSpec::BPE);
+    auto m = ModelFactory::Create(model_proto);
+  }
+
+  {
+    model_proto.mutable_trainer_spec()->set_model_type(TrainerSpec::WORD);
+    auto m = ModelFactory::Create(model_proto);
+  }
+
+  {
+    model_proto.mutable_trainer_spec()->set_model_type(TrainerSpec::CHAR);
+    auto m = ModelFactory::Create(model_proto);
+  }
+}
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/model_interface.cc

@@ -0,0 +1,142 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "model_interface.h"
+
+#include <algorithm>
+#include "sentencepiece_model.pb.h"
+#include "util.h"
+
+namespace sentencepiece {
+
+ModelInterface::ModelInterface(const ModelProto &model_proto)
+    : model_proto_(&model_proto), status_(util::OkStatus()) {}
+ModelInterface::~ModelInterface() {}
+
+#define RETURN_PIECE(name, default_value)                                \
+  if (model_proto_->trainer_spec().name().empty()) return default_value; \
+  return model_proto_->trainer_spec().name();
+
+absl::string_view ModelInterface::unk_piece() const {
+  RETURN_PIECE(unk_piece, "<unk>");
+}
+
+absl::string_view ModelInterface::bos_piece() const {
+  RETURN_PIECE(bos_piece, "<s>");
+}
+
+absl::string_view ModelInterface::eos_piece() const {
+  RETURN_PIECE(eos_piece, "</s>");
+}
+
+absl::string_view ModelInterface::pad_piece() const {
+  RETURN_PIECE(pad_piece, "<pad>");
+}
+
+#undef RETURN_PIECE
+
+int ModelInterface::PieceToId(absl::string_view piece) const {
+  auto it = reserved_id_map_.find(piece);
+  if (it != reserved_id_map_.end()) {
+    return it->second;
+  }
+  auto it2 = pieces_.find(piece);
+  if (it2 != pieces_.end()) {
+    return it2->second;
+  }
+  return unk_id_;
+}
+
+void ModelInterface::InitializePieces() {
+  pieces_.clear();
+  reserved_id_map_.clear();
+  unk_id_ = -1;
+
+  std::set<absl::string_view> user_defined_symbols;
+
+  for (int i = 0; i < model_proto_->pieces_size(); ++i) {
+    const auto &sp = model_proto_->pieces(i);
+    if (sp.piece().empty()) {
+      status_ = util::InternalError("piece must not be empty.");
+      return;
+    }
+
+    const bool is_normal_piece =
+        (sp.type() == ModelProto::SentencePiece::NORMAL ||
+         sp.type() == ModelProto::SentencePiece::USER_DEFINED ||
+         sp.type() == ModelProto::SentencePiece::UNUSED);
+    if (!port::InsertIfNotPresent(
+            is_normal_piece ? &pieces_ : &reserved_id_map_, sp.piece(), i)) {
+      status_ = util::InternalError(sp.piece() + " is already defined.");
+      return;
+    }
+
+    if (sp.type() == ModelProto::SentencePiece::USER_DEFINED) {
+      user_defined_symbols.insert(sp.piece());
+    }
+
+    if (sp.type() == ModelProto::SentencePiece::UNKNOWN) {
+      if (unk_id_ >= 0) {
+        status_ = util::InternalError("unk is already defined.");
+        return;
+      }
+      unk_id_ = i;
+    }
+  }
+
+  if (unk_id_ == -1) {
+    status_ = util::InternalError("unk is not defined.");
+    return;
+  }
+
+  matcher_ = port::MakeUnique<normalizer::PrefixMatcher>(user_defined_symbols);
+}
+
+std::vector<absl::string_view> SplitIntoWords(absl::string_view text,
+                                              bool treat_whitespace_as_suffix) {
+  const char *begin = text.data();
+  const char *end = text.data() + text.size();
+
+  // Space symbol (U+2581)
+  const absl::string_view kSpaceSymbol = "\xe2\x96\x81";
+
+  std::vector<absl::string_view> result;
+  if (treat_whitespace_as_suffix) {
+    if (begin < end) result.emplace_back(begin, 0);
+    while (begin < end) {
+      const int mblen =
+          std::min<int>(string_util::OneCharLen(begin), end - begin);
+      const bool is_ws = absl::string_view(begin, mblen) == kSpaceSymbol;
+      result.back() =
+          absl::string_view(result.back().data(), result.back().size() + mblen);
+      begin += mblen;
+      if (begin < end && is_ws) result.emplace_back(begin, 0);
+    }
+  } else {
+    while (begin < end) {
+      const int mblen =
+          std::min<int>(string_util::OneCharLen(begin), end - begin);
+      if (begin == text.data() ||
+          absl::string_view(begin, mblen) == kSpaceSymbol)
+        result.emplace_back(begin, 0);  // add empty string piece.
+      result.back() =
+          absl::string_view(result.back().data(), result.back().size() + mblen);
+      begin += mblen;
+    }
+  }
+
+  return result;
+}
+
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/model_interface_test.cc

@@ -0,0 +1,373 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "model_interface.h"
+#include "model_factory.h"
+#include "testharness.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace {
+
+#define WS "\xe2\x96\x81"
+
+const std::vector<TrainerSpec::ModelType> kModelTypes = {
+    TrainerSpec::UNIGRAM, TrainerSpec::BPE, TrainerSpec::WORD,
+    TrainerSpec::CHAR};
+
+ModelProto MakeBaseModelProto(TrainerSpec::ModelType type) {
+  ModelProto model_proto;
+  auto *sp1 = model_proto.add_pieces();
+  auto *sp2 = model_proto.add_pieces();
+  auto *sp3 = model_proto.add_pieces();
+  model_proto.mutable_trainer_spec()->set_model_type(type);
+
+  sp1->set_type(ModelProto::SentencePiece::UNKNOWN);
+  sp1->set_piece("<unk>");
+  sp2->set_type(ModelProto::SentencePiece::CONTROL);
+  sp2->set_piece("<s>");
+  sp3->set_type(ModelProto::SentencePiece::CONTROL);
+  sp3->set_piece("</s>");
+
+  return model_proto;
+}
+
+void AddPiece(ModelProto *model_proto, const std::string &piece,
+              float score = 0.0) {
+  auto *sp = model_proto->add_pieces();
+  sp->set_piece(piece);
+  sp->set_score(score);
+}
+
+TEST(ModelInterfaceTest, GetDefaultPieceTest) {
+  {
+    ModelProto model_proto;
+    EXPECT_EQ("<unk>", model_proto.trainer_spec().unk_piece());
+    EXPECT_EQ("<s>", model_proto.trainer_spec().bos_piece());
+    EXPECT_EQ("</s>", model_proto.trainer_spec().eos_piece());
+    EXPECT_EQ("<pad>", model_proto.trainer_spec().pad_piece());
+  }
+
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    AddPiece(&model_proto, "a");
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_EQ("<unk>", model->unk_piece());
+    EXPECT_EQ("<s>", model->bos_piece());
+    EXPECT_EQ("</s>", model->eos_piece());
+    EXPECT_EQ("<pad>", model->pad_piece());
+  }
+
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    AddPiece(&model_proto, "a");
+    model_proto.mutable_trainer_spec()->clear_unk_piece();
+    model_proto.mutable_trainer_spec()->clear_bos_piece();
+    model_proto.mutable_trainer_spec()->clear_eos_piece();
+    model_proto.mutable_trainer_spec()->clear_pad_piece();
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_EQ("<unk>", model->unk_piece());
+    EXPECT_EQ("<s>", model->bos_piece());
+    EXPECT_EQ("</s>", model->eos_piece());
+    EXPECT_EQ("<pad>", model->pad_piece());
+  }
+
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    AddPiece(&model_proto, "a");
+    model_proto.mutable_trainer_spec()->set_unk_piece("UNK");
+    model_proto.mutable_trainer_spec()->set_bos_piece("BOS");
+    model_proto.mutable_trainer_spec()->set_eos_piece("EOS");
+    model_proto.mutable_trainer_spec()->set_pad_piece("PAD");
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_EQ("UNK", model->unk_piece());
+    EXPECT_EQ("BOS", model->bos_piece());
+    EXPECT_EQ("EOS", model->eos_piece());
+    EXPECT_EQ("PAD", model->pad_piece());
+  }
+}
+
+TEST(ModelInterfaceTest, SetModelInterfaceTest) {
+  for (const auto type : kModelTypes) {
+    ModelProto model_proto = MakeBaseModelProto(type);
+    AddPiece(&model_proto, "a");
+    AddPiece(&model_proto, "b");
+    AddPiece(&model_proto, "c");
+    AddPiece(&model_proto, "d");
+
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_EQ(model_proto.SerializeAsString(),
+              model->model_proto().SerializeAsString());
+  }
+}
+
+TEST(ModelInterfaceTest, PieceToIdTest) {
+  for (const auto type : kModelTypes) {
+    ModelProto model_proto = MakeBaseModelProto(type);
+
+    AddPiece(&model_proto, "a", 0.1);  // 3
+    AddPiece(&model_proto, "b", 0.2);  // 4
+    AddPiece(&model_proto, "c", 0.3);  // 5
+    AddPiece(&model_proto, "d", 0.4);  // 6
+    AddPiece(&model_proto, "e", 0.5);  // 7
+    model_proto.mutable_pieces(6)->set_type(ModelProto::SentencePiece::UNUSED);
+    model_proto.mutable_pieces(7)->set_type(
+        ModelProto::SentencePiece::USER_DEFINED);
+
+    auto model = ModelFactory::Create(model_proto);
+
+    EXPECT_EQ(model_proto.SerializeAsString(),
+              model->model_proto().SerializeAsString());
+
+    EXPECT_EQ(0, model->PieceToId("<unk>"));
+    EXPECT_EQ(1, model->PieceToId("<s>"));
+    EXPECT_EQ(2, model->PieceToId("</s>"));
+    EXPECT_EQ(3, model->PieceToId("a"));
+    EXPECT_EQ(4, model->PieceToId("b"));
+    EXPECT_EQ(5, model->PieceToId("c"));
+    EXPECT_EQ(6, model->PieceToId("d"));
+    EXPECT_EQ(7, model->PieceToId("e"));
+    EXPECT_EQ(0, model->PieceToId("f"));  // unk
+    EXPECT_EQ(0, model->PieceToId(""));   // unk
+
+    EXPECT_EQ("<unk>", model->IdToPiece(0));
+    EXPECT_EQ("<s>", model->IdToPiece(1));
+    EXPECT_EQ("</s>", model->IdToPiece(2));
+    EXPECT_EQ("a", model->IdToPiece(3));
+    EXPECT_EQ("b", model->IdToPiece(4));
+    EXPECT_EQ("c", model->IdToPiece(5));
+    EXPECT_EQ("d", model->IdToPiece(6));
+    EXPECT_EQ("e", model->IdToPiece(7));
+
+    EXPECT_TRUE(model->IsUnknown(0));
+    EXPECT_FALSE(model->IsUnknown(1));
+    EXPECT_FALSE(model->IsUnknown(2));
+    EXPECT_FALSE(model->IsUnknown(3));
+    EXPECT_FALSE(model->IsUnknown(4));
+    EXPECT_FALSE(model->IsUnknown(5));
+    EXPECT_FALSE(model->IsUnknown(6));
+    EXPECT_FALSE(model->IsUnknown(7));
+
+    EXPECT_FALSE(model->IsControl(0));
+    EXPECT_TRUE(model->IsControl(1));
+    EXPECT_TRUE(model->IsControl(2));
+    EXPECT_FALSE(model->IsControl(3));
+    EXPECT_FALSE(model->IsControl(4));
+    EXPECT_FALSE(model->IsControl(5));
+    EXPECT_FALSE(model->IsControl(6));
+    EXPECT_FALSE(model->IsControl(7));
+
+    EXPECT_FALSE(model->IsUnused(0));
+    EXPECT_FALSE(model->IsUnused(1));
+    EXPECT_FALSE(model->IsUnused(2));
+    EXPECT_FALSE(model->IsUnused(3));
+    EXPECT_FALSE(model->IsUnused(4));
+    EXPECT_FALSE(model->IsUnused(5));
+    EXPECT_TRUE(model->IsUnused(6));
+    EXPECT_FALSE(model->IsUnused(7));
+
+    EXPECT_FALSE(model->IsUserDefined(0));
+    EXPECT_FALSE(model->IsUserDefined(1));
+    EXPECT_FALSE(model->IsUserDefined(2));
+    EXPECT_FALSE(model->IsUserDefined(3));
+    EXPECT_FALSE(model->IsUserDefined(4));
+    EXPECT_FALSE(model->IsUserDefined(5));
+    EXPECT_FALSE(model->IsUserDefined(6));
+    EXPECT_TRUE(model->IsUserDefined(7));
+
+    EXPECT_NEAR(0, model->GetScore(0), 0.0001);
+    EXPECT_NEAR(0, model->GetScore(1), 0.0001);
+    EXPECT_NEAR(0, model->GetScore(2), 0.0001);
+    EXPECT_NEAR(0.1, model->GetScore(3), 0.0001);
+    EXPECT_NEAR(0.2, model->GetScore(4), 0.0001);
+    EXPECT_NEAR(0.3, model->GetScore(5), 0.0001);
+    EXPECT_NEAR(0.4, model->GetScore(6), 0.0001);
+    EXPECT_NEAR(0.5, model->GetScore(7), 0.0001);
+  }
+}
+
+TEST(ModelInterfaceTest, InvalidModelTest) {
+  // Empty piece.
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    AddPiece(&model_proto, "");
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_FALSE(model->status().ok());
+  }
+
+  // Duplicated pieces.
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    AddPiece(&model_proto, "a");
+    AddPiece(&model_proto, "a");
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_FALSE(model->status().ok());
+  }
+
+  // Multiple unknowns.
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    model_proto.mutable_pieces(1)->set_type(ModelProto::SentencePiece::UNKNOWN);
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_FALSE(model->status().ok());
+  }
+
+  // No unknown.
+  {
+    ModelProto model_proto = MakeBaseModelProto(TrainerSpec::UNIGRAM);
+    model_proto.mutable_pieces(0)->set_type(ModelProto::SentencePiece::CONTROL);
+    auto model = ModelFactory::Create(model_proto);
+    EXPECT_FALSE(model->status().ok());
+  }
+}
+
+std::string RandomString(int length) {
+  const char kAlphaNum[] =
+      "0123456789"
+      "!@#$%^&*"
+      "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+      "abcdefghijklmnopqrstuvwxyz";
+  const int kAlphaSize = sizeof(kAlphaNum) - 1;
+  const int size = rand() % length + 1;
+  std::string result;
+  for (int i = 0; i < size; ++i) {
+    result += kAlphaNum[rand() % kAlphaSize];
+  }
+  return result;
+}
+
+TEST(ModelInterfaceTest, PieceToIdStressTest) {
+  for (const auto type : kModelTypes) {
+    for (int i = 0; i < 100; ++i) {
+      std::unordered_map<std::string, int> expected_p2i;
+      std::unordered_map<int, std::string> expected_i2p;
+      ModelProto model_proto = MakeBaseModelProto(type);
+      for (int n = 0; n < 1000; ++n) {
+        const std::string piece = RandomString(10);
+        if (expected_p2i.find(piece) != expected_p2i.end()) {
+          continue;
+        }
+        expected_p2i[piece] = model_proto.pieces_size();
+        expected_i2p[model_proto.pieces_size()] = piece;
+        AddPiece(&model_proto, piece);
+      }
+
+      auto model = ModelFactory::Create(model_proto);
+      for (const auto &it : expected_p2i) {
+        EXPECT_EQ(it.second, model->PieceToId(it.first));
+      }
+      for (const auto &it : expected_i2p) {
+        EXPECT_EQ(it.second, model->IdToPiece(it.first));
+      }
+    }
+  }
+}
+
+TEST(ModelInterfaceTest, SplitIntoWordsTest) {
+  {
+    const auto v = SplitIntoWords(WS "this" WS "is" WS "a" WS "pen");
+    EXPECT_EQ(4, v.size());
+    EXPECT_EQ(WS "this", v[0]);
+    EXPECT_EQ(WS "is", v[1]);
+    EXPECT_EQ(WS "a", v[2]);
+    EXPECT_EQ(WS "pen", v[3]);
+  }
+
+  {
+    const auto v = SplitIntoWords("this" WS "is" WS "a" WS "pen");
+    EXPECT_EQ(4, v.size());
+    EXPECT_EQ("this", v[0]);
+    EXPECT_EQ(WS "is", v[1]);
+    EXPECT_EQ(WS "a", v[2]);
+    EXPECT_EQ(WS "pen", v[3]);
+  }
+
+  {
+    const auto v = SplitIntoWords(WS "this" WS WS "is");
+    EXPECT_EQ(3, v.size());
+    EXPECT_EQ(WS "this", v[0]);
+    EXPECT_EQ(WS, v[1]);
+    EXPECT_EQ(WS "is", v[2]);
+  }
+
+  {
+    const auto v = SplitIntoWords("");
+    EXPECT_TRUE(v.empty());
+  }
+
+  {
+    const auto v = SplitIntoWords("hello");
+    EXPECT_EQ(1, v.size());
+    EXPECT_EQ("hello", v[0]);
+  }
+}
+
+TEST(ModelInterfaceTest, SplitIntoWordsSuffixTest) {
+  {
+    const auto v = SplitIntoWords("this" WS "is" WS "a" WS "pen" WS, true);
+    EXPECT_EQ(4, v.size());
+    EXPECT_EQ("this" WS, v[0]);
+    EXPECT_EQ("is" WS, v[1]);
+    EXPECT_EQ("a" WS, v[2]);
+    EXPECT_EQ("pen" WS, v[3]);
+  }
+
+  {
+    const auto v = SplitIntoWords("this" WS "is" WS "a" WS "pen", true);
+    EXPECT_EQ(4, v.size());
+    EXPECT_EQ("this" WS, v[0]);
+    EXPECT_EQ("is" WS, v[1]);
+    EXPECT_EQ("a" WS, v[2]);
+    EXPECT_EQ("pen", v[3]);
+  }
+
+  {
+    const auto v = SplitIntoWords(WS "this" WS WS "is", true);
+    EXPECT_EQ(4, v.size());
+    EXPECT_EQ(WS, v[0]);
+    EXPECT_EQ("this" WS, v[1]);
+    EXPECT_EQ(WS, v[2]);
+    EXPECT_EQ("is", v[3]);
+  }
+
+  {
+    const auto v = SplitIntoWords("", true);
+    EXPECT_TRUE(v.empty());
+  }
+
+  {
+    const auto v = SplitIntoWords("hello", true);
+    EXPECT_EQ(1, v.size());
+    EXPECT_EQ("hello", v[0]);
+  }
+
+  {
+    const auto v = SplitIntoWords("hello" WS WS, true);
+    EXPECT_EQ(2, v.size());
+    EXPECT_EQ("hello" WS, v[0]);
+    EXPECT_EQ(WS, v[1]);
+  }
+
+  {
+    const auto v = SplitIntoWords(WS WS "hello" WS WS, true);
+    EXPECT_EQ(4, v.size());
+    EXPECT_EQ(WS, v[0]);
+    EXPECT_EQ(WS, v[1]);
+    EXPECT_EQ("hello" WS, v[2]);
+    EXPECT_EQ(WS, v[3]);
+  }
+}
+
+}  // namespace
+}  // namespace sentencepiece

cc-multilingual-main/cc_net/third_party/sentencepiece/src/normalizer.cc

@@ -0,0 +1,333 @@
+// Copyright 2016 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.!
+
+#include "normalizer.h"
+
+#include <utility>
+#include <vector>
+#include "common.h"
+#include "third_party/absl/strings/string_view.h"
+#include "third_party/darts_clone/darts.h"
+#include "util.h"
+
+namespace sentencepiece {
+namespace normalizer {
+
+constexpr int Normalizer::kMaxTrieResultsSize;
+
+Normalizer::Normalizer(const NormalizerSpec &spec,
+                       const TrainerSpec &trainer_spec)
+    : spec_(&spec),
+      treat_whitespace_as_suffix_(trainer_spec.treat_whitespace_as_suffix()),
+      status_(util::OkStatus()) {
+  Init();
+}
+
+Normalizer::Normalizer(const NormalizerSpec &spec)
+    : spec_(&spec), status_(util::OkStatus()) {
+  Init();
+}
+
+Normalizer::~Normalizer() {}
+
+void Normalizer::Init() {
+  absl::string_view index = spec_->precompiled_charsmap();
+  if (index.empty()) {
+    LOG(INFO) << "precompiled_charsmap is empty. use identity normalization.";
+  } else {
+    absl::string_view trie_blob, normalized;
+    status_ = DecodePrecompiledCharsMap(index, &trie_blob, &normalized);
+    if (!status_.ok()) return;
+
+    // Reads the body of double array.
+    trie_ = port::MakeUnique<Darts::DoubleArray>();
+
+    // The second arg of set_array is not the size of blob,
+    // but the number of double array units.
+    trie_->set_array(const_cast<char *>(trie_blob.data()),
+                     trie_blob.size() / trie_->unit_size());
+
+    normalized_ = normalized.data();
+  }
+}
+
+util::Status Normalizer::Normalize(absl::string_view input,
+                                   std::string *normalized,
+                                   std::vector<size_t> *norm_to_orig) const {
+  norm_to_orig->clear();
+  normalized->clear();
+
+  if (input.empty()) {
+    return util::OkStatus();
+  }
+
+  RETURN_IF_ERROR(status());
+
+  int consumed = 0;
+
+  // Ignores heading space.
+  if (spec_->remove_extra_whitespaces()) {
+    while (!input.empty()) {
+      const auto p = NormalizePrefix(input);
+      if (p.first != " ") {
+        break;
+      }
+      input.remove_prefix(p.second);
+      consumed += p.second;
+    }
+  }
+
+  // all chars are whitespace.
+  if (input.empty()) {
+    return util::OkStatus();
+  }
+
+  // Reserves the output buffer to avoid re-allocations.
+  const size_t kReservedSize = input.size() * 3;
+  normalized->reserve(kReservedSize);
+  norm_to_orig->reserve(kReservedSize);
+
+  // Replaces white space with U+2581 (LOWER ONE EIGHT BLOCK)
+  // if escape_whitespaces() is set (default = true).
+  const absl::string_view kSpaceSymbol = "\xe2\x96\x81";
+
+  // adds kSpaceSymbol to the current context.
+  auto add_ws = [this, &consumed, &normalized, &norm_to_orig, &kSpaceSymbol]() {
+    if (spec_->escape_whitespaces()) {
+      normalized->append(kSpaceSymbol.data(), kSpaceSymbol.size());
+      for (size_t n = 0; n < kSpaceSymbol.size(); ++n) {
+        norm_to_orig->push_back(consumed);
+      }
+    } else {
+      normalized->append(" ");
+      norm_to_orig->push_back(consumed);
+    }
+  };
+
+  // Adds a space symbol as a prefix (default is true)
+  // With this prefix, "world" and "hello world" are converted into
+  // "_world" and "_hello_world", which help the trainer to extract
+  // "_world" as one symbol.
+  if (!treat_whitespace_as_suffix_ && spec_->add_dummy_prefix()) add_ws();
+
+  bool is_prev_space = spec_->remove_extra_whitespaces();
+  while (!input.empty()) {
+    auto p = NormalizePrefix(input);
+    absl::string_view sp = p.first;
+
+    // Removes heading spaces in sentence piece,
+    // if the previous sentence piece ends with whitespace.
+    while (is_prev_space && string_util::ConsumePrefix(&sp, " ")) {
+    }
+
+    if (!sp.empty()) {
+      const char *data = sp.data();
+      for (size_t n = 0; n < sp.size(); ++n) {
+        if (spec_->escape_whitespaces() && data[n] == ' ') {
+          // replace ' ' with kSpaceSymbol.
+          normalized->append(kSpaceSymbol.data(), kSpaceSymbol.size());
+          for (size_t m = 0; m < kSpaceSymbol.size(); ++m) {
+            norm_to_orig->push_back(consumed);
+          }
+        } else {
+          *normalized += data[n];
+          norm_to_orig->push_back(consumed);
+        }
+      }
+      // Checks whether the last character of sp is whitespace.
+      is_prev_space = string_util::EndsWith(sp, " ");
+    }
+
+    consumed += p.second;
+    input.remove_prefix(p.second);
+    if (!spec_->remove_extra_whitespaces()) {
+      is_prev_space = false;
+    }
+  }
+
+  // Ignores tailing space.
+  if (spec_->remove_extra_whitespaces()) {
+    const absl::string_view space =
+        spec_->escape_whitespaces() ? kSpaceSymbol : " ";
+    while (string_util::EndsWith(*normalized, space)) {
+      const int length = normalized->size() - space.size();
+      CHECK_GE_OR_RETURN(length, 0);
+      consumed = (*norm_to_orig)[length];
+      normalized->resize(length);
+      norm_to_orig->resize(length);
+    }
+  }
+
+  // Adds a space symbol as a suffix (default is false)
+  if (treat_whitespace_as_suffix_ && spec_->add_dummy_prefix()) add_ws();
+
+  norm_to_orig->push_back(consumed);
+
+  CHECK_EQ_OR_RETURN(norm_to_orig->size(), normalized->size() + 1);
+
+  return util::OkStatus();
+}
+
+std::string Normalizer::Normalize(absl::string_view input) const {
+  std::vector<size_t> norm_to_orig;
+  std::string normalized;
+  Normalize(input, &normalized, &norm_to_orig);
+  return normalized;
+}
+
+std::pair<absl::string_view, int> Normalizer::NormalizePrefix(
+    absl::string_view input) const {
+  std::pair<absl::string_view, int> result;
+
+  if (input.empty()) return result;
+
+  if (matcher_ != nullptr) {
+    bool found = false;
+    const int mblen = matcher_->PrefixMatch(input, &found);
+    if (found) return std::make_pair(input.substr(0, mblen), mblen);
+  }
+
+  size_t longest_length = 0;
+  int longest_value = 0;
+
+  if (trie_ != nullptr) {
+    // Allocates trie_results in stack, which makes the encoding speed 36%
+    // faster. (38k sentences/sec => 60k sentences/sec). Builder checks that the
+    // result size never exceeds kMaxTrieResultsSize. This array consumes
+    // 0.5kByte in stack, which is less than default stack frames (16kByte).
+    Darts::DoubleArray::result_pair_type
+        trie_results[Normalizer::kMaxTrieResultsSize];
+
+    const size_t num_nodes = trie_->commonPrefixSearch(
+        input.data(), trie_results, Normalizer::kMaxTrieResultsSize,
+        input.size());
+
+    // Finds the longest rule.
+    for (size_t k = 0; k < num_nodes; ++k) {
+      if (longest_length == 0 || trie_results[k].length > longest_length) {
+        longest_length = trie_results[k].length;  // length of prefix
+        longest_value = trie_results[k].value;    // pointer to |normalized_|.
+      }
+    }
+  }
+
+  if (longest_length == 0) {
+    size_t length = 0;
+    if (!string_util::IsValidDecodeUTF8(input, &length)) {
+      // Found a malformed utf8.
+      // The rune is set to be 0xFFFD (REPLACEMENT CHARACTER),
+      // which is a valid Unicode of three bytes in utf8,
+      // but here we only consume one byte.
+      result.second = 1;
+      static const char kReplacementChar[] = "\xEF\xBF\xBD";
+      result.first = absl::string_view(kReplacementChar);
+    } else {
+      result.second = length;
+      result.first = absl::string_view(input.data(), result.second);
+    }
+  } else {
+    result.second = longest_length;
+    // No need to pass the size of normalized sentence,
+    // since |normalized| is delimitered by "\0".
+    result.first = absl::string_view(&normalized_[longest_value]);
+  }
+
+  return result;
+}
+
+// static
+std::string Normalizer::EncodePrecompiledCharsMap(
+    absl::string_view trie_blob, absl::string_view normalized) {
+  // <trie size(4byte)><double array trie><normalized string>
+  std::string blob;
+  blob.append(string_util::EncodePOD<uint32>(trie_blob.size()));
+  blob.append(trie_blob.data(), trie_blob.size());
+  blob.append(normalized.data(), normalized.size());
+  return blob;
+}
+
+// static
+util::Status Normalizer::DecodePrecompiledCharsMap(
+    absl::string_view blob, absl::string_view *trie_blob,
+    absl::string_view *normalized) {
+  uint32 trie_blob_size = 0;
+  if (blob.size() <= sizeof(trie_blob_size) ||
+      !string_util::DecodePOD<uint32>(
+          absl::string_view(blob.data(), sizeof(trie_blob_size)),
+          &trie_blob_size) ||
+      trie_blob_size >= blob.size()) {
+    return util::InternalError("Blob for normalization rule is broken.");
+  }
+
+  blob.remove_prefix(sizeof(trie_blob_size));
+  *trie_blob = absl::string_view(blob.data(), trie_blob_size);
+
+  blob.remove_prefix(trie_blob_size);
+  *normalized = absl::string_view(blob.data(), blob.size());
+
+  return util::OkStatus();
+}
+
+PrefixMatcher::PrefixMatcher(const std::set<absl::string_view> &dic) {
+  if (dic.empty()) return;
+  std::vector<const char *> key;
+  key.reserve(dic.size());
+  for (const auto &it : dic) key.push_back(it.data());
+  trie_ = port::MakeUnique<Darts::DoubleArray>();
+  CHECK_EQ(0, trie_->build(key.size(), const_cast<char **>(&key[0]), nullptr,
+                           nullptr));
+}
+
+int PrefixMatcher::PrefixMatch(absl::string_view w, bool *found) const {
+  if (trie_ == nullptr) {
+    if (found) *found = false;
+    return std::min<int>(w.size(), string_util::OneCharLen(w.data()));
+  }
+
+  constexpr int kResultSize = 64;
+  Darts::DoubleArray::result_pair_type trie_results[kResultSize];
+  const int num_nodes =
+      trie_->commonPrefixSearch(w.data(), trie_results, kResultSize, w.size());
+
+  if (found) *found = (num_nodes > 0);
+  if (num_nodes == 0) {
+    return std::min<int>(w.size(), string_util::OneCharLen(w.data()));
+  }
+
+  int mblen = 0;
+  for (int i = 0; i < num_nodes; ++i) {
+    mblen = std::max<int>(trie_results[i].length, mblen);
+  }
+
+  return mblen;
+}
+
+std::string PrefixMatcher::GlobalReplace(absl::string_view w,
+                                         absl::string_view out) const {
+  std::string result;
+  while (!w.empty()) {
+    bool found = false;
+    const int mblen = PrefixMatch(w, &found);
+    if (found) {
+      result.append(out.data(), out.size());
+    } else {
+      result.append(w.data(), mblen);
+    }
+    w.remove_prefix(mblen);
+  }
+  return result;
+}
+
+}  // namespace normalizer
+}  // namespace sentencepiece