diff --git a/LICENSE b/LICENSE
index a1689f9..0082610 100644
--- a/LICENSE
+++ b/LICENSE
@@ -1,6 +1,6 @@
BSD 2-Clause License
-Copyright (c) 2020, wanhuz
+Copyright (c) 2021, wanhuz
All rights reserved.
Redistribution and use in source and binary forms, with or without
diff --git a/lib/mecab/gpl-3.0.txt b/lib/mecab/gpl-3.0.txt
new file mode 100644
index 0000000..f288702
--- /dev/null
+++ b/lib/mecab/gpl-3.0.txt
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc.
+ 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.
+
+
+ Copyright (C)
+
+ 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 .
+
+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:
+
+ Copyright (C)
+ 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
+.
+
+ 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
+.
diff --git a/lib/mecab/include/mecab.h b/lib/mecab/include/mecab.h
new file mode 100644
index 0000000..fff421d
--- /dev/null
+++ b/lib/mecab/include/mecab.h
@@ -0,0 +1,1498 @@
+/*
+ MeCab -- Yet Another Part-of-Speech and Morphological Analyzer
+
+ Copyright(C) 2001-2011 Taku Kudo
+ Copyright(C) 2004-2006 Nippon Telegraph and Telephone Corporation
+*/
+#ifndef MECAB_MECAB_H_
+#define MECAB_MECAB_H_
+
+/* C/C++ common data structures */
+
+/**
+ * DictionaryInfo structure
+ */
+struct mecab_dictionary_info_t {
+ /**
+ * filename of dictionary
+ * On Windows, filename is stored in UTF-8 encoding
+ */
+ const char *filename;
+
+ /**
+ * character set of the dictionary. e.g., "SHIFT-JIS", "UTF-8"
+ */
+ const char *charset;
+
+ /**
+ * How many words are registered in this dictionary.
+ */
+ unsigned int size;
+
+ /**
+ * dictionary type
+ * this value should be MECAB_USR_DIC, MECAB_SYS_DIC, or MECAB_UNK_DIC.
+ */
+ int type;
+
+ /**
+ * left attributes size
+ */
+ unsigned int lsize;
+
+ /**
+ * right attributes size
+ */
+ unsigned int rsize;
+
+ /**
+ * version of this dictionary
+ */
+ unsigned short version;
+
+ /**
+ * pointer to the next dictionary info.
+ */
+ struct mecab_dictionary_info_t *next;
+};
+
+/**
+ * Path structure
+ */
+struct mecab_path_t {
+ /**
+ * pointer to the right node
+ */
+ struct mecab_node_t* rnode;
+
+ /**
+ * pointer to the next right path
+ */
+ struct mecab_path_t* rnext;
+
+ /**
+ * pointer to the left node
+ */
+ struct mecab_node_t* lnode;
+
+ /**
+ * pointer to the next left path
+ */
+
+ struct mecab_path_t* lnext;
+
+ /**
+ * local cost
+ */
+ int cost;
+
+ /**
+ * marginal probability
+ */
+ float prob;
+};
+
+/**
+ * Node structure
+ */
+struct mecab_node_t {
+ /**
+ * pointer to the previous node.
+ */
+ struct mecab_node_t *prev;
+
+ /**
+ * pointer to the next node.
+ */
+ struct mecab_node_t *next;
+
+ /**
+ * pointer to the node which ends at the same position.
+ */
+ struct mecab_node_t *enext;
+
+ /**
+ * pointer to the node which starts at the same position.
+ */
+ struct mecab_node_t *bnext;
+
+ /**
+ * pointer to the right path.
+ * this value is NULL if MECAB_ONE_BEST mode.
+ */
+ struct mecab_path_t *rpath;
+
+ /**
+ * pointer to the right path.
+ * this value is NULL if MECAB_ONE_BEST mode.
+ */
+ struct mecab_path_t *lpath;
+
+ /**
+ * surface string.
+ * this value is not 0 terminated.
+ * You can get the length with length/rlength members.
+ */
+ const char *surface;
+
+ /**
+ * feature string
+ */
+ const char *feature;
+
+ /**
+ * unique node id
+ */
+ unsigned int id;
+
+ /**
+ * length of the surface form.
+ */
+ unsigned short length;
+
+ /**
+ * length of the surface form including white space before the morph.
+ */
+ unsigned short rlength;
+
+ /**
+ * right attribute id
+ */
+ unsigned short rcAttr;
+
+ /**
+ * left attribute id
+ */
+ unsigned short lcAttr;
+
+ /**
+ * unique part of speech id. This value is defined in "pos.def" file.
+ */
+ unsigned short posid;
+
+ /**
+ * character type
+ */
+ unsigned char char_type;
+
+ /**
+ * status of this model.
+ * This value is MECAB_NOR_NODE, MECAB_UNK_NODE, MECAB_BOS_NODE, MECAB_EOS_NODE, or MECAB_EON_NODE.
+ */
+ unsigned char stat;
+
+ /**
+ * set 1 if this node is best node.
+ */
+ unsigned char isbest;
+
+ /**
+ * forward accumulative log summation.
+ * This value is only available when MECAB_MARGINAL_PROB is passed.
+ */
+ float alpha;
+
+ /**
+ * backward accumulative log summation.
+ * This value is only available when MECAB_MARGINAL_PROB is passed.
+ */
+ float beta;
+
+ /**
+ * marginal probability.
+ * This value is only available when MECAB_MARGINAL_PROB is passed.
+ */
+ float prob;
+
+ /**
+ * word cost.
+ */
+ short wcost;
+
+ /**
+ * best accumulative cost from bos node to this node.
+ */
+ long cost;
+};
+
+/**
+ * Parameters for MeCab::Node::stat
+ */
+enum {
+ /**
+ * Normal node defined in the dictionary.
+ */
+ MECAB_NOR_NODE = 0,
+ /**
+ * Unknown node not defined in the dictionary.
+ */
+ MECAB_UNK_NODE = 1,
+ /**
+ * Virtual node representing a beginning of the sentence.
+ */
+ MECAB_BOS_NODE = 2,
+ /**
+ * Virtual node representing a end of the sentence.
+ */
+ MECAB_EOS_NODE = 3,
+
+ /**
+ * Virtual node representing a end of the N-best enumeration.
+ */
+ MECAB_EON_NODE = 4
+};
+
+/**
+ * Parameters for MeCab::DictionaryInfo::type
+ */
+enum {
+ /**
+ * This is a system dictionary.
+ */
+ MECAB_SYS_DIC = 0,
+
+ /**
+ * This is a user dictionary.
+ */
+ MECAB_USR_DIC = 1,
+
+ /**
+ * This is a unknown word dictionary.
+ */
+ MECAB_UNK_DIC = 2
+};
+
+/**
+ * Parameters for MeCab::Lattice::request_type
+ */
+enum {
+ /**
+ * One best result is obtained (default mode)
+ */
+ MECAB_ONE_BEST = 1,
+ /**
+ * Set this flag if you want to obtain N best results.
+ */
+ MECAB_NBEST = 2,
+ /**
+ * Set this flag if you want to enable a partial parsing mode.
+ * When this flag is set, the input |sentence| needs to be written
+ * in partial parsing format.
+ */
+ MECAB_PARTIAL = 4,
+ /**
+ * Set this flag if you want to obtain marginal probabilities.
+ * Marginal probability is set in MeCab::Node::prob.
+ * The parsing speed will get 3-5 times slower than the default mode.
+ */
+ MECAB_MARGINAL_PROB = 8,
+ /**
+ * Set this flag if you want to obtain alternative results.
+ * Not implemented.
+ */
+ MECAB_ALTERNATIVE = 16,
+ /**
+ * When this flag is set, the result linked-list (Node::next/prev)
+ * traverses all nodes in the lattice.
+ */
+ MECAB_ALL_MORPHS = 32,
+
+ /**
+ * When this flag is set, tagger internally copies the body of passed
+ * sentence into internal buffer.
+ */
+ MECAB_ALLOCATE_SENTENCE = 64
+};
+
+/**
+ * Parameters for MeCab::Lattice::boundary_constraint_type
+ */
+enum {
+ /**
+ * The token boundary is not specified.
+ */
+ MECAB_ANY_BOUNDARY = 0,
+
+ /**
+ * The position is a strong token boundary.
+ */
+ MECAB_TOKEN_BOUNDARY = 1,
+
+ /**
+ * The position is not a token boundary.
+ */
+ MECAB_INSIDE_TOKEN = 2
+};
+
+/* C interface */
+#ifdef __cplusplus
+#include
+#else
+#include
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifdef _WIN32
+#include
+# ifdef DLL_EXPORT
+# define MECAB_DLL_EXTERN __declspec(dllexport)
+# define MECAB_DLL_CLASS_EXTERN __declspec(dllexport)
+# else
+# define MECAB_DLL_EXTERN __declspec(dllimport)
+# endif
+#endif
+
+#ifndef MECAB_DLL_EXTERN
+# define MECAB_DLL_EXTERN extern
+#endif
+
+#ifndef MECAB_DLL_CLASS_EXTERN
+# define MECAB_DLL_CLASS_EXTERN
+#endif
+
+ typedef struct mecab_t mecab_t;
+ typedef struct mecab_model_t mecab_model_t;
+ typedef struct mecab_lattice_t mecab_lattice_t;
+ typedef struct mecab_dictionary_info_t mecab_dictionary_info_t;
+ typedef struct mecab_node_t mecab_node_t;
+ typedef struct mecab_path_t mecab_path_t;
+
+#ifndef SWIG
+ /* C interface */
+
+ /* old mecab interface */
+ /**
+ * C wrapper of MeCab::Tagger::create(argc, argv)
+ */
+ MECAB_DLL_EXTERN mecab_t* mecab_new(int argc, char **argv);
+
+ /**
+ * C wrapper of MeCab::Tagger::create(arg)
+ */
+ MECAB_DLL_EXTERN mecab_t* mecab_new2(const char *arg);
+
+ /**
+ * C wrapper of MeCab::Tagger::version()
+ */
+ MECAB_DLL_EXTERN const char* mecab_version();
+
+ /**
+ * C wrapper of MeCab::getLastError()
+ */
+ MECAB_DLL_EXTERN const char* mecab_strerror(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::deleteTagger(tagger)
+ */
+ MECAB_DLL_EXTERN void mecab_destroy(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger:set_partial()
+ */
+ MECAB_DLL_EXTERN int mecab_get_partial(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger::partial()
+ */
+ MECAB_DLL_EXTERN void mecab_set_partial(mecab_t *mecab, int partial);
+
+ /**
+ * C wrapper of MeCab::Tagger::theta()
+ */
+ MECAB_DLL_EXTERN float mecab_get_theta(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger::set_theta()
+ */
+ MECAB_DLL_EXTERN void mecab_set_theta(mecab_t *mecab, float theta);
+
+ /**
+ * C wrapper of MeCab::Tagger::lattice_level()
+ */
+ MECAB_DLL_EXTERN int mecab_get_lattice_level(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger::set_lattice_level()
+ */
+ MECAB_DLL_EXTERN void mecab_set_lattice_level(mecab_t *mecab, int level);
+
+ /**
+ * C wrapper of MeCab::Tagger::all_morphs()
+ */
+ MECAB_DLL_EXTERN int mecab_get_all_morphs(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger::set_all_moprhs()
+ */
+ MECAB_DLL_EXTERN void mecab_set_all_morphs(mecab_t *mecab, int all_morphs);
+
+ /**
+ * C wrapper of MeCab::Tagger::parse(MeCab::Lattice *lattice)
+ */
+ MECAB_DLL_EXTERN int mecab_parse_lattice(mecab_t *mecab, mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Tagger::parse(const char *str)
+ */
+ MECAB_DLL_EXTERN const char* mecab_sparse_tostr(mecab_t *mecab, const char *str);
+
+ /**
+ * C wrapper of MeCab::Tagger::parse(const char *str, size_t len)
+ */
+ MECAB_DLL_EXTERN const char* mecab_sparse_tostr2(mecab_t *mecab, const char *str, size_t len);
+
+ /**
+ * C wrapper of MeCab::Tagger::parse(const char *str, char *ostr, size_t olen)
+ */
+ MECAB_DLL_EXTERN char* mecab_sparse_tostr3(mecab_t *mecab, const char *str, size_t len,
+ char *ostr, size_t olen);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseToNode(const char *str)
+ */
+ MECAB_DLL_EXTERN const mecab_node_t* mecab_sparse_tonode(mecab_t *mecab, const char*);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseToNode(const char *str, size_t len)
+ */
+ MECAB_DLL_EXTERN const mecab_node_t* mecab_sparse_tonode2(mecab_t *mecab, const char*, size_t);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseNBest(size_t N, const char *str)
+ */
+ MECAB_DLL_EXTERN const char* mecab_nbest_sparse_tostr(mecab_t *mecab, size_t N, const char *str);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseNBest(size_t N, const char *str, size_t len)
+ */
+ MECAB_DLL_EXTERN const char* mecab_nbest_sparse_tostr2(mecab_t *mecab, size_t N,
+ const char *str, size_t len);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseNBest(size_t N, const char *str, char *ostr, size_t olen)
+ */
+ MECAB_DLL_EXTERN char* mecab_nbest_sparse_tostr3(mecab_t *mecab, size_t N,
+ const char *str, size_t len,
+ char *ostr, size_t olen);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseNBestInit(const char *str)
+ */
+ MECAB_DLL_EXTERN int mecab_nbest_init(mecab_t *mecab, const char *str);
+
+ /**
+ * C wrapper of MeCab::Tagger::parseNBestInit(const char *str, size_t len)
+ */
+ MECAB_DLL_EXTERN int mecab_nbest_init2(mecab_t *mecab, const char *str, size_t len);
+
+ /**
+ * C wrapper of MeCab::Tagger::next()
+ */
+ MECAB_DLL_EXTERN const char* mecab_nbest_next_tostr(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger::next(char *ostr, size_t olen)
+ */
+ MECAB_DLL_EXTERN char* mecab_nbest_next_tostr2(mecab_t *mecab, char *ostr, size_t olen);
+
+ /**
+ * C wrapper of MeCab::Tagger::nextNode()
+ */
+ MECAB_DLL_EXTERN const mecab_node_t* mecab_nbest_next_tonode(mecab_t *mecab);
+
+ /**
+ * C wrapper of MeCab::Tagger::formatNode(const Node *node)
+ */
+ MECAB_DLL_EXTERN const char* mecab_format_node(mecab_t *mecab, const mecab_node_t *node);
+
+ /**
+ * C wrapper of MeCab::Tagger::dictionary_info()
+ */
+ MECAB_DLL_EXTERN const mecab_dictionary_info_t* mecab_dictionary_info(mecab_t *mecab);
+
+ /* lattice interface */
+ /**
+ * C wrapper of MeCab::createLattice()
+ */
+ MECAB_DLL_EXTERN mecab_lattice_t *mecab_lattice_new();
+
+ /**
+ * C wrapper of MeCab::deleteLattice(lattice)
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_destroy(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::clear()
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_clear(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::is_available()
+ */
+
+ MECAB_DLL_EXTERN int mecab_lattice_is_available(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::bos_node()
+ */
+ MECAB_DLL_EXTERN mecab_node_t *mecab_lattice_get_bos_node(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::eos_node()
+ */
+ MECAB_DLL_EXTERN mecab_node_t *mecab_lattice_get_eos_node(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::begin_nodes()
+ */
+
+ MECAB_DLL_EXTERN mecab_node_t **mecab_lattice_get_all_begin_nodes(mecab_lattice_t *lattice);
+ /**
+ * C wrapper of MeCab::Lattice::end_nodes()
+ */
+ MECAB_DLL_EXTERN mecab_node_t **mecab_lattice_get_all_end_nodes(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::begin_nodes(pos)
+ */
+ MECAB_DLL_EXTERN mecab_node_t *mecab_lattice_get_begin_nodes(mecab_lattice_t *lattice, size_t pos);
+
+ /**
+ * C wrapper of MeCab::Lattice::end_nodes(pos)
+ */
+ MECAB_DLL_EXTERN mecab_node_t *mecab_lattice_get_end_nodes(mecab_lattice_t *lattice, size_t pos);
+
+ /**
+ * C wrapper of MeCab::Lattice::sentence()
+ */
+ MECAB_DLL_EXTERN const char *mecab_lattice_get_sentence(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::set_sentence(sentence)
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_set_sentence(mecab_lattice_t *lattice, const char *sentence);
+
+ /**
+ * C wrapper of MeCab::Lattice::set_sentence(sentence, len)
+ */
+
+ MECAB_DLL_EXTERN void mecab_lattice_set_sentence2(mecab_lattice_t *lattice, const char *sentence, size_t len);
+
+ /**
+ * C wrapper of MeCab::Lattice::size()
+ */
+ MECAB_DLL_EXTERN size_t mecab_lattice_get_size(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::Z()
+ */
+ MECAB_DLL_EXTERN double mecab_lattice_get_z(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::set_Z()
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_set_z(mecab_lattice_t *lattice, double Z);
+
+ /**
+ * C wrapper of MeCab::Lattice::theta()
+ */
+ MECAB_DLL_EXTERN double mecab_lattice_get_theta(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::set_theta()
+ */
+
+ MECAB_DLL_EXTERN void mecab_lattice_set_theta(mecab_lattice_t *lattice, double theta);
+
+ /**
+ * C wrapper of MeCab::Lattice::next()
+ */
+ MECAB_DLL_EXTERN int mecab_lattice_next(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::request_type()
+ */
+ MECAB_DLL_EXTERN int mecab_lattice_get_request_type(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::has_request_type()
+ */
+ MECAB_DLL_EXTERN int mecab_lattice_has_request_type(mecab_lattice_t *lattice, int request_type);
+
+ /**
+ * C wrapper of MeCab::Lattice::set_request_type()
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_set_request_type(mecab_lattice_t *lattice, int request_type);
+
+ /**
+ * C wrapper of MeCab::Lattice::add_request_type()
+ */
+
+ MECAB_DLL_EXTERN void mecab_lattice_add_request_type(mecab_lattice_t *lattice, int request_type);
+
+ /**
+ * C wrapper of MeCab::Lattice::remove_request_type()
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_remove_request_type(mecab_lattice_t *lattice, int request_type);
+
+ /**
+ * C wrapper of MeCab::Lattice::newNode();
+ */
+ MECAB_DLL_EXTERN mecab_node_t *mecab_lattice_new_node(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::toString()
+ */
+ MECAB_DLL_EXTERN const char *mecab_lattice_tostr(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::toString(buf, size)
+ */
+ MECAB_DLL_EXTERN const char *mecab_lattice_tostr2(mecab_lattice_t *lattice, char *buf, size_t size);
+
+ /**
+ * C wrapper of MeCab::Lattice::enumNBestAsString(N)
+ */
+ MECAB_DLL_EXTERN const char *mecab_lattice_nbest_tostr(mecab_lattice_t *lattice, size_t N);
+
+ /**
+ * C wrapper of MeCab::Lattice::enumNBestAsString(N, buf, size)
+ */
+
+ MECAB_DLL_EXTERN const char *mecab_lattice_nbest_tostr2(mecab_lattice_t *lattice, size_t N, char *buf, size_t size);
+
+ /**
+ * C wrapper of MeCab::Lattice::has_constraint()
+ */
+ MECAB_DLL_EXTERN int mecab_lattice_has_constraint(mecab_lattice_t *lattice);
+
+ /**
+ * C wrapper of MeCab::Lattice::boundary_constraint(pos)
+ */
+ MECAB_DLL_EXTERN int mecab_lattice_get_boundary_constraint(mecab_lattice_t *lattice, size_t pos);
+
+
+ /**
+ * C wrapper of MeCab::Lattice::feature_constraint(pos)
+ */
+ MECAB_DLL_EXTERN const char *mecab_lattice_get_feature_constraint(mecab_lattice_t *lattice, size_t pos);
+
+ /**
+ * C wrapper of MeCab::Lattice::boundary_constraint(pos, type)
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_set_boundary_constraint(mecab_lattice_t *lattice, size_t pos, int boundary_type);
+
+ /**
+ * C wrapper of MeCab::Lattice::set_feature_constraint(begin_pos, end_pos, feature)
+ */
+ MECAB_DLL_EXTERN void mecab_lattice_set_feature_constraint(mecab_lattice_t *lattice, size_t begin_pos, size_t end_pos, const char *feature);
+
+ /**
+ * C wrapper of MeCab::Lattice::what()
+ */
+ MECAB_DLL_EXTERN const char *mecab_lattice_strerror(mecab_lattice_t *lattice);
+
+
+ /* model interface */
+ /**
+ * C wapper of MeCab::Model::create(argc, argv)
+ */
+ MECAB_DLL_EXTERN mecab_model_t *mecab_model_new(int argc, char **argv);
+
+ /**
+ * C wapper of MeCab::Model::create(arg)
+ */
+ MECAB_DLL_EXTERN mecab_model_t *mecab_model_new2(const char *arg);
+
+ /**
+ * C wapper of MeCab::deleteModel(model)
+ */
+
+ MECAB_DLL_EXTERN void mecab_model_destroy(mecab_model_t *model);
+
+ /**
+ * C wapper of MeCab::Model::createTagger()
+ */
+ MECAB_DLL_EXTERN mecab_t *mecab_model_new_tagger(mecab_model_t *model);
+
+ /**
+ * C wapper of MeCab::Model::createLattice()
+ */
+ MECAB_DLL_EXTERN mecab_lattice_t *mecab_model_new_lattice(mecab_model_t *model);
+
+ /**
+ * C wrapper of MeCab::Model::swap()
+ */
+ MECAB_DLL_EXTERN int mecab_model_swap(mecab_model_t *model, mecab_model_t *new_model);
+
+ /**
+ * C wapper of MeCab::Model::dictionary_info()
+ */
+ MECAB_DLL_EXTERN const mecab_dictionary_info_t* mecab_model_dictionary_info(mecab_model_t *model);
+
+ /**
+ * C wrapper of MeCab::Model::transition_cost()
+ */
+ MECAB_DLL_EXTERN int mecab_model_transition_cost(mecab_model_t *model,
+ unsigned short rcAttr,
+ unsigned short lcAttr);
+
+ /**
+ * C wrapper of MeCab::Model::lookup()
+ */
+ MECAB_DLL_EXTERN mecab_node_t *mecab_model_lookup(mecab_model_t *model,
+ const char *begin,
+ const char *end,
+ mecab_lattice_t *lattice);
+
+ /* static functions */
+ MECAB_DLL_EXTERN int mecab_do(int argc, char **argv);
+ MECAB_DLL_EXTERN int mecab_dict_index(int argc, char **argv);
+ MECAB_DLL_EXTERN int mecab_dict_gen(int argc, char **argv);
+ MECAB_DLL_EXTERN int mecab_cost_train(int argc, char **argv);
+ MECAB_DLL_EXTERN int mecab_system_eval(int argc, char **argv);
+ MECAB_DLL_EXTERN int mecab_test_gen(int argc, char **argv);
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+/* C++ interface */
+#ifdef __cplusplus
+
+namespace MeCab {
+typedef struct mecab_dictionary_info_t DictionaryInfo;
+typedef struct mecab_path_t Path;
+typedef struct mecab_node_t Node;
+
+template class Allocator;
+class Tagger;
+
+/**
+ * Lattice class
+ */
+class MECAB_DLL_CLASS_EXTERN Lattice {
+public:
+ /**
+ * Clear all internal lattice data.
+ */
+ virtual void clear() = 0;
+
+ /**
+ * Return true if result object is available.
+ * @return boolean
+ */
+ virtual bool is_available() const = 0;
+
+ /**
+ * Return bos (begin of sentence) node.
+ * You can obtain all nodes via "for (const Node *node = lattice->bos_node(); node; node = node->next) {}"
+ * @return bos node object
+ */
+ virtual Node *bos_node() const = 0;
+
+ /**
+ * Return eos (end of sentence) node.
+ * @return eos node object
+ */
+ virtual Node *eos_node() const = 0;
+
+#ifndef SWIG
+ /**
+ * This method is used internally.
+ */
+ virtual Node **begin_nodes() const = 0;
+
+ /**
+ * This method is used internally.
+ */
+ virtual Node **end_nodes() const = 0;
+#endif
+
+ /**
+ * Return node linked list ending at |pos|.
+ * You can obtain all nodes via "for (const Node *node = lattice->end_nodes(pos); node; node = node->enext) {}"
+ * @param pos position of nodes. 0 <= pos < size()
+ * @return node linked list
+ */
+ virtual Node *end_nodes(size_t pos) const = 0;
+
+ /**
+ * Return node linked list starting at |pos|.
+ * You can obtain all nodes via "for (const Node *node = lattice->begin_nodes(pos); node; node = node->bnext) {}"
+ * @param pos position of nodes. 0 <= pos < size()
+ * @return node linked list
+ */
+ virtual Node *begin_nodes(size_t pos) const = 0;
+
+ /**
+ * Return sentence.
+ * If MECAB_NBEST or MECAB_PARTIAL mode is off, the returned poiner is the same as the one set by set_sentence().
+ * @return sentence
+ */
+ virtual const char *sentence() const = 0;
+
+ /**
+ * Set sentence. This method does not take the ownership of the object.
+ * @param sentence sentence
+ */
+ virtual void set_sentence(const char *sentence) = 0;
+
+#ifndef SWIG
+ /**
+ * Set sentence. This method does not take the ownership of the object.
+ * @param sentence sentence
+ * @param len length of the sentence
+ */
+ virtual void set_sentence(const char *sentence, size_t len) = 0;
+#endif
+
+ /**
+ * Return sentence size.
+ * @return sentence size
+ */
+ virtual size_t size() const = 0;
+
+ /**
+ * Set normalization factor of CRF.
+ * @param Z new normalization factor.
+ */
+ virtual void set_Z(double Z) = 0;
+
+ /**
+ * return normalization factor of CRF.
+ * @return normalization factor.
+ */
+ virtual double Z() const = 0;
+
+ /**
+ * Set temparature parameter theta.
+ * @param theta temparature parameter.
+ */
+ virtual void set_theta(float theta) = 0;
+
+ /**
+ * Return temparature parameter theta.
+ * @return temparature parameter.
+ */
+ virtual float theta() const = 0;
+
+ /**
+ * Obtain next-best result. The internal linked list structure is updated.
+ * You should set MECAB_NBEST reques_type in advance.
+ * Return false if no more results are available or request_type is invalid.
+ * @return boolean
+ */
+ virtual bool next() = 0;
+
+ /**
+ * Return the current request type.
+ * @return request type
+ */
+ virtual int request_type() const = 0;
+
+ /**
+ * Return true if the object has a specified request type.
+ * @return boolean
+ */
+ virtual bool has_request_type(int request_type) const = 0;
+
+ /**
+ * Set request type.
+ * @param request_type new request type assigned
+ */
+ virtual void set_request_type(int request_type) = 0;
+
+ /**
+ * Add request type.
+ * @param request_type new request type added
+ */
+ virtual void add_request_type(int request_type) = 0;
+
+ /**
+ * Remove request type.
+ * @param request_type new request type removed
+ */
+ virtual void remove_request_type(int request_type) = 0;
+
+#ifndef SWIG
+ /**
+ * This method is used internally.
+ */
+ virtual Allocator *allocator() const = 0;
+#endif
+
+ /**
+ * Return new node. Lattice objects has the ownership of the node.
+ * @return new node object
+ */
+ virtual Node *newNode() = 0;
+
+ /**
+ * Return string representation of the lattice.
+ * Returned object is managed by this instance. When clear/set_sentence() method
+ * is called, the returned buffer is initialized.
+ * @return string representation of the lattice
+ */
+ virtual const char *toString() = 0;
+
+ /**
+ * Return string representation of the node.
+ * Returned object is managed by this instance. When clear/set_sentence() method
+ * is called, the returned buffer is initialized.
+ * @return string representation of the node
+ * @param node node object
+ */
+ virtual const char *toString(const Node *node) = 0;
+
+ /**
+ * Return string representation of the N-best results.
+ * Returned object is managed by this instance. When clear/set_sentence() method
+ * is called, the returned buffer is initialized.
+ * @return string representation of the node
+ * @param N how many results you want to obtain
+ */
+ virtual const char *enumNBestAsString(size_t N) = 0;
+
+#ifndef SWIG
+ /**
+ * Return string representation of the lattice.
+ * Result is saved in the specified buffer.
+ * @param buf output buffer
+ * @param size output buffer size
+ * @return string representation of the lattice
+ */
+ virtual const char *toString(char *buf, size_t size) = 0;
+
+ /**
+ * Return string representation of the node.
+ * Result is saved in the specified buffer.
+ * @param node node object
+ * @param buf output buffer
+ * @param size output buffer size
+ * @return string representation of the lattice
+ */
+ virtual const char *toString(const Node *node,
+ char *buf, size_t size) = 0;
+
+ /**
+ * Return string representation of the N-best result.
+ * Result is saved in the specified.
+ * @param N how many results you want to obtain
+ * @param buf output buffer
+ * @param size output buffer size
+ * @return string representation of the lattice
+ */
+ virtual const char *enumNBestAsString(size_t N, char *buf, size_t size) = 0;
+#endif
+
+ /**
+ * Returns true if any parsing constraint is set
+ */
+ virtual bool has_constraint() const = 0;
+
+ /**
+ * Returns the boundary constraint at the position.
+ * @param pos the position of constraint
+ * @return boundary constraint type
+ */
+ virtual int boundary_constraint(size_t pos) const = 0;
+
+ /**
+ * Returns the token constraint at the position.
+ * @param pos the beginning position of constraint.
+ * @return constrained node starting at the position.
+ */
+ virtual const char *feature_constraint(size_t pos) const = 0;
+
+ /**
+ * Set parsing constraint for partial parsing mode.
+ * @param pos the position of the boundary
+ * @param boundary_constraint_type the type of boundary
+ */
+ virtual void set_boundary_constraint(size_t pos,
+ int boundary_constraint_type) = 0;
+
+ /**
+ * Set parsing constraint for partial parsing mode.
+ * @param begin_pos the starting position of the constrained token.
+ * @param end_pos the the ending position of the constrained token.
+ * @param feature the feature of the constrained token.
+ */
+ virtual void set_feature_constraint(
+ size_t begin_pos, size_t end_pos,
+ const char *feature) = 0;
+
+ /**
+ * Return error string.
+ * @return error string
+ */
+ virtual const char *what() const = 0;
+
+ /**
+ * Set error string. given string is copied to the internal buffer.
+ * @param str new error string
+ */
+ virtual void set_what(const char *str) = 0;
+
+#ifndef SWIG
+ /**
+ * Create new Lattice object
+ * @return new Lattice object
+ */
+ static Lattice *create();
+#endif
+
+ virtual ~Lattice() {}
+};
+
+/**
+ * Model class
+ */
+class MECAB_DLL_CLASS_EXTERN Model {
+public:
+ /**
+ * Return DictionaryInfo linked list.
+ * @return DictionaryInfo linked list
+ */
+ virtual const DictionaryInfo *dictionary_info() const = 0;
+
+ /**
+ * Return transtion cost from rcAttr to lcAttr.
+ * @return transtion cost
+ */
+ virtual int transition_cost(unsigned short rcAttr,
+ unsigned short lcAttr) const = 0;
+
+ /**
+ * perform common prefix search from the range [begin, end).
+ * |lattice| takes the ownership of return value.
+ * @return node linked list.
+ */
+ virtual Node *lookup(const char *begin, const char *end,
+ Lattice *lattice) const = 0;
+
+ /**
+ * Create a new Tagger object.
+ * All returned tagger object shares this model object as a parsing model.
+ * Never delete this model object before deleting tagger object.
+ * @return new Tagger object
+ */
+ virtual Tagger *createTagger() const = 0;
+
+ /**
+ * Create a new Lattice object.
+ * @return new Lattice object
+ */
+ virtual Lattice *createLattice() const = 0;
+
+ /**
+ * Swap the instance with |model|.
+ * The ownership of |model| always moves to this instance,
+ * meaning that passed |model| will no longer be accessible after calling this method.
+ * return true if new model is swapped successfully.
+ * This method is thread safe. All taggers created by
+ * Model::createTagger() method will also be updated asynchronously.
+ * No need to stop the parsing thread excplicitly before swapping model object.
+ * @return boolean
+ * @param model new model which is going to be swapped with the current model.
+ */
+ virtual bool swap(Model *model) = 0;
+
+ /**
+ * Return a version string
+ * @return version string
+ */
+ static const char *version();
+
+ virtual ~Model() {}
+
+#ifndef SIWG
+ /**
+ * Factory method to create a new Model with a specified main's argc/argv-style parameters.
+ * Return NULL if new model cannot be initialized. Use MeCab::getLastError() to obtain the
+ * cause of the errors.
+ * @return new Model object
+ * @param argc number of parameters
+ * @param argv parameter list
+ */
+ static Model* create(int argc, char **argv);
+
+ /**
+ * Factory method to create a new Model with a string parameter representation, i.e.,
+ * "-d /user/local/mecab/dic/ipadic -Ochasen".
+ * Return NULL if new model cannot be initialized. Use MeCab::getLastError() to obtain the
+ * cause of the errors.
+ * @return new Model object
+ * @param arg single string representation of the argment.
+ */
+ static Model* create(const char *arg);
+#endif
+};
+
+/**
+ * Tagger class
+ */
+class MECAB_DLL_CLASS_EXTERN Tagger {
+public:
+ /**
+ * Handy static method.
+ * Return true if lattice is parsed successfully.
+ * This function is equivalent to
+ * {
+ * Tagger *tagger = model.createModel();
+ * cosnt bool result = tagger->parse(lattice);
+ * delete tagger;
+ * return result;
+ * }
+ * @return boolean
+ */
+ static bool parse(const Model &model, Lattice *lattice);
+
+ /**
+ * Parse lattice object.
+ * Return true if lattice is parsed successfully.
+ * A sentence must be set to the lattice with Lattice:set_sentence object before calling this method.
+ * Parsed node object can be obtained with Lattice:bos_node.
+ * This method is thread safe.
+ * @return lattice lattice object
+ * @return boolean
+ */
+ virtual bool parse(Lattice *lattice) const = 0;
+
+ /**
+ * Parse given sentence and return parsed result as string.
+ * You should not delete the returned string. The returned buffer
+ * is overwritten when parse method is called again.
+ * This method is NOT thread safe.
+ * @param str sentence
+ * @return parsed result
+ */
+ virtual const char* parse(const char *str) = 0;
+
+ /**
+ * Parse given sentence and return Node object.
+ * You should not delete the returned node object. The returned buffer
+ * is overwritten when parse method is called again.
+ * You can traverse all nodes via Node::next member.
+ * This method is NOT thread safe.
+ * @param str sentence
+ * @return bos node object
+ */
+ virtual const Node* parseToNode(const char *str) = 0;
+
+ /**
+ * Parse given sentence and obtain N-best results as a string format.
+ * Currently, N must be 1 <= N <= 512 due to the limitation of the buffer size.
+ * You should not delete the returned string. The returned buffer
+ * is overwritten when parse method is called again.
+ * This method is DEPRECATED. Use Lattice class.
+ * @param N how many results you want to obtain
+ * @param str sentence
+ * @return parsed result
+ */
+ virtual const char* parseNBest(size_t N, const char *str) = 0;
+
+ /**
+ * Initialize N-best enumeration with a sentence.
+ * Return true if initialization finishes successfully.
+ * N-best result is obtained by calling next() or nextNode() in sequence.
+ * This method is NOT thread safe.
+ * This method is DEPRECATED. Use Lattice class.
+ * @param str sentence
+ * @return boolean
+ */
+ virtual bool parseNBestInit(const char *str) = 0;
+
+ /**
+ * Return next-best parsed result. You must call parseNBestInit() in advance.
+ * Return NULL if no more reuslt is available.
+ * This method is NOT thread safe.
+ * This method is DEPRECATED. Use Lattice class.
+ * @return node object
+ */
+ virtual const Node* nextNode() = 0;
+
+ /**
+ * Return next-best parsed result. You must call parseNBestInit() in advance.
+ * Return NULL if no more reuslt is available.
+ * This method is NOT thread safe.
+ * This method is DEPRECATED. Use Lattice class.
+ * @return parsed result
+ */
+ virtual const char* next() = 0;
+
+ /**
+ * Return formatted node object. The format is specified with
+ * --unk-format, --bos-format, --eos-format, and --eon-format respectively.
+ * You should not delete the returned string. The returned buffer
+ * is overwritten when parse method is called again.
+ * This method is NOT thread safe.
+ * This method is DEPRECATED. Use Lattice class.
+ * @param node node object.
+ * @return parsed result
+ */
+ virtual const char* formatNode(const Node *node) = 0;
+
+#ifndef SWIG
+ /**
+ * The same as parse() method, but input length and output buffer are passed.
+ * Return parsed result as string. The result pointer is the same as |ostr|.
+ * Return NULL, if parsed result string cannot be stored within |olen| bytes.
+ * @param str sentence
+ * @param len sentence length
+ * @param ostr output buffer
+ * @param olen output buffer length
+ * @return parsed result
+ */
+ virtual const char* parse(const char *str, size_t len, char *ostr, size_t olen) = 0;
+
+ /**
+ * The same as parse() method, but input length can be passed.
+ * @param str sentence
+ * @param len sentence length
+ * @return parsed result
+ */
+ virtual const char* parse(const char *str, size_t len) = 0;
+
+ /**
+ * The same as parseToNode(), but input lenth can be passed.
+ * @param str sentence
+ * @param len sentence length
+ * @return node object
+ */
+ virtual const Node* parseToNode(const char *str, size_t len) = 0;
+
+ /**
+ * The same as parseNBest(), but input length can be passed.
+ * @param N how many results you want to obtain
+ * @param str sentence
+ * @param len sentence length
+ * @return parsed result
+ */
+ virtual const char* parseNBest(size_t N, const char *str, size_t len) = 0;
+
+ /**
+ * The same as parseNBestInit(), but input length can be passed.
+ * @param str sentence
+ * @param len sentence length
+ * @return boolean
+ * @return parsed result
+ */
+ virtual bool parseNBestInit(const char *str, size_t len) = 0;
+
+ /**
+ * The same as next(), but output buffer can be passed.
+ * Return NULL if more than |olen| buffer is required to store output string.
+ * @param ostr output buffer
+ * @param olen output buffer length
+ * @return parsed result
+ */
+ virtual const char* next(char *ostr , size_t olen) = 0;
+
+ /**
+ * The same as parseNBest(), but input length and output buffer can be passed.
+ * Return NULL if more than |olen| buffer is required to store output string.
+ * @param N how many results you want to obtain
+ * @param str input sentence
+ * @param len input sentence length
+ * @param ostr output buffer
+ * @param olen output buffer length
+ * @return parsed result
+ */
+ virtual const char* parseNBest(size_t N, const char *str,
+ size_t len, char *ostr, size_t olen) = 0;
+
+ /**
+ * The same as formatNode(), but output buffer can be passed.
+ * Return NULL if more than |olen| buffer is required to store output string.
+ * @param node node object
+ * @param ostr output buffer
+ * @param olen output buffer length
+ * @return parsed result
+ */
+ virtual const char* formatNode(const Node *node, char *ostr, size_t olen) = 0;
+#endif
+
+ /**
+ * Set request type.
+ * This method is DEPRECATED. Use Lattice::set_request_type(MECAB_PARTIAL).
+ * @param request_type new request type assigned
+ */
+ virtual void set_request_type(int request_type) = 0;
+
+ /**
+ * Return the current request type.
+ * This method is DEPRECATED. Use Lattice class.
+ * @return request type
+ */
+ virtual int request_type() const = 0;
+
+ /**
+ * Return true if partial parsing mode is on.
+ * This method is DEPRECATED. Use Lattice::has_request_type(MECAB_PARTIAL).
+ * @return boolean
+ */
+ virtual bool partial() const = 0;
+
+ /**
+ * set partial parsing mode.
+ * This method is DEPRECATED. Use Lattice::add_request_type(MECAB_PARTIAL) or Lattice::remove_request_type(MECAB_PARTIAL)
+ * @param partial partial mode
+ */
+ virtual void set_partial(bool partial) = 0;
+
+ /**
+ * Return lattice level.
+ * This method is DEPRECATED. Use Lattice::*_request_type()
+ * @return int lattice level
+ */
+ virtual int lattice_level() const = 0;
+
+ /**
+ * Set lattice level.
+ * This method is DEPRECATED. Use Lattice::*_request_type()
+ * @param level lattice level
+ */
+ virtual void set_lattice_level(int level) = 0;
+
+ /**
+ * Return true if all morphs output mode is on.
+ * This method is DEPRECATED. Use Lattice::has_request_type(MECAB_ALL_MORPHS).
+ * @return boolean
+ */
+ virtual bool all_morphs() const = 0;
+
+ /**
+ * set all-morphs output mode.
+ * This method is DEPRECATED. Use Lattice::add_request_type(MECAB_ALL_MORPHS) or Lattice::remove_request_type(MECAB_ALL_MORPHS)
+ * @param all_morphs
+ */
+ virtual void set_all_morphs(bool all_morphs) = 0;
+
+ /**
+ * Set temparature parameter theta.
+ * @param theta temparature parameter.
+ */
+ virtual void set_theta(float theta) = 0;
+
+ /**
+ * Return temparature parameter theta.
+ * @return temparature parameter.
+ */
+ virtual float theta() const = 0;
+
+ /**
+ * Return DictionaryInfo linked list.
+ * @return DictionaryInfo linked list
+ */
+ virtual const DictionaryInfo* dictionary_info() const = 0;
+
+ /**
+ * Return error string.
+ * @return error string
+ */
+ virtual const char* what() const = 0;
+
+ virtual ~Tagger() {}
+
+#ifndef SIWG
+ /**
+ * Factory method to create a new Tagger with a specified main's argc/argv-style parameters.
+ * Return NULL if new model cannot be initialized. Use MeCab::getLastError() to obtain the
+ * cause of the errors.
+ * @return new Tagger object
+ * @param argc number of parameters
+ * @param argv parameter list
+ */
+ static Tagger *create(int argc, char **argv);
+
+ /**
+ * Factory method to create a new Tagger with a string parameter representation, i.e.,
+ * "-d /user/local/mecab/dic/ipadic -Ochasen".
+ * Return NULL if new model cannot be initialized. Use MeCab::getLastError() to obtain the
+ * cause of the errors.
+ * @return new Model object
+ * @param arg single string representation of the argment.
+ */
+ static Tagger *create(const char *arg);
+#endif
+
+ /**
+ * Return a version string
+ * @return version string
+ */
+ static const char *version();
+};
+
+#ifndef SWIG
+/**
+ * Alias of Lattice::create()
+ */
+MECAB_DLL_EXTERN Lattice *createLattice();
+
+/**
+ * Alias of Mode::create(argc, argv)
+ */
+MECAB_DLL_EXTERN Model *createModel(int argc, char **argv);
+
+/**
+ * Alias of Mode::create(arg)
+ */
+MECAB_DLL_EXTERN Model *createModel(const char *arg);
+
+/**
+ * Alias of Tagger::create(argc, argv)
+ */
+MECAB_DLL_EXTERN Tagger *createTagger(int argc, char **argv);
+
+/**
+ * Alias of Tagger::create(arg)
+ */
+MECAB_DLL_EXTERN Tagger *createTagger(const char *arg);
+
+/**
+ * delete Lattice object.
+ * This method calles "delete lattice".
+ * In some environment, e.g., MS-Windows, an object allocated inside a DLL must be deleted in the same DLL too.
+ * @param lattice lattice object
+ */
+MECAB_DLL_EXTERN void deleteLattice(Lattice *lattice);
+
+
+/**
+ * delete Model object.
+ * This method calles "delete model".
+ * In some environment, e.g., MS-Windows, an object allocated inside a DLL must be deleted in the same DLL too.
+ * @param model model object
+ */
+MECAB_DLL_EXTERN void deleteModel(Model *model);
+
+/**
+ * delete Tagger object.
+ * This method calles "delete tagger".
+ * In some environment, e.g., MS-Windows, an object allocated inside a DLL must be deleted in the same DLL too.
+ * @param tagger tagger object
+ */
+MECAB_DLL_EXTERN void deleteTagger(Tagger *tagger);
+
+/**
+ * Return last error string.
+ * @return error string
+ */
+MECAB_DLL_EXTERN const char* getLastError();
+
+/**
+ * An alias of getLastError.
+ * It is kept for backward compatibility.
+ * @return error string
+ */
+MECAB_DLL_EXTERN const char* getTaggerError();
+#endif
+}
+#endif
+#endif /* MECAB_MECAB_H_ */
diff --git a/res/dict/JMDict.txt b/res/dict/JMDict.txt
new file mode 100644
index 0000000..1dc02cf
--- /dev/null
+++ b/res/dict/JMDict.txt
@@ -0,0 +1,4 @@
+This project uses the JMdict/EDICT dictionary files. These files are the property of the Electronic Dictionary Research and Development Group, and are used in conformance with the Group's licence.
+
+JMdict/EDICT: http://www.edrdg.org/wiki/index.php/JMdict-EDICT_Dictionary_Project
+Licence information: http://www.edrdg.org/edrdg/licence.html
\ No newline at end of file
diff --git a/res/JMdict_e b/res/dict/JMdict_e
similarity index 100%
rename from res/JMdict_e
rename to res/dict/JMdict_e
diff --git a/res/NotoSansMonoCJKjp-Regular.otf b/res/font/NotoSansMonoCJKjp-Regular.otf
similarity index 100%
rename from res/NotoSansMonoCJKjp-Regular.otf
rename to res/font/NotoSansMonoCJKjp-Regular.otf
diff --git a/res/font/OFL.txt b/res/font/OFL.txt
new file mode 100644
index 0000000..7315d24
--- /dev/null
+++ b/res/font/OFL.txt
@@ -0,0 +1,97 @@
+Copyright (c) 2021, wanhuz (https://github.com/wanhuz/melonpan),
+with Reserved Font Name NotoSansMonoCJKjp-Regular.
+Copyright (c) 2021, wanhuz (https://github.com/wanhuz/melonpan),
+with Reserved Font Name NotoSansMonoCJKjp-Regular.
+Copyright (c) 2021, wanhuz (https://github.com/wanhuz/melonpan).
+
+This Font Software is licensed under the SIL Open Font License, Version 1.1.
+This license is copied below, and is also available with a FAQ at:
+http://scripts.sil.org/OFL
+
+
+-----------------------------------------------------------
+SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
+-----------------------------------------------------------
+
+PREAMBLE
+The goals of the Open Font License (OFL) are to stimulate worldwide
+development of collaborative font projects, to support the font creation
+efforts of academic and linguistic communities, and to provide a free and
+open framework in which fonts may be shared and improved in partnership
+with others.
+
+The OFL allows the licensed fonts to be used, studied, modified and
+redistributed freely as long as they are not sold by themselves. The
+fonts, including any derivative works, can be bundled, embedded,
+redistributed and/or sold with any software provided that any reserved
+names are not used by derivative works. The fonts and derivatives,
+however, cannot be released under any other type of license. The
+requirement for fonts to remain under this license does not apply
+to any document created using the fonts or their derivatives.
+
+DEFINITIONS
+"Font Software" refers to the set of files released by the Copyright
+Holder(s) under this license and clearly marked as such. This may
+include source files, build scripts and documentation.
+
+"Reserved Font Name" refers to any names specified as such after the
+copyright statement(s).
+
+"Original Version" refers to the collection of Font Software components as
+distributed by the Copyright Holder(s).
+
+"Modified Version" refers to any derivative made by adding to, deleting,
+or substituting -- in part or in whole -- any of the components of the
+Original Version, by changing formats or by porting the Font Software to a
+new environment.
+
+"Author" refers to any designer, engineer, programmer, technical
+writer or other person who contributed to the Font Software.
+
+PERMISSION & CONDITIONS
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of the Font Software, to use, study, copy, merge, embed, modify,
+redistribute, and sell modified and unmodified copies of the Font
+Software, subject to the following conditions:
+
+1) Neither the Font Software nor any of its individual components,
+in Original or Modified Versions, may be sold by itself.
+
+2) Original or Modified Versions of the Font Software may be bundled,
+redistributed and/or sold with any software, provided that each copy
+contains the above copyright notice and this license. These can be
+included either as stand-alone text files, human-readable headers or
+in the appropriate machine-readable metadata fields within text or
+binary files as long as those fields can be easily viewed by the user.
+
+3) No Modified Version of the Font Software may use the Reserved Font
+Name(s) unless explicit written permission is granted by the corresponding
+Copyright Holder. This restriction only applies to the primary font name as
+presented to the users.
+
+4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
+Software shall not be used to promote, endorse or advertise any
+Modified Version, except to acknowledge the contribution(s) of the
+Copyright Holder(s) and the Author(s) or with their explicit written
+permission.
+
+5) The Font Software, modified or unmodified, in part or in whole,
+must be distributed entirely under this license, and must not be
+distributed under any other license. The requirement for fonts to
+remain under this license does not apply to any document created
+using the Font Software.
+
+TERMINATION
+This license becomes null and void if any of the above conditions are
+not met.
+
+DISCLAIMER
+THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
+OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
+COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
+DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
+OTHER DEALINGS IN THE FONT SOFTWARE.
diff --git a/res/tessdata/LICENSE.txt b/res/tessdata/LICENSE.txt
new file mode 100644
index 0000000..d645695
--- /dev/null
+++ b/res/tessdata/LICENSE.txt
@@ -0,0 +1,202 @@
+
+ Apache License
+ Version 2.0, January 2004
+ http://www.apache.org/licenses/
+
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+ 1. Definitions.
+
+ "License" shall mean the terms and conditions for use, reproduction,
+ and distribution as defined by Sections 1 through 9 of this document.
+
+ "Licensor" shall mean the copyright owner or entity authorized by
+ the copyright owner that is granting the License.
+
+ "Legal Entity" shall mean the union of the acting entity and all
+ other entities that control, are controlled by, or are under common
+ control with that entity. For the purposes of this definition,
+ "control" means (i) the power, direct or indirect, to cause the
+ direction or management of such entity, whether by contract or
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
+ outstanding shares, or (iii) beneficial ownership of such entity.
+
+ "You" (or "Your") shall mean an individual or Legal Entity
+ exercising permissions granted by this License.
+
+ "Source" form shall mean the preferred form for making modifications,
+ including but not limited to software source code, documentation
+ source, and configuration files.
+
+ "Object" form shall mean any form resulting from mechanical
+ transformation or translation of a Source form, including but
+ not limited to compiled object code, generated documentation,
+ and conversions to other media types.
+
+ "Work" shall mean the work of authorship, whether in Source or
+ Object form, made available under the License, as indicated by a
+ copyright notice that is included in or attached to the work
+ (an example is provided in the Appendix below).
+
+ "Derivative Works" shall mean any work, whether in Source or Object
+ form, that is based on (or derived from) the Work and for which the
+ editorial revisions, annotations, elaborations, or other modifications
+ represent, as a whole, an original work of authorship. For the purposes
+ of this License, Derivative Works shall not include works that remain
+ separable from, or merely link (or bind by name) to the interfaces of,
+ the Work and Derivative Works thereof.
+
+ "Contribution" shall mean any work of authorship, including
+ the original version of the Work and any modifications or additions
+ to that Work or Derivative Works thereof, that is intentionally
+ submitted to Licensor for inclusion in the Work by the copyright owner
+ or by an individual or Legal Entity authorized to submit on behalf of
+ the copyright owner. For the purposes of this definition, "submitted"
+ means any form of electronic, verbal, or written communication sent
+ to the Licensor or its representatives, including but not limited to
+ communication on electronic mailing lists, source code control systems,
+ and issue tracking systems that are managed by, or on behalf of, the
+ Licensor for the purpose of discussing and improving the Work, but
+ excluding communication that is conspicuously marked or otherwise
+ designated in writing by the copyright owner as "Not a Contribution."
+
+ "Contributor" shall mean Licensor and any individual or Legal Entity
+ on behalf of whom a Contribution has been received by Licensor and
+ subsequently incorporated within the Work.
+
+ 2. Grant of Copyright License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ copyright license to reproduce, prepare Derivative Works of,
+ publicly display, publicly perform, sublicense, and distribute the
+ Work and such Derivative Works in Source or Object form.
+
+ 3. Grant of Patent License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ (except as stated in this section) patent license to make, have made,
+ use, offer to sell, sell, import, and otherwise transfer the Work,
+ where such license applies only to those patent claims licensable
+ by such Contributor that are necessarily infringed by their
+ Contribution(s) alone or by combination of their Contribution(s)
+ with the Work to which such Contribution(s) was submitted. If You
+ institute patent litigation against any entity (including a
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
+ or a Contribution incorporated within the Work constitutes direct
+ or contributory patent infringement, then any patent licenses
+ granted to You under this License for that Work shall terminate
+ as of the date such litigation is filed.
+
+ 4. Redistribution. You may reproduce and distribute copies of the
+ Work or Derivative Works thereof in any medium, with or without
+ modifications, and in Source or Object form, provided that You
+ meet the following conditions:
+
+ (a) You must give any other recipients of the Work or
+ Derivative Works a copy of this License; and
+
+ (b) You must cause any modified files to carry prominent notices
+ stating that You changed the files; and
+
+ (c) You must retain, in the Source form of any Derivative Works
+ that You distribute, all copyright, patent, trademark, and
+ attribution notices from the Source form of the Work,
+ excluding those notices that do not pertain to any part of
+ the Derivative Works; and
+
+ (d) If the Work includes a "NOTICE" text file as part of its
+ distribution, then any Derivative Works that You distribute must
+ include a readable copy of the attribution notices contained
+ within such NOTICE file, excluding those notices that do not
+ pertain to any part of the Derivative Works, in at least one
+ of the following places: within a NOTICE text file distributed
+ as part of the Derivative Works; within the Source form or
+ documentation, if provided along with the Derivative Works; or,
+ within a display generated by the Derivative Works, if and
+ wherever such third-party notices normally appear. The contents
+ of the NOTICE file are for informational purposes only and
+ do not modify the License. You may add Your own attribution
+ notices within Derivative Works that You distribute, alongside
+ or as an addendum to the NOTICE text from the Work, provided
+ that such additional attribution notices cannot be construed
+ as modifying the License.
+
+ You may add Your own copyright statement to Your modifications and
+ may provide additional or different license terms and conditions
+ for use, reproduction, or distribution of Your modifications, or
+ for any such Derivative Works as a whole, provided Your use,
+ reproduction, and distribution of the Work otherwise complies with
+ the conditions stated in this License.
+
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
+ any Contribution intentionally submitted for inclusion in the Work
+ by You to the Licensor shall be under the terms and conditions of
+ this License, without any additional terms or conditions.
+ Notwithstanding the above, nothing herein shall supersede or modify
+ the terms of any separate license agreement you may have executed
+ with Licensor regarding such Contributions.
+
+ 6. Trademarks. This License does not grant permission to use the trade
+ names, trademarks, service marks, or product names of the Licensor,
+ except as required for reasonable and customary use in describing the
+ origin of the Work and reproducing the content of the NOTICE file.
+
+ 7. Disclaimer of Warranty. Unless required by applicable law or
+ agreed to in writing, Licensor provides the Work (and each
+ Contributor provides its Contributions) on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+ implied, including, without limitation, any warranties or conditions
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+ PARTICULAR PURPOSE. You are solely responsible for determining the
+ appropriateness of using or redistributing the Work and assume any
+ risks associated with Your exercise of permissions under this License.
+
+ 8. Limitation of Liability. In no event and under no legal theory,
+ whether in tort (including negligence), contract, or otherwise,
+ unless required by applicable law (such as deliberate and grossly
+ negligent acts) or agreed to in writing, shall any Contributor be
+ liable to You for damages, including any direct, indirect, special,
+ incidental, or consequential damages of any character arising as a
+ result of this License or out of the use or inability to use the
+ Work (including but not limited to damages for loss of goodwill,
+ work stoppage, computer failure or malfunction, or any and all
+ other commercial damages or losses), even if such Contributor
+ has been advised of the possibility of such damages.
+
+ 9. Accepting Warranty or Additional Liability. While redistributing
+ the Work or Derivative Works thereof, You may choose to offer,
+ and charge a fee for, acceptance of support, warranty, indemnity,
+ or other liability obligations and/or rights consistent with this
+ License. However, in accepting such obligations, You may act only
+ on Your own behalf and on Your sole responsibility, not on behalf
+ of any other Contributor, and only if You agree to indemnify,
+ defend, and hold each Contributor harmless for any liability
+ incurred by, or claims asserted against, such Contributor by reason
+ of your accepting any such warranty or additional liability.
+
+ END OF TERMS AND CONDITIONS
+
+ APPENDIX: How to apply the Apache License to your work.
+
+ To apply the Apache License to your work, attach the following
+ boilerplate notice, with the fields enclosed by brackets "[]"
+ replaced with your own identifying information. (Don't include
+ the brackets!) The text should be enclosed in the appropriate
+ comment syntax for the file format. We also recommend that a
+ file or class name and description of purpose be included on the
+ same "printed page" as the copyright notice for easier
+ identification within third-party archives.
+
+ Copyright [yyyy] [name of copyright owner]
+
+ 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.
diff --git a/src/capturekey/maincontroller.cpp b/src/capturekey/maincontroller.cpp
index d0e429a..809c170 100644
--- a/src/capturekey/maincontroller.cpp
+++ b/src/capturekey/maincontroller.cpp
@@ -9,6 +9,7 @@
#include
#include
#include "../settings/config.h"
+#include "../util/util.h"
MainController::MainController() {
@@ -61,8 +62,19 @@ void MainController::startCaptureKeyTextGeneric() {
}
QVector MainController::searchDict(QString searchStr) {
- QVector searchResult = dict->search(searchStr);
- searchResult = dict->sort(searchResult, searchStr);
+ QVector searchResult;
+ QString rootWord = Util::getRootWord(searchStr);
+
+ if ( (rootWord.isEmpty()) || (rootWord == searchStr) ) {
+ searchResult = dict->search(searchStr);
+ searchResult = dict->sort(searchResult, searchStr);
+ }
+ else {
+ searchResult = dict->searchWithRoot(searchStr, rootWord);
+ searchResult = dict->sortWithRoot(searchResult, searchStr, rootWord);
+ }
+
+
return searchResult;
}
@@ -76,7 +88,7 @@ void MainController::captureOCR() {
Pix *pix = Util::qPixMap2PIX(&screenshot);
QString text = ocr->recognize(pix);
- //Dumb word processing to only remove space get correct result, make proper processing function later
+ //Remove space get correct result
text = text.simplified();
text = text.replace(" ", "");
diff --git a/src/dict/dict.cpp b/src/dict/dict.cpp
index 60bf420..7b52890 100644
--- a/src/dict/dict.cpp
+++ b/src/dict/dict.cpp
@@ -55,7 +55,7 @@ Dict::Dict() {
void Dict::load() {
QString dictPath = QDir::currentPath();
//dictPath = dictPath + "/res/JMdict_e"; //Deployment
- dictPath = "C://Users//WanHuz//Documents//Shanachan//res//JMdict_e"; //Debug Mode
+ dictPath = "C://Users//WanHuz//Documents//Shanachan//res//dict//JMdict_e"; //Debug Mode
QFile dictFile(dictPath);
if (!dictFile.open(QIODevice::ReadOnly | QIODevice::Text))
{
@@ -163,6 +163,8 @@ QVector Dict::search(QString searchString) {
return searchResult;
}
+
+
/*Sort from highest word frequency to lowest word frequency. If there is an exact match to search string, place it at the highest frequency*/
QVector Dict::sort(QVector searchedWord, QString targetString) {
int size = searchedWord.size();
@@ -180,5 +182,32 @@ QVector Dict::sort(QVector searchedWord, QString targetString) {
return searchedWord;
}
+/*Search two different word from dictionary, one is presumely root word*/
+QVector Dict::searchWithRoot(QString fSearchStr, QString sSearchStr) {
+ QVector fSearchResult = search(fSearchStr);
+ QVector sSearchResult = search(sSearchStr);
+
+ for (int i = 0; i < sSearchResult.size(); i++) {
+ fSearchResult.append(sSearchResult.at(i));
+ }
+
+ return fSearchResult;
+}
+
+/*Search vector with from root word search*/
+QVector Dict::sortWithRoot(QVector searchedWord, QString targetString, QString rootString) {
+ int size = searchedWord.size();
+
+ for (int i = 0; i < size; i++) {
+ if ((searchedWord[i].getKanji() == rootString) || (searchedWord[i].getReading() == rootString)) {
+ searchedWord[i].setFreq(1);
+ }
+ }
+
+ QVector sortedList = sort(searchedWord, targetString);
+
+ return sortedList;
+}
+
diff --git a/src/dict/dict.h b/src/dict/dict.h
index 7f63c4a..11866d0 100644
--- a/src/dict/dict.h
+++ b/src/dict/dict.h
@@ -10,7 +10,9 @@ class Dict {
Dict();
void load();
QVector search(QString searchString);
+ QVector searchWithRoot(QString fSearchStr, QString sSearchStr);
QVector sort(QVector searchedWord, QString targetString);
+ QVector sortWithRoot(QVector searchedWord, QString targetString, QString rootString);
private:
void parse(QByteArray* line);
diff --git a/src/main.cpp b/src/main.cpp
index 9ca55c8..77811ee 100644
--- a/src/main.cpp
+++ b/src/main.cpp
@@ -1,7 +1,5 @@
#include
#include "ui/MainWindow.h"
-#include "ui/popup.h"
-
int main(int argc, char *argv[])
{
diff --git a/src/ui/MainWindow.cpp b/src/ui/MainWindow.cpp
index be9a71a..93c2f52 100644
--- a/src/ui/MainWindow.cpp
+++ b/src/ui/MainWindow.cpp
@@ -14,6 +14,7 @@
#include
#include
#include "../data/entry.h"
+#include "../util/util.h"
#include "../ui/popup.h"
@@ -40,7 +41,7 @@ MainWindow::MainWindow(QWidget* parent)
MainControl = new MainController();
QString fontPath = QDir::currentPath();
- fontPath = "C:\\Users\\WanHuz\\Documents\\Shanachan\\res\\NotoSansMonoCJKjp-Regular.otf"; //For debugging purpose
+ fontPath = "C:\\Users\\WanHuz\\Documents\\Shanachan\\res\\font\\NotoSansMonoCJKjp-Regular.otf"; //For debugging purpose
//fontPath = fontPath + "//res//NotoSansMonoCJKjp-Regular.otf";
int id = QFontDatabase::addApplicationFont(fontPath);
@@ -71,18 +72,18 @@ MainWindow::MainWindow(QWidget* parent)
table->horizontalHeader()->setSectionResizeMode(QHeaderView::Stretch);
table->verticalHeader()->setSectionResizeMode(QHeaderView::ResizeToContents);
- //Connect menu bar button
+ //Connect menu bar button, this is redundant, may change it later
connect(fsSmall, &QAction::triggered, this, [=]() {
- Config::getInstance().setFrameSize(15);
+ Config::getInstance().setFrameSize(10);
});
connect(fsNormal, &QAction::triggered, this, [=]() {
- Config::getInstance().setFrameSize(30);
+ Config::getInstance().setFrameSize(12);
});
connect(fsLarge, &QAction::triggered, this, [=]() {
- Config::getInstance().setFrameSize(45);
+ Config::getInstance().setFrameSize(24);
});
connect(fsvLarge, &QAction::triggered, this, [=]() {
- Config::getInstance().setFrameSize(60);
+ Config::getInstance().setFrameSize(48);
});
connect(frameVert, &QAction::triggered, this, [=]() {
Config::getInstance().setFrameOrientation(true);
@@ -109,6 +110,7 @@ MainWindow::MainWindow(QWidget* parent)
//Search from user-given string and display it either in normal mode or minimal mode, result are limited to 100 entry.
void MainWindow::search() {
dictmodel.clear();
+ QVector searchResult;
QString searchText = textbox->text();
if (searchText.isEmpty()) {
@@ -120,7 +122,8 @@ void MainWindow::search() {
return;
}
- QVector searchResult = MainControl->searchDict(searchText);
+ searchResult = MainControl->searchDict(searchText);
+
if (searchResult.size() < 1) {
//No result found
dictmodel.clear();
diff --git a/src/ui/MainWindow.ui b/src/ui/MainWindow.ui
index 908a194..1615e6a 100644
--- a/src/ui/MainWindow.ui
+++ b/src/ui/MainWindow.ui
@@ -35,7 +35,7 @@
-
+ 0
@@ -55,7 +55,7 @@
- Min
+ OCRtrue
@@ -63,20 +63,23 @@
-
-
- true
-
+
-
+ 00
- 0
- 10
+ 40
+ 40
+
+
+
+
+ 40
+ 40
@@ -85,46 +88,52 @@
0
-
-
- Noto Sans Mono CJK JP Regular
- 22
-
+
+ Text
-
+
+
+ true
+
-
+ 00
- 40
- 40
+ 0
+ 10
-
+
- 40
- 40
+ 0
+ 0
+
+
+ Noto Sans Mono CJK JP Regular
+ 22
+
+
- OCR
+
-
- true
+
+
-
+
-
+ 00
@@ -141,14 +150,11 @@
40
-
-
- 0
- 0
-
-
- Text
+ Min
+
+
+ true
@@ -181,6 +187,7 @@ selection-color: #000;
QScrollBar {
color: red;
+ background-color: red;
border-left: 0px;
}
@@ -211,6 +218,12 @@ QScrollBar {
QAbstractItemView::SelectRows
+
+ QAbstractItemView::ScrollPerPixel
+
+
+ QAbstractItemView::ScrollPerPixel
+ true
@@ -297,15 +310,23 @@ selection-color: #000;
Settings
+
+ false
+
- Vertical
+ Vertical ↔
- Horizontal
+ Horizontal ↕
+
+
+
+ 8
+
diff --git a/src/ui/frame.cpp b/src/ui/frame.cpp
index 07f2551..ef31b67 100644
--- a/src/ui/frame.cpp
+++ b/src/ui/frame.cpp
@@ -64,8 +64,9 @@ void Frame::setBoxSize() {
return;
}
- y = (fontsize + 20);
- x = y * 3;
+ //X and Y are the opposite! Mistakes were made
+ y = (fontsize + 15);
+ x = y * 4;
curCurPos = QCursor::pos();
curX = curCurPos.x() - (y / 2);
curY = curCurPos.y() - (y / 2);
diff --git a/src/ui/popup.cpp b/src/ui/popup.cpp
index bdaac3a..9377d26 100644
--- a/src/ui/popup.cpp
+++ b/src/ui/popup.cpp
@@ -107,7 +107,7 @@ void popup::setTheme() {
"QPushButton:hover {background-color: #3867db}");
QString fontPath = QDir::currentPath();
- fontPath = "C:\\Users\\WanHuz\\Documents\\Shanachan\\res\\NotoSansMonoCJKjp-Regular.otf"; //For debugging purpose
+ fontPath = "C:\\Users\\WanHuz\\Documents\\Shanachan\\res\\font\\NotoSansMonoCJKjp-Regular.otf"; //For debugging purpose
//fontPath = fontPath + "//res//NotoSansMonoCJKjp-Regular.otf";
int id = QFontDatabase::addApplicationFont(fontPath);
diff --git a/src/util/util.cpp b/src/util/util.cpp
index c7c9ee4..226294a 100644
--- a/src/util/util.cpp
+++ b/src/util/util.cpp
@@ -2,9 +2,21 @@
#include
#include
#include
+#include
+#include
+#include
+#include
+#include
+#pragma comment(lib, "libmecab.lib")
+#pragma QT_NO_CAST_FROM_ASCII
+#pragma QT_NO_CAST_TO_ASCII
+#pragma QT_NO_CAST_FROM_BYTEARRAY
-
-
+#define CHECK(eval) if (! eval) { \
+ const char *e = tagger ? tagger->what() : MeCab::getTaggerError(); \
+ std::cerr << "Exception:" << e << std::endl; \
+ delete tagger; \
+ return -1; }
/*QPixmap to Leptonica's Pix conversion*/
Pix* Util::qPixMap2PIX(QPixmap* pixmap) {
@@ -64,4 +76,35 @@ int Util::sendKeyInput() {
return 4;
}
return 0;
+}
+
+/*Extract and return root word from Japanese sentence. Only return first word in a given string*/
+QString Util::getRootWord(QString targetWord) {
+
+
+ //QString to const char conversion
+ QByteArray array = targetWord.toLocal8Bit();
+ const char* data = array.constData();
+
+ //Init MeCab
+ MeCab::Model* model = MeCab::createModel("");
+
+ MeCab::Tagger* tagger = model->createTagger();
+
+ CHECK(tagger);
+
+ const char* result = tagger->parse(data);
+ CHECK(result);
+
+ ////Get root word of first word in the sentence
+ QString qresult(result);
+ QStringList fresult = qresult.split("\t");
+
+ if (!(fresult.at(0).contains("EOS"))) {
+ fresult = fresult[1].split(",");
+ return fresult[6];
+ }
+
+ return "";
+
}
\ No newline at end of file
diff --git a/src/util/util.h b/src/util/util.h
index b4dc61a..f85ea26 100644
--- a/src/util/util.h
+++ b/src/util/util.h
@@ -7,5 +7,5 @@ class Util
public:
static Pix* qPixMap2PIX(QPixmap* pixmap);
static int sendKeyInput();
-
+ static QString getRootWord(QString targetWord);
};
\ No newline at end of file
diff --git a/vs2019/Debug/KanjiProgram.log b/vs2019/Debug/KanjiProgram.log
new file mode 100644
index 0000000..8a89d2a
--- /dev/null
+++ b/vs2019/Debug/KanjiProgram.log
@@ -0,0 +1 @@
+C:\Users\WanHuz\AppData\Local\QtMsBuild\qt_vars.targets(68,5): error : There's no Qt version assigned to project KanjiProgram.vcxproj for configuration Debug/Win32. Please assign a Qt installation in 'Qt Project Settings'.
diff --git a/vs2019/Debug/Shanachan.tlog/Shanachan.lastbuildstate b/vs2019/Debug/Shanachan.tlog/Shanachan.lastbuildstate
new file mode 100644
index 0000000..8a026b8
--- /dev/null
+++ b/vs2019/Debug/Shanachan.tlog/Shanachan.lastbuildstate
@@ -0,0 +1,2 @@
+PlatformToolSet=v142:VCToolArchitecture=Native32Bit:VCToolsVersion=14.28.29333:TargetPlatformVersion=10.0.18362.0:VcpkgTriplet=x86-windows:
+Debug|Win32|C:\Users\WanHuz\Documents\Shanachan\vs2019\|
diff --git a/vs2019/Debug/Shanachan.tlog/unsuccessfulbuild b/vs2019/Debug/Shanachan.tlog/unsuccessfulbuild
new file mode 100644
index 0000000..e69de29
diff --git a/vs2019/KanjiProgram.sln b/vs2019/KanjiProgram.sln
index 90928ab..636302d 100644
--- a/vs2019/KanjiProgram.sln
+++ b/vs2019/KanjiProgram.sln
@@ -7,14 +7,35 @@ Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Shanachan", "KanjiProgram.v
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution
+ Debug|Win32 = Debug|Win32
Debug|x64 = Debug|x64
+ Debug|x86 = Debug|x86
+ Release|Win32 = Release|Win32
Release|x64 = Release|x64
+ Release|x86 = Release|x86
+ x86|Win32 = x86|Win32
+ x86|x64 = x86|x64
+ x86|x86 = x86|x86
EndGlobalSection
GlobalSection(ProjectConfigurationPlatforms) = postSolution
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Debug|Win32.ActiveCfg = Debug|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Debug|Win32.Build.0 = Debug|Win32
{98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Debug|x64.ActiveCfg = Debug|x64
{98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Debug|x64.Build.0 = Debug|x64
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Debug|x86.ActiveCfg = Debug|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Debug|x86.Build.0 = Debug|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Release|Win32.ActiveCfg = Release|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Release|Win32.Build.0 = Release|Win32
{98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Release|x64.ActiveCfg = Release|x64
{98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Release|x64.Build.0 = Release|x64
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Release|x86.ActiveCfg = Release|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.Release|x86.Build.0 = Release|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.x86|Win32.ActiveCfg = x86|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.x86|Win32.Build.0 = x86|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.x86|x64.ActiveCfg = x86|x64
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.x86|x64.Build.0 = x86|x64
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.x86|x86.ActiveCfg = x86|Win32
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}.x86|x86.Build.0 = x86|Win32
EndGlobalSection
GlobalSection(SolutionProperties) = preSolution
HideSolutionNode = FALSE
diff --git a/vs2019/KanjiProgram.vcxproj b/vs2019/KanjiProgram.vcxproj
index 3d56357..9fcd0e2 100644
--- a/vs2019/KanjiProgram.vcxproj
+++ b/vs2019/KanjiProgram.vcxproj
@@ -1,20 +1,37 @@
+
+ Debug
+ Win32
+ Debugx64
+
+ Release
+ Win32
+ Releasex64
+
+ x86
+ Win32
+
+
+ x86
+ x64
+ {98E91A1F-1480-4BA6-A2C0-E19DADAD2756}QtVS_v30410.0.18362.010.0.18362.0
+ 10.0.18362.0$(MSBuildProjectDirectory)\QtMsBuildShanachan
@@ -27,6 +44,19 @@
Applicationv142
+
+ Application
+ v142
+
+
+ v142
+
+
+ v142
+
+
+ v142
+
@@ -39,6 +69,9 @@
+
+
+
@@ -51,8 +84,26 @@
C:\Program Files %28x86%29\MeCab\sdk;$(LibraryPath)
+ $(ExecutablePath)
+ C:\Program Files %28x86%29\MeCab\sdk;$(IncludePath)
+ C:\Program Files %28x86%29\MeCab\sdk;$(LibraryPath)
+
+
+ true
+ C:\Users\WanHuz\Documents\Shanachan\lib\mecab\include;%(AdditionalIncludeDirectories)
+
+
+
+ mecab-config --libs
+
+
+ C:\Users\WanHuz\Documents\Shanachan\lib\mecab\lib;%(AdditionalLibraryDirectories)
+ $(Qt_LIBS_);%(AdditionalDependencies);C:\Users\WanHuz\Documents\Shanachan\lib\mecab\lib\libmecab.lib
+
+
+ true
@@ -70,6 +121,16 @@
%(AdditionalLibraryDirectories)%(AdditionalDependencies)
+
+ /utf-8 %(AdditionalOptions)
+
+
+ ./configure --with-charset=utf8 --enable-utf8-only %(AdditionalOptions)
+
+
+
+
+ 5.15.1_msvc2019_64
@@ -82,6 +143,12 @@
5.15.1_msvc2019_64false
+
+ core;gui;widgets
+ release
+ 5.15.1_msvc2019_64
+ false
+
@@ -113,6 +180,20 @@
false
+
+
+ true
+ true
+ None
+ MaxSpeed
+ MultiThreadedDLL
+ true
+
+
+ Windows
+ false
+
+
diff --git a/vs2019/KanjiProgram.vcxproj.user b/vs2019/KanjiProgram.vcxproj.user
index ecd7621..4c80275 100644
--- a/vs2019/KanjiProgram.vcxproj.user
+++ b/vs2019/KanjiProgram.vcxproj.user
@@ -6,5 +6,7 @@ PATH=%PATH%;$(QtDllPath);C:\Users\WanHuz\AppData\Local\Programs\Python\Python37
PYTHONPATH="C:\Users\WanHuz\AppData\Local\Programs\Python\Python37\DLLs;C:\Users\WanHuz\AppData\Local\Programs\Python\Python37\Lib"
PYTHONHOME=C:\Users\WanHuz\AppData\Local\Programs\Python\Python37
WindowsLocalDebugger
+ $(TargetPath)
+ $(QmlDebug)
\ No newline at end of file