diff --git a/dkpro-core-berkeleyparser-gpl/.license-header.txt b/dkpro-core-berkeleyparser-gpl/.license-header.txt deleted file mode 100644 index bbaf6e0e56..0000000000 --- a/dkpro-core-berkeleyparser-gpl/.license-header.txt +++ /dev/null @@ -1,16 +0,0 @@ -Copyright ${inceptionYear}-${currentYear} -Ubiquitous Knowledge Processing (UKP) Lab -Technische Universität Darmstadt - -This program is free software: you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation, either version 3 of the License, or -(at your option) any later version. - -This program is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. - -You should have received a copy of the GNU General Public License -along with this program. If not, see http://www.gnu.org/licenses/. diff --git a/dkpro-core-berkeleyparser-gpl/LICENSE.txt b/dkpro-core-berkeleyparser-gpl/LICENSE.txt deleted file mode 100644 index 99ace43661..0000000000 --- a/dkpro-core-berkeleyparser-gpl/LICENSE.txt +++ /dev/null @@ -1,888 +0,0 @@ -The code in this repository is licensed under the Apache License 2.0. Some parts may depend on -libraries licensed under the GPL. These parts should be considered under GPL for the -purpose of use. For the purpose of refactoring, the respective code may be used under the ASL -2.0 as long as all references to the GPLed libraries are removed. Mind license headers in -individual files and information in the NOTICE.txt file, as sometimes we had to copy specific -files under other licenses into our codebase! - ----- - - 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 http://www.gnu.org/licenses/. - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - 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 -. - ----- - - 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/dkpro-core-berkeleyparser-gpl/pom.xml b/dkpro-core-berkeleyparser-gpl/pom.xml deleted file mode 100644 index a82fdee941..0000000000 --- a/dkpro-core-berkeleyparser-gpl/pom.xml +++ /dev/null @@ -1,201 +0,0 @@ - - - 4.0.0 - - - org.dkpro.core - dkpro-core-gpl - 3.0.0-SNAPSHOT - ../dkpro-core-gpl - - - dkpro-core-berkeleyparser-gpl - jar - DKPro Core GPL - Berkeley Parser - https://dkpro.github.io/dkpro-core/ - - - - org.apache.uima - uimaj-core - - - org.apache.uima - uimafit-core - - - org.apache.commons - commons-lang3 - - - edu.berkeley.nlp - berkeleyparser - r32 - - - org.dkpro.core - dkpro-core-api-metadata-asl - ${project.version} - - - org.dkpro.core - dkpro-core-api-resources-asl - ${project.version} - - - org.dkpro.core - dkpro-core-api-lexmorph-asl - ${project.version} - - - org.dkpro.core - dkpro-core-api-syntax-asl - ${project.version} - - - org.dkpro.core - dkpro-core-api-segmentation-asl - ${project.version} - - - org.dkpro.core - dkpro-core-api-parameter-asl - ${project.version} - - - eu.openminted.share.annotations - omtd-share-annotations-api - - - org.dkpro.core - dkpro-core-testing-asl - ${project.version} - test - - - org.dkpro.core - dkpro-core-opennlp-asl - ${project.version} - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-ar-sm5 - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-bg-sm5 - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-de-sm5 - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-en-sm6 - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-fr-sm5 - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-zh-sm5 - test - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.opennlp-model-tagger-en-maxent - test - - - - - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-ar-sm5 - 20090917.1 - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-bg-sm5 - 20090917.1 - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-de-sm5 - 20090917.1 - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-en-sm6 - 20100819.1 - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-fr-sm5 - 20090917.1 - - - de.tudarmstadt.ukp.dkpro.core - de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-zh-sm5 - 20090917.1 - - - org.dkpro.core - dkpro-core-opennlp-asl - ${project.version} - pom - import - - - - - - - - - org.apache.maven.plugins - maven-dependency-plugin - - - - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-ar-sm5 - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-bg-sm5 - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-de-sm5 - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-en-sm6 - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-fr-sm5 - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.berkeleyparser-model-parser-zh-sm5 - de.tudarmstadt.ukp.dkpro.core:de.tudarmstadt.ukp.dkpro.core.opennlp-model-tagger-en-maxent - - - - - - - \ No newline at end of file diff --git a/dkpro-core-berkeleyparser-gpl/src/main/java/org/dkpro/core/berkeleyparser/BerkeleyParser.java b/dkpro-core-berkeleyparser-gpl/src/main/java/org/dkpro/core/berkeleyparser/BerkeleyParser.java deleted file mode 100644 index 4dc844b0e6..0000000000 --- a/dkpro-core-berkeleyparser-gpl/src/main/java/org/dkpro/core/berkeleyparser/BerkeleyParser.java +++ /dev/null @@ -1,442 +0,0 @@ -/* - * Copyright 2007-2024 - * Ubiquitous Knowledge Processing (UKP) Lab - * Technische Universität Darmstadt - * - * This program is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with this program. If not, see http://www.gnu.org/licenses/. - */ -package org.dkpro.core.berkeleyparser; - -import static org.apache.uima.fit.util.JCasUtil.select; -import static org.apache.uima.fit.util.JCasUtil.selectCovered; -import static org.apache.uima.util.Level.INFO; -import static org.dkpro.core.api.parameter.ComponentParameters.DEFAULT_MAPPING_ENABLED; -import static org.dkpro.core.api.resources.MappingProviderFactory.createConstituentMappingProvider; -import static org.dkpro.core.api.resources.MappingProviderFactory.createPosMappingProvider; - -import java.io.IOException; -import java.io.ObjectInputStream; -import java.net.URL; -import java.util.ArrayList; -import java.util.List; -import java.util.Properties; -import java.util.stream.Collectors; -import java.util.zip.GZIPInputStream; - -import org.apache.commons.lang3.mutable.MutableInt; -import org.apache.uima.UimaContext; -import org.apache.uima.analysis_engine.AnalysisEngineProcessException; -import org.apache.uima.cas.CAS; -import org.apache.uima.cas.Type; -import org.apache.uima.fit.component.JCasAnnotator_ImplBase; -import org.apache.uima.fit.descriptor.ConfigurationParameter; -import org.apache.uima.fit.descriptor.OperationalProperties; -import org.apache.uima.fit.descriptor.ResourceMetaData; -import org.apache.uima.fit.descriptor.TypeCapability; -import org.apache.uima.fit.util.FSCollectionFactory; -import org.apache.uima.jcas.JCas; -import org.apache.uima.jcas.cas.FSArray; -import org.apache.uima.jcas.tcas.Annotation; -import org.apache.uima.resource.ResourceInitializationException; -import org.dkpro.core.api.lexmorph.pos.POSUtils; -import org.dkpro.core.api.metadata.SingletonTagset; -import org.dkpro.core.api.parameter.ComponentParameters; -import org.dkpro.core.api.resources.CasConfigurableProviderBase; -import org.dkpro.core.api.resources.MappingProvider; -import org.dkpro.core.api.resources.ModelProviderBase; - -import de.tudarmstadt.ukp.dkpro.core.api.lexmorph.type.pos.POS; -import de.tudarmstadt.ukp.dkpro.core.api.segmentation.type.Sentence; -import de.tudarmstadt.ukp.dkpro.core.api.segmentation.type.Token; -import de.tudarmstadt.ukp.dkpro.core.api.syntax.type.PennTree; -import de.tudarmstadt.ukp.dkpro.core.api.syntax.type.constituent.Constituent; -import edu.berkeley.nlp.PCFGLA.CoarseToFineMaxRuleParser; -import edu.berkeley.nlp.PCFGLA.Grammar; -import edu.berkeley.nlp.PCFGLA.Lexicon; -import edu.berkeley.nlp.PCFGLA.ParserData; -import edu.berkeley.nlp.PCFGLA.TreeAnnotations; -import edu.berkeley.nlp.syntax.Tree; -import edu.berkeley.nlp.util.Numberer; -import eu.openminted.share.annotations.api.Component; -import eu.openminted.share.annotations.api.DocumentationResource; -import eu.openminted.share.annotations.api.constants.OperationType; - -/** - * Berkeley Parser annotator. Requires {@link Sentence}s to be annotated before. - * - * @see CoarseToFineMaxRuleParser - */ -@Component(OperationType.CONSTITUENCY_PARSER) -@ResourceMetaData(name = "Berkeley Parser") -@DocumentationResource("${docbase}/component-reference.html#engine-${shortClassName}") -@OperationalProperties(multipleDeploymentAllowed = false) -@TypeCapability(inputs = { "de.tudarmstadt.ukp.dkpro.core.api.segmentation.type.Token", - "de.tudarmstadt.ukp.dkpro.core.api.segmentation.type.Sentence" }, outputs = { - "de.tudarmstadt.ukp.dkpro.core.api.syntax.type.constituent.Constituent", - "de.tudarmstadt.ukp.dkpro.core.api.syntax.type.PennTree" }) -public class BerkeleyParser - extends JCasAnnotator_ImplBase -{ - /** - * Use this language instead of the language set in the CAS to locate the model. - */ - public static final String PARAM_LANGUAGE = ComponentParameters.PARAM_LANGUAGE; - @ConfigurationParameter(name = PARAM_LANGUAGE, mandatory = false) - protected String language; - - /** - * Override the default variant used to locate the model. - */ - public static final String PARAM_VARIANT = ComponentParameters.PARAM_VARIANT; - @ConfigurationParameter(name = PARAM_VARIANT, mandatory = false) - protected String variant; - - /** - * URI of the model artifact. This can be used to override the default model resolving mechanism - * and directly address a particular model. - * - *

- * The URI format is {@code mvn:${groupId}:${artifactId}:${version}}. Remember to set the - * variant parameter to match the artifact. If the artifact contains the model in a non-default - * location, you also have to specify the model location parameter, e.g. - * {@code classpath:/model/path/in/artifact/model.bin}. - *

- */ - public static final String PARAM_MODEL_ARTIFACT_URI = ComponentParameters.PARAM_MODEL_ARTIFACT_URI; - @ConfigurationParameter(name = PARAM_MODEL_ARTIFACT_URI, mandatory = false) - protected String modelArtifactUri; - - /** - * Load the model from this location instead of locating the model automatically. - */ - public static final String PARAM_MODEL_LOCATION = ComponentParameters.PARAM_MODEL_LOCATION; - @ConfigurationParameter(name = PARAM_MODEL_LOCATION, mandatory = false) - protected String modelLocation; - - /** - * Enable/disable type mapping. - */ - public static final String PARAM_MAPPING_ENABLED = ComponentParameters.PARAM_MAPPING_ENABLED; - @ConfigurationParameter(name = PARAM_MAPPING_ENABLED, defaultValue = DEFAULT_MAPPING_ENABLED) - protected boolean mappingEnabled; - - /** - * Location of the mapping file for part-of-speech tags to UIMA types. - */ - public static final String PARAM_POS_MAPPING_LOCATION = ComponentParameters.PARAM_POS_MAPPING_LOCATION; - @ConfigurationParameter(name = PARAM_POS_MAPPING_LOCATION, mandatory = false) - protected String posMappingLocation; - - /** - * Location of the mapping file for constituent tags to UIMA types. - */ - public static final String PARAM_CONSTITUENT_MAPPING_LOCATION = // - ComponentParameters.PARAM_CONSTITUENT_MAPPING_LOCATION; - @ConfigurationParameter(name = PARAM_CONSTITUENT_MAPPING_LOCATION, mandatory = false) - protected String constituentMappingLocation; - - /** - * Log the tag set(s) when a model is loaded. - */ - public static final String PARAM_PRINT_TAGSET = ComponentParameters.PARAM_PRINT_TAGSET; - @ConfigurationParameter(name = PARAM_PRINT_TAGSET, mandatory = true, defaultValue = "false") - protected boolean printTagSet; - - /** - * Sets whether to use or not to use already existing POS tags from another annotator for the - * parsing process. - */ - public static final String PARAM_READ_POS = ComponentParameters.PARAM_READ_POS; - @ConfigurationParameter(name = PARAM_READ_POS, mandatory = true, defaultValue = "true") - private boolean readPos; - - /** - * Sets whether to create or not to create POS tags. The creation of constituent tags must be - * turned on for this to work. - */ - public static final String PARAM_WRITE_POS = ComponentParameters.PARAM_WRITE_POS; - @ConfigurationParameter(name = PARAM_WRITE_POS, mandatory = true, defaultValue = "false") - private boolean writePos; - - /** - * If this parameter is set to true, each sentence is annotated with a PennTree-Annotation, - * containing the whole parse tree in Penn Treebank style format. - */ - public static final String PARAM_WRITE_PENN_TREE = ComponentParameters.PARAM_WRITE_PENN_TREE; - @ConfigurationParameter(name = PARAM_WRITE_PENN_TREE, mandatory = true, defaultValue = "false") - private boolean writePennTree; - - /** - * Compute Viterbi derivation instead of max-rule tree. - */ - public static final String PARAM_VITERBI = "viterbi"; - @ConfigurationParameter(name = PARAM_VITERBI, mandatory = true, defaultValue = "false") - private boolean viterbi; - - /** - * Output sub-categories (only for binarized Viterbi trees). - */ - public static final String PARAM_SUBSTATES = "substates"; - @ConfigurationParameter(name = PARAM_SUBSTATES, mandatory = true, defaultValue = "false") - private boolean substates; - - /** - * Output inside scores (only for binarized viterbi trees). - */ - public static final String PARAM_SCORES = "scores"; - @ConfigurationParameter(name = PARAM_SCORES, mandatory = true, defaultValue = "false") - private boolean scores; - - /** - * Set thresholds for accuracy instead of efficiency. - */ - public static final String PARAM_ACCURATE = "accurate"; - @ConfigurationParameter(name = PARAM_ACCURATE, mandatory = true, defaultValue = "false") - private boolean accurate; - - /** - * Use variational rule score approximation instead of max-rule - */ - public static final String PARAM_VARIATIONAL = "variational"; - @ConfigurationParameter(name = PARAM_VARIATIONAL, mandatory = true, defaultValue = "false") - private boolean variational; - - /** - * Retain predicted function labels. Model must have been trained with function labels. - */ - public static final String PARAM_KEEP_FUNCTION_LABELS = "keepFunctionLabels"; - @ConfigurationParameter(name = PARAM_KEEP_FUNCTION_LABELS, mandatory = true, defaultValue = "false") - private boolean keepFunctionLabels; - - /** - * Output binarized trees. - */ - public static final String PARAM_BINARIZE = "binarize"; - @ConfigurationParameter(name = PARAM_BINARIZE, mandatory = true, defaultValue = "false") - private boolean binarize; - - private CasConfigurableProviderBase modelProvider; - private MappingProvider posMappingProvider; - private MappingProvider constituentMappingProvider; - - @Override - public void initialize(UimaContext aContext) throws ResourceInitializationException - { - super.initialize(aContext); - - modelProvider = new BerkeleyParserModelProvider(); - - if (writePos) { - posMappingProvider = createPosMappingProvider(this, posMappingLocation, language, - modelProvider); - } - - constituentMappingProvider = createConstituentMappingProvider(this, - constituentMappingLocation, language, modelProvider); - } - - @Override - public void process(JCas aJCas) throws AnalysisEngineProcessException - { - CAS cas = aJCas.getCas(); - - modelProvider.configure(cas); - if (writePos) { - posMappingProvider.configure(cas); - } - constituentMappingProvider.configure(cas); - - for (Sentence sentence : select(aJCas, Sentence.class)) { - List tokens = selectCovered(aJCas, Token.class, sentence); - List tokenText = tokens.stream().map(t -> t.getText()) - .collect(Collectors.toList()); - - List posTags = null; - if (readPos) { - posTags = new ArrayList(tokens.size()); - for (Token t : tokens) { - posTags.add(t.getPos().getPosValue()); - } - } - - Tree parseOutput = modelProvider.getResource() - .getBestConstrainedParse(tokenText, posTags, false); - - // Check if the sentence could be parsed or not - if (parseOutput.getChildren().isEmpty()) { - getLogger().warn("Unable to parse sentence: [" + sentence.getCoveredText() + "]"); - continue; - } - - if (!binarize) { - parseOutput = TreeAnnotations.unAnnotateTree(parseOutput, keepFunctionLabels); - } - - createConstituentAnnotationFromTree(aJCas, parseOutput, null, tokens, - new MutableInt(0)); - - if (writePennTree) { - PennTree pTree = new PennTree(aJCas, sentence.getBegin(), sentence.getEnd()); - pTree.setPennTree(parseOutput.toString()); - pTree.addToIndexes(); - } - } - } - - /** - * Creates linked constituent annotations + POS annotations - * - * @param aNode - * the source tree - * @return the child-structure (needed for recursive call only) - */ - private Annotation createConstituentAnnotationFromTree(JCas aJCas, Tree aNode, - Annotation aParentFS, List aTokens, MutableInt aIndex) - { - // If the node is a word-level constituent node (== POS): - // create parent link on token and (if not turned off) create POS tag - if (aNode.isPreTerminal()) { - Token token = aTokens.get(aIndex.intValue()); - - // link token to its parent constituent - if (aParentFS != null) { - token.setParent(aParentFS); - } - - // only add POS to index if we want POS-tagging - if (writePos) { - String typeName = aNode.getLabel(); - Type posTag = posMappingProvider.getTagType(typeName); - POS posAnno = (POS) aJCas.getCas().createAnnotation(posTag, token.getBegin(), - token.getEnd()); - posAnno.setPosValue(typeName != null ? typeName.intern() : null); - POSUtils.assignCoarseValue(posAnno); - posAnno.addToIndexes(); - token.setPos(posAnno); - } - - aIndex.add(1); - - return token; - } - // Check if node is a constituent node on sentence or phrase-level - else { - String typeName = aNode.getLabel(); - - // create the necessary objects and methods - Type constType = constituentMappingProvider.getTagType(typeName); - - Constituent constAnno = (Constituent) aJCas.getCas().createAnnotation(constType, 0, 0); - constAnno.setConstituentType(typeName); - - // link to parent - if (aParentFS != null) { - constAnno.setParent(aParentFS); - } - - // Do we have any children? - List childAnnotations = new ArrayList(); - for (Tree child : aNode.getChildren()) { - Annotation childAnnotation = createConstituentAnnotationFromTree(aJCas, child, - constAnno, aTokens, aIndex); - if (childAnnotation != null) { - childAnnotations.add(childAnnotation); - } - } - - constAnno.setBegin(childAnnotations.get(0).getBegin()); - constAnno.setEnd(childAnnotations.get(childAnnotations.size() - 1).getEnd()); - - // Now that we know how many children we have, link annotation of - // current node with its children - FSArray childArray = FSCollectionFactory.createFSArray(aJCas, childAnnotations); - constAnno.setChildren(childArray); - - // write annotation for current node to index - aJCas.addFsToIndexes(constAnno); - - return constAnno; - } - } - - private class BerkeleyParserModelProvider - extends ModelProviderBase - { - { - setContextObject(BerkeleyParser.this); - - setDefault(GROUP_ID, "de.tudarmstadt.ukp.dkpro.core"); - setDefault(ARTIFACT_ID, - "${groupId}.berkeleyparser-model-parser-${language}-${variant}"); - setDefault(LOCATION, - "classpath:/de/tudarmstadt/ukp/dkpro/core/berkeleyparser/lib/parser-${language}-${variant}.bin"); - setDefaultVariantsLocation("${package}/lib/parser-default-variants.map"); - - setOverride(LOCATION, modelLocation); - setOverride(LANGUAGE, language); - setOverride(VARIANT, variant); - } - - @Override - protected CoarseToFineMaxRuleParser produceResource(URL aUrl) throws IOException - { - try (ObjectInputStream is = new ObjectInputStream( - new GZIPInputStream(aUrl.openStream()))) { - ParserData pData = (ParserData) is.readObject(); - - Grammar grammar = pData.getGrammar(); - Lexicon lexicon = pData.getLexicon(); - Numberer.setNumberers(pData.getNumbs()); - - double threshold = 1.0; - - Properties metadata = getResourceMetaData(); - SingletonTagset posTags = new SingletonTagset(POS.class, - metadata.getProperty("pos.tagset")); - SingletonTagset constTags = new SingletonTagset(Constituent.class, - metadata.getProperty("constituent.tagset")); - - Numberer tagNumberer = (Numberer) pData.getNumbs().get("tags"); - for (int i = 0; i < tagNumberer.size(); i++) { - String tag = (String) tagNumberer.object(i); - if (!binarize && tag.startsWith("@")) { - continue; // Only show aux. binarization tags if it is enabled. - } - if (tag.endsWith("^g")) { - constTags.add(tag.substring(0, tag.length() - 2)); - } - else if ("ROOT".equals(tag)) { - constTags.add(tag); - } - else { - posTags.add(tag); - } - } - - addTagset(posTags, writePos); - addTagset(constTags); - - if (printTagSet) { - getContext().getLogger().log(INFO, getTagset().toString()); - } - - return new CoarseToFineMaxRuleParser(grammar, lexicon, threshold, -1, viterbi, - substates, scores, accurate, variational, true, true); - } - catch (ClassNotFoundException e) { - throw new IOException(e); - } - } - }; -} diff --git a/dkpro-core-berkeleyparser-gpl/src/main/java/org/dkpro/core/berkeleyparser/package-info.java b/dkpro-core-berkeleyparser-gpl/src/main/java/org/dkpro/core/berkeleyparser/package-info.java deleted file mode 100644 index c6de85fcdb..0000000000 --- a/dkpro-core-berkeleyparser-gpl/src/main/java/org/dkpro/core/berkeleyparser/package-info.java +++ /dev/null @@ -1,24 +0,0 @@ -/* - * Copyright 2007-2024 - * Ubiquitous Knowledge Processing (UKP) Lab - * Technische Universität Darmstadt - * - * This program is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with this program. If not, see http://www.gnu.org/licenses/. - */ -/** - * Integration of the Berkeley Parser. - * - * @since 1.5.0 - */ -package org.dkpro.core.berkeleyparser; diff --git a/dkpro-core-berkeleyparser-gpl/src/main/resources/org/dkpro/core/berkeleyparser/lib/parser-default-variants.map b/dkpro-core-berkeleyparser-gpl/src/main/resources/org/dkpro/core/berkeleyparser/lib/parser-default-variants.map deleted file mode 100644 index cec5d34ba1..0000000000 --- a/dkpro-core-berkeleyparser-gpl/src/main/resources/org/dkpro/core/berkeleyparser/lib/parser-default-variants.map +++ /dev/null @@ -1,6 +0,0 @@ -ar=sm5 -bg=sm5 -de=sm5 -en=sm6 -fr=sm5 -zh=sm5 \ No newline at end of file diff --git a/dkpro-core-berkeleyparser-gpl/src/scripts/build.xml b/dkpro-core-berkeleyparser-gpl/src/scripts/build.xml deleted file mode 100644 index 3e84cfb6a3..0000000000 --- a/dkpro-core-berkeleyparser-gpl/src/scripts/build.xml +++ /dev/null @@ -1,211 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ No newline at end of file diff --git a/dkpro-core-berkeleyparser-gpl/src/test/java/org/dkpro/core/berkeleyparser/BerkeleyParserTest.java b/dkpro-core-berkeleyparser-gpl/src/test/java/org/dkpro/core/berkeleyparser/BerkeleyParserTest.java deleted file mode 100644 index 5171a35fec..0000000000 --- a/dkpro-core-berkeleyparser-gpl/src/test/java/org/dkpro/core/berkeleyparser/BerkeleyParserTest.java +++ /dev/null @@ -1,455 +0,0 @@ -/* - * Copyright 2007-2024 - * Ubiquitous Knowledge Processing (UKP) Lab - * Technische Universität Darmstadt - * - * This program is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with this program. If not, see http://www.gnu.org/licenses/. - */ -package org.dkpro.core.berkeleyparser; - -import static org.apache.uima.fit.factory.AnalysisEngineFactory.createEngineDescription; -import static org.apache.uima.fit.util.JCasUtil.select; -import static org.apache.uima.fit.util.JCasUtil.selectSingle; -import static org.dkpro.core.testing.AssertAnnotations.assertConstituents; -import static org.dkpro.core.testing.AssertAnnotations.assertPOS; -import static org.dkpro.core.testing.AssertAnnotations.assertPennTree; -import static org.dkpro.core.testing.AssertAnnotations.assertTagset; -import static org.dkpro.core.testing.AssertAnnotations.assertTagsetMapping; - -import java.util.ArrayList; -import java.util.List; - -import org.apache.commons.lang3.ArrayUtils; -import org.apache.uima.fit.factory.AggregateBuilder; -import org.apache.uima.jcas.JCas; -import org.dkpro.core.opennlp.OpenNlpPosTagger; -import org.dkpro.core.testing.AssertAnnotations; -import org.dkpro.core.testing.TestRunner; -import org.junit.jupiter.api.Test; - -import de.tudarmstadt.ukp.dkpro.core.api.lexmorph.type.pos.POS; -import de.tudarmstadt.ukp.dkpro.core.api.syntax.type.PennTree; -import de.tudarmstadt.ukp.dkpro.core.api.syntax.type.constituent.Constituent; -import de.tudarmstadt.ukp.dkpro.core.api.syntax.type.dependency.Dependency; - -public class BerkeleyParserTest -{ - static final String documentEnglish = "We need a very complicated example sentence , which " + - "contains as many constituents and dependencies as possible ."; - - @Test - public void testArabic() - throws Exception - { - JCas jcas = runTest("ar", - "نحتاج مثالا معقدا جدا ل جملة تحتوي على أكبر قدر ممكن من العناصر و الروابط ."); - - String[] constituentMapped = { "ROOT 0,75", "X 0,75" }; - - String[] constituentOriginal = { "ROOT 0,75", "X 0,75" }; - - String[] dependencies = {}; - - String pennTree = "(ROOT (ROOT (X (PUNC نحتاج) (PUNC مثالا) (NN معقدا) (NN جدا) (NN ل) (NN جملة) " - + "(NN تحتوي) (NN على) (NN أكبر) (NN قدر) (NN ممكن) (NN من) (NN العناصر) (NN و) (NN الروابط) " - + "(PUNC .))))"; - - String[] posMapped = { "POS_PUNCT", "POS_PUNCT", "POS_NOUN", "POS_NOUN", "POS_NOUN", - "POS_NOUN", "POS_NOUN", "POS_NOUN", "POS_NOUN", "POS_NOUN", "POS_NOUN", "POS_NOUN", - "POS_NOUN", "POS_NOUN", "POS_NOUN", "POS_PUNCT" }; - - String[] posOriginal = { "PUNC", "PUNC", "NN", "NN", "NN", "NN", "NN", "NN", "NN", "NN", - "NN", "NN", "NN", "NN", "NN", "PUNC" }; - - String[] posTags = { "CC", "CD", "DEM", "DT", "IN", "JJ", "NN", "NNP", "NNPS", "NNS", - "NOFUNC", "NUMCOMMA", "PRP", "PRP$", "PUNC", "RB", "RP", "UH", "VB", "VBD", "VBN", - "VBP", "VERB", "WP", "WRB" }; - - String[] constituentTags = { "ADJP", "ADVP", "CONJP", "FRAG", "INTJ", "LST", "NAC", "NP", - "NX", "PP", "PRN", "PRT", "QP", "ROOT", "S", "SBAR", "SBARQ", "SINV", "SQ", "UCP", - "VP", "WHADJP", "WHADVP", "WHNP", "WHPP", "X" }; - - String[] unmappedPos = { "DEM", "NOFUNC", "NUMCOMMA", "PRP$", "VERB" }; - - String[] unmappedConst = { "LST", "SINV" }; - - AssertAnnotations.assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - AssertAnnotations.assertPennTree(pennTree, selectSingle(jcas, PennTree.class)); - AssertAnnotations.assertConstituents(constituentMapped, constituentOriginal, - select(jcas, Constituent.class)); - AssertAnnotations.assertDependencies(dependencies, select(jcas, Dependency.class)); - AssertAnnotations.assertTagset(POS.class, "atb", posTags, jcas); - AssertAnnotations.assertTagsetMapping(POS.class, "atb", unmappedPos, jcas); - AssertAnnotations.assertTagset(Constituent.class, "atb", constituentTags, jcas); - AssertAnnotations.assertTagsetMapping(Constituent.class, "atb", unmappedConst, jcas); - } - - @Test - public void testBulgarian() - throws Exception - { - JCas jcas = runTest("bg", "Имаме нужда от един много сложен пример изречение , " + - "което съдържа най-много съставки и зависимости, колкото е възможно ."); - - String[] constituentMapped = { "ROOT 0,120", "X 0,118", "X 0,120", "X 0,5", "X 100,107", - "X 100,118", "X 108,109", "X 108,118", "X 110,118", "X 12,118", "X 12,14", - "X 15,118", "X 15,19", "X 15,39", "X 20,25", "X 20,32", "X 20,39", "X 26,32", - "X 33,39", "X 40,118", "X 40,49", "X 40,84", "X 50,84", "X 52,57", "X 52,84", - "X 58,65", "X 58,84", "X 6,11", "X 6,118", "X 66,75", "X 66,84", "X 76,84", - "X 85,86", "X 87,118", "X 87,99" }; - - String[] constituentOriginal = { "A 26,32", "APA 20,32", "Adv 100,107", "Adv 110,118", - "Adv 20,25", "Adv 66,75", "Adv 87,99", "AdvPA 87,118", "C 85,86", "CL 100,118", - "CLR 50,84", "Conj 85,86", "ConjArg 40,84", "ConjArg 87,118", "CoordP 40,118", - "M 15,19", "N 33,39", "N 40,49", "N 6,11", "N 76,84", "NPA 15,118", "NPA 15,39", - "NPA 20,39", "NPA 40,84", "NPA 6,118", "NPA 66,84", "PP 12,118", "Prep 12,14", - "Pron 52,57", "ROOT 0,120", "S 0,120", "V 0,5", "V 108,109", "V 58,65", - "VPA 100,118", "VPC 0,118", "VPC 108,118", "VPC 58,84", "VPS 52,84" }; - - String[] posMapped = { "POS", "POS", "POS", "POS", "POS", "POS", "POS", "POS", "POS", - "POS", "POS", "POS", "POS", "POS", "POS", "POS", "POS", "POS", "POS" }; - - String[] posOriginal = { "Vpitf", "Ncfsi", "R", "Mcmsi", "Md", "Amsi", "Ncmsi", "Ncnsi", - "pt", "Pre", "Vpitf", "Md", "Ncmpi", "Cp", "Dm", "Prq", "Vxitf", "Dd", "pt" }; - - String pennTree = "(ROOT (ROOT (S (VPC (V (Vpitf Имаме)) (NPA (N (Ncfsi нужда)) (PP " - + "(Prep (R от)) (NPA (NPA (M (Mcmsi един)) (NPA (APA (Adv (Md много)) (A " - + "(Amsi сложен))) (N (Ncmsi пример)))) (CoordP (ConjArg (NPA (N " - + "(Ncnsi изречение)) (CLR (pt ,) (VPS (Pron (Pre което)) (VPC (V " - + "(Vpitf съдържа)) (NPA (Adv (Md най-много)) (N (Ncmpi съставки)))))))) " - + "(Conj (C (Cp и))) (ConjArg (AdvPA (Adv (Dm зависимости,)) (CL (VPA (Adv " - + "(Prq колкото)) (VPC (V (Vxitf е)) (Adv (Dd възможно)))))))))))) (pt .))))"; - - String[] posTags = { "A", "Afsd", "Afsi", "Ams", "Amsf", "Amsh", "Amsi", - "Ansd", "Ansi", "Cc", "Cp", "Cr", "Cs", "Dd", "Dl", "Dm", "Dq", "Dt", "Hfsi", - "Hmsf", "I", "Mc", "Mcf", "Mcfpd", "Mcfpi", "Mcfsd", "Mcfsi", "Mcm", "Mcmpd", - "Mcmpi", "Mcmsf", "Mcmsi", "Mcn", "Mcnpd", "Mcnpi", "Mcnsd", "Mcnsi", "Md", "Mo", - "Mofsd", "Mofsi", "Momsf", "Momsh", "Momsi", "Monsd", "Monsi", "My", "Nc", "Ncfpd", - "Ncfpi", "Ncfs", "Ncfsd", "Ncfsi", "Ncmpd", "Ncmpi", "Ncms", "Ncmsd", "Ncmsf", - "Ncmsh", "Ncmsi", "Ncmt", "Ncnpd", "Ncnpi", "Ncnsd", "Ncnsi", "Npfsi", "Npnsi", - "Pca", "Pce", "Pcl", "Pcq", "Pct", "Pda", "Pde", "Pdl", "Pdm", "Pdq", "Pds", "Pdt", - "Pfa", "Pfe", "Pfl", "Pfm", "Pfp", "Pfq", "Pft", "Pfy", "Pia", "Pic", "Pie", "Pil", - "Pim", "Pip", "Piq", "Pit", "Pna", "Pne", "Pnl", "Pnm", "Pnp", "Pnt", "Ppe", - "Ppelap1", "Ppelap2", "Ppelap3", "Ppelas1", "Ppelas2", "Ppelas3f", "Ppelas3m", - "Ppelas3n", "Ppeldp1", "Ppelds1", "Ppelds2", "Ppelds3m", "Ppetap1", "Ppetap2", - "Ppetap3", "Ppetas1", "Ppetas2", "Ppetas3f", "Ppetas3m", "Ppetas3n", "Ppetdp1", - "Ppetdp2", "Ppetdp3", "Ppetds1", "Ppetds2", "Ppetds3f", "Ppetds3m", "Ppetds3n", - "Ppetsp1", "Ppetsp2", "Ppetsp3", "Ppetss1", "Ppetss2", "Ppetss3f", "Ppetss3m", - "Pph", "Pphlas2", "Pphtas2", "Pphtds2", "Pphtss2", "Ppxta", "Ppxtd", "Ppxts", - "Pra", "Pre", "Prl", "Prm", "Prp", "Prq", "Prs", "Prt", "Pshl", "Psht", "Psol", - "Psot", "Psxlop", "Psxlos", "Psxto", "Pszl", "Pszt", "R", "Ta", "Te", "Tg", "Ti", - "Tm", "Tn", "Tv", "Tx", "Viitf", "Vniicam", "Vniicao", "Vniif", "Vnitcam", - "Vnitcao", "Vnitf", "Vnpicao", "Vnpif", "Vnptcao", "Vnptf", "Vpiicam", "Vpiicao", - "Vpiicar", "Vpiif", "Vpiig", "Vpiiz", "Vpitcam", "Vpitcao", "Vpitcar", "Vpitcv", - "Vpitf", "Vpitg", "Vpitz", "Vppicam", "Vppicao", "Vppif", "Vppiz", "Vpptcam", - "Vpptcao", "Vpptcv", "Vpptf", "Vpptz", "Vxitcat", "Vxitf", "Vxitu", "Vyptf", - "Vyptz", "abbr", "foreign", "mw", "name", "pt", "w" }; - - String[] constituentTags = { "A", "APA", "APC", "Adv", "AdvPA", "AdvPC", "C", - "CL", "CLCHE", "CLDA", "CLQ", "CLR", "CLZADA", "Conj", "ConjArg", "CoordP", - "Gerund", "H", "M", "N", "NPA", "NPC", "PP", "Participle", "Prep", "Pron", "ROOT", - "S", "T", "V", "VPA", "VPC", "VPF", "VPS", "Verbalised" }; - - String[] unmappedConstituents = { "Conj", "ConjArg", "Verbalised" }; - - assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - assertPennTree(pennTree, selectSingle(jcas, PennTree.class)); - assertConstituents(constituentMapped, constituentOriginal, select(jcas, Constituent.class)); - assertTagset(POS.class, "btb", posTags, jcas); - // FIXME assertTagsetMapping(POS.class, "btb", new String[] {}, jcas); - assertTagset(Constituent.class, "btb", constituentTags, jcas); - assertTagsetMapping(Constituent.class, "btb", unmappedConstituents, jcas); - } - - @Test - public void testChinese() - throws Exception - { - JCas jcas = runTest("zh", - "我们 需要 一个 非常 复杂 的 句子 例如 其中 包含 许多 成分 和 尽可能 的 依赖 。"); - - String[] constituentMapped = { "ADVP 20,22", "ADVP 9,11", "NP 0,2", "NP 17,19", "NP 23,25", - "NP 23,34", "NP 32,34", "NP 37,40", "NP 37,45", "NP 43,45", "NP 6,34", "NP 6,45", - "NP 6,8", "PARN 20,34", "QP 29,31", "ROOT 0,47", "VP 12,14", "VP 26,28", "VP 3,45", - "VP 9,14", "X 0,47", "X 23,28", "X 37,42", "X 6,14", "X 6,16" }; - - String[] constituentOriginal = { "ADVP 20,22", "ADVP 9,11", "CP 6,16", "DNP 37,42", - "IP 0,47", "IP 23,28", "IP 6,14", "NP 0,2", "NP 17,19", "NP 23,25", "NP 23,34", - "NP 32,34", "NP 37,40", "NP 37,45", "NP 43,45", "NP 6,34", "NP 6,45", "NP 6,8", - "PRN 20,34", "QP 29,31", "ROOT 0,47", "VP 12,14", "VP 26,28", "VP 3,45", - "VP 9,14" }; - - String[] posMapped = { "POS_PRON", "POS_VERB", "POS_NOUN", "POS_ADJ", "POS_VERB", - "POS_PART", "POS_NOUN", "POS_ADJ", "POS_NOUN", "POS_VERB", "POS_NUM", "POS_NOUN", - "POS_CONJ", "POS_NOUN", "POS_PART", "POS_NOUN", "POS_PUNCT" }; - - String[] posOriginal = { "PN", "VV", "NN", "AD", "VA", "DEC", "NN", "AD", "NN", "VV", "CD", - "NN", "CC", "NN", "DEG", "NN", "PU" }; - - String pennTree = "(ROOT (IP (NP (PN 我们)) (VP (VV 需要) (NP (NP (CP (IP (NP (NN 一个)) " - + "(VP (ADVP (AD 非常)) (VP (VA 复杂)))) (DEC 的)) (NP (NN 句子)) (PRN (ADVP " - + "(AD 例如)) (NP (IP (NP (NN 其中)) (VP (VV 包含))) (QP (CD 许多)) (NP " - + "(NN 成分))))) (CC 和) (NP (DNP (NP (NN 尽可能)) (DEG 的)) (NP (NN 依赖))))) " - + "(PU 。)))"; - - String[] posTags = { "AD", "AS", "BA", "CC", "CD", "CS", "DEC", "DEG", "DER", "DEV", "DT", - "ETC", "FW", "IJ", "JJ", "LB", "LC", "M", "MSP", "NN", "NP", "NR", "NT", "OD", "P", - "PN", "PU", "SB", "SP", "VA", "VC", "VE", "VP", "VV", "X" }; - - String[] constituentTags = { "ADJP", "ADVP", "CLP", "CP", "DNP", "DP", "DVP", "FRAG", - "INTJ", "IP", "LCP", "LST", "MSP", "NN", "NP", "PP", "PRN", "QP", "ROOT", "UCP", - "VCD", "VCP", "VNV", "VP", "VPT", "VRD", "VSB" }; - - String[] unmappedPos = { "NP", "VP" }; - - assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - List trees = new ArrayList(select(jcas, PennTree.class)); - assertPennTree(pennTree, trees.get(0)); - assertConstituents(constituentMapped, constituentOriginal, select(jcas, Constituent.class)); - assertTagset(POS.class, "ctb", posTags, jcas); - assertTagsetMapping(POS.class, "ctb", unmappedPos, jcas); - assertTagset(Constituent.class, "ctb", constituentTags, jcas); - // FIXME assertTagsetMapping(Constituent.class, "ctb", new String[] {}, jcas); - } - - @Test - public void testEnglish() - throws Exception - { - JCas jcas = runTest("en", documentEnglish); - - String[] constituentMapped = { "ADJP 10,26", "ADJP 102,110", "ADJP 61,68", "NP 0,2", - "NP 61,98", "NP 8,110", "NP 8,43", "PP 99,110", "ROOT 0,112", "S 0,112", - "S 52,110", "SBAR 46,110", "VP 3,110", "VP 52,110", "WHNP 46,51" }; - - String[] constituentOriginal = { "ADJP 10,26", "ADJP 102,110", "ADJP 61,68", "NP 0,2", - "NP 61,98", "NP 8,110", "NP 8,43", "PP 99,110", "ROOT 0,112", "S 0,112", - "S 52,110", "SBAR 46,110", "VP 3,110", "VP 52,110", "WHNP 46,51" }; - - String[] posMapped = { "POS_PRON", "POS_VERB", "POS_DET", "POS_ADV", "POS_ADJ", "POS_NOUN", - "POS_NOUN", "POS_PUNCT", "POS_DET", "POS_VERB", "POS_ADP", "POS_ADJ", "POS_NOUN", - "POS_CONJ", "POS_NOUN", "POS_ADP", "POS_ADJ", "POS_PUNCT" }; - - String[] posOriginal = { "PRP", "VBP", "DT", "RB", "JJ", "NN", "NN", ",", - "WDT", "VBZ", "IN", "JJ", "NNS", "CC", "NNS", "IN", "JJ", "." }; - - String pennTree = "(ROOT (S (NP (PRP We)) (VP (VBP need) (NP (NP (DT a) (ADJP (RB very) " + - "(JJ complicated)) (NN example) (NN sentence)) (, ,) (SBAR (WHNP (WDT which)) (S " + - "(VP (VBZ contains) (NP (ADJP (IN as) (JJ many)) (NNS constituents) (CC and) " + - "(NNS dependencies)) (PP (IN as) (ADJP (JJ possible)))))))) (. .)))"; - - String[] posTags = { "#", "$", "''", ",", "-LRB-", "-RRB-", ".", ":", "CC", - "CD", "DT", "EX", "FW", "IN", "JJ", "JJR", "JJS", "LS", "MD", "NN", "NNP", "NNPS", - "NNS", "PDT", "POS", "PRP", "PRP$", "RB", "RBR", "RBS", "RP", "SYM", "TO", "UH", - "VB", "VBD", "VBG", "VBN", "VBP", "VBZ", "WDT", "WP", "WP$", "WRB", "``" }; - - String[] constituentTags = { "ADJP", "ADVP", "CONJP", "FRAG", "INTJ", "LST", - "NAC", "NP", "NX", "PP", "PRN", "PRT", "PRT|ADVP", "QP", "ROOT", "RRC", "S", "SBAR", - "SBARQ", "SINV", "SQ", "UCP", "VP", "WHADJP", "WHADVP", "WHNP", "WHPP", "X" }; - - String[] unmappedPos = {}; - - String[] unmappedConst = {}; - - assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - assertPennTree(pennTree, selectSingle(jcas, PennTree.class)); - assertConstituents(constituentMapped, constituentOriginal, select(jcas, Constituent.class)); - assertTagset(POS.class, "ptb", posTags, jcas); - assertTagsetMapping(POS.class, "ptb", unmappedPos, jcas); - assertTagset(Constituent.class, "ptb", constituentTags, jcas); - // FIXME assertTagsetMapping(Constituent.class, "ptb", unmappedConst, jcas); - } - - @Test - public void testEnglishPreTagged() - throws Exception - { - JCas jcas = runTest("en", null, documentEnglish, true); - - String[] constituentMapped = { "ADJP 10,26", "ADJP 102,110", "NP 0,2", "NP 64,110", - "NP 64,98", "NP 8,110", "NP 8,43", "PP 61,110", "PP 99,110", "ROOT 0,112", - "S 0,112", "S 52,110", "SBAR 46,110", "VP 3,110", "VP 52,110", "WHNP 46,51" }; - - String[] constituentOriginal = { "ADJP 10,26", "ADJP 102,110", "NP 0,2", "NP 64,110", - "NP 64,98", "NP 8,110", "NP 8,43", "PP 61,110", "PP 99,110", "ROOT 0,112", - "S 0,112", "S 52,110", "SBAR 46,110", "VP 3,110", "VP 52,110", "WHNP 46,51" }; - - String[] posMapped = { "POS_PRON", "POS_VERB", "POS_DET", "POS_ADV", "POS_ADJ", "POS_NOUN", - "POS_NOUN", "POS_PUNCT", "POS_DET", "POS_VERB", "POS_ADP", "POS_ADJ", "POS_NOUN", - "POS_CONJ", "POS_NOUN", "POS_ADP", "POS_ADJ", "POS_PUNCT" }; - - String[] posOriginal = { "PRP", "VBP", "DT", "RB", "JJ", "NN", "NN", ",", "WDT", "VBZ", - "IN", "JJ", "NNS", "CC", "NNS", "IN", "JJ", "." }; - - String pennTree = "(ROOT (S (NP (PRP We)) (VP (VBP need) (NP (NP (DT a) (ADJP " - + "(RB very) (JJ complicated)) (NN example) (NN sentence)) (, ,) (SBAR (WHNP " - + "(WDT which)) (S (VP (VBZ contains) (PP (IN as) (NP (NP (JJ many) " - + "(NNS constituents) (CC and) (NNS dependencies)) (PP (IN as) (ADJP " - + "(JJ possible)))))))))) (. .)))"; - - String[] posTags = { "#", "$", "''", ",", "-LRB-", "-RRB-", ".", ":", "CC", "CD", "DT", - "EX", "FW", "IN", "JJ", "JJR", "JJS", "LS", "MD", "NN", "NNP", "NNPS", "NNS", - "PDT", "POS", "PRP", "PRP$", "RB", "RBR", "RBS", "RP", "SYM", "TO", "UH", "VB", - "VBD", "VBG", "VBN", "VBP", "VBZ", "WDT", "WP", "WP$", "WRB", "``" }; - - String[] constituentTags = { "ADJP", "ADVP", "CONJP", "FRAG", "INTJ", "LST", "NAC", "NP", - "NX", "PP", "PRN", "PRT", "PRT|ADVP", "QP", "ROOT", "RRC", "S", "SBAR", "SBARQ", - "SINV", "SQ", "UCP", "VP", "WHADJP", "WHADVP", "WHNP", "WHPP", "X" }; - - String[] unmappedPos = {}; - - String[] unmappedConst = {}; - - assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - assertPennTree(pennTree, selectSingle(jcas, PennTree.class)); - assertConstituents(constituentMapped, constituentOriginal, - select(jcas, Constituent.class)); - assertTagset(POS.class, "ptb", posTags, jcas); - assertTagsetMapping(POS.class, "ptb", unmappedPos, jcas); - assertTagset(Constituent.class, "ptb", constituentTags, jcas); - // FIXME assertTagsetMapping(Constituent.class, "ptb", unmappedConst, - // jcas); - } - - @Test - public void testGerman() - throws Exception - { - JCas jcas = runTest("de", "Wir brauchen ein sehr kompliziertes Beispiel , welches " + - "möglichst viele Konstituenten und Dependenzen beinhaltet ."); - - String[] constituentMapped = { "ADJP 17,35", "Constituent 0,113", "NP 13,111", "NP 55,100", - "NP 71,100", "ROOT 0,113", "S 0,111", "S 47,111" }; - - String[] constituentOriginal = { "AP 17,35", "CNP 71,100", "NP 13,111", "NP 55,100", - "PSEUDO 0,113", "ROOT 0,113", "S 0,111", "S 47,111" }; - - String[] posOriginal = { "PPER", "VVFIN", "ART", "ADV", "ADJA", "NN", "$,", "PRELS", "ADV", - "PIDAT", "NN", "KON", "NN", "VVFIN", "$." }; - - String[] posMapped = { "POS_PRON", "POS_VERB", "POS_DET", "POS_ADV", "POS_ADJ", "POS_NOUN", "POS_PUNCT", "POS_PRON", "POS_ADV", - "POS_PRON", "POS_NOUN", "POS_CONJ", "POS_NOUN", "POS_VERB", "POS_PUNCT" }; - - String pennTree = "(ROOT (PSEUDO (S (PPER Wir) (VVFIN brauchen) (NP (ART ein) (AP " + - "(ADV sehr) (ADJA kompliziertes)) (NN Beispiel) ($, ,) (S (PRELS welches) (NP " + - "(ADV möglichst) (PIDAT viele) (CNP (NN Konstituenten) (KON und) " + - "(NN Dependenzen))) (VVFIN beinhaltet)))) ($. .)))"; - - String[] posTags = { "$*LRB*", "$,", "$.", "*T1*", "*T2*", "*T3*", "*T4*", - "*T5*", "*T6*", "*T7*", "*T8*", "--", "ADJA", "ADJD", "ADV", "APPO", "APPR", - "APPRART", "APZR", "ART", "CARD", "FM", "ITJ", "KOKOM", "KON", "KOUI", "KOUS", - "NE", "NN", "PDAT", "PDS", "PIAT", "PIDAT", "PIS", "PPER", "PPOSAT", "PPOSS", - "PRELAT", "PRELS", "PRF", "PROAV", "PTKA", "PTKANT", "PTKNEG", "PTKVZ", "PTKZU", - "PWAT", "PWAV", "PWS", "TRUNC", "VAFIN", "VAIMP", "VAINF", "VAPP", "VMFIN", - "VMINF", "VMPP", "VVFIN", "VVIMP", "VVINF", "VVIZU", "VVPP", "XY" }; - - String[] constituentTags = { "---CJ", "AA", "AP", "AVP", "CAC", "CAP", "CAVP", - "CCP", "CH", "CNP", "CO", "CPP", "CS", "CVP", "CVZ", "DL", "ISU", "MPN", "MTA", - "NM", "NP", "PP", "PSEUDO", "QL", "ROOT", "S", "VP", "VZ" }; - - String[] unmappedPos = { "$*LRB*", "*T1*", "*T2*", "*T3*", "*T4*", "*T5*", - "*T6*", "*T7*", "*T8*", "--" }; - - String[] unmappedConst = { "---CJ", "PSEUDO" }; - - assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - assertPennTree(pennTree, selectSingle(jcas, PennTree.class)); - assertConstituents(constituentMapped, constituentOriginal, select(jcas, Constituent.class)); - assertTagset(POS.class, "stts", posTags, jcas); - assertTagsetMapping(POS.class, "stts", unmappedPos, jcas); - assertTagset(Constituent.class, "negra", constituentTags, jcas); - assertTagsetMapping(Constituent.class, "negra", unmappedConst, jcas); - } - - @Test - public void testFrench() - throws Exception - { - JCas jcas = runTest("fr", "Nous avons besoin d' une phrase par exemple très " + - "compliqué , qui contient des constituants que de nombreuses dépendances et que " + - "possible ."); - - String[] constituentMapped = { "ADJP 44,58", "NP 21,90", "NP 36,43", "NP 61,64", - "NP 74,90", "NP 95,120", "PP 18,90", "PP 32,43", "ROOT 0,138", "S 0,138", - "SBAR 124,136", "SBAR 61,90", "SBAR 91,120", "VP 0,17", "VP 65,73" }; - - String[] constituentOriginal = { "AP 44,58", "NP 21,90", "NP 36,43", "NP 61,64", - "NP 74,90", "NP 95,120", "PP 18,90", "PP 32,43", "ROOT 0,138", "SENT 0,138", - "Srel 61,90", "Ssub 124,136", "Ssub 91,120", "VN 0,17", "VN 65,73" }; - - String[] posMapped = { "POS_PRON", "POS_VERB", "POS_VERB", "POS_ADP", "POS_DET", "POS_NOUN", "POS_ADP", "POS_NOUN", "POS_ADV", - "POS_ADJ", "POS_PUNCT", "POS_PRON", "POS_VERB", "POS_DET", "POS_NOUN", "POS_CONJ", "POS_DET", "POS_ADJ", "POS_NOUN", "POS_CONJ", - "POS_CONJ", "POS_ADJ", "POS_PUNCT" }; - - String[] posOriginal = { "CL", "V", "V", "P", "D", "N", "P", "N", "ADV", "A", - ",", "PRO", "V", "D", "N", "C", "D", "A", "N", "C", "C", "A", "." }; - - String pennTree = "(ROOT (ROOT (SENT (VN (CL Nous) (V avons) (V besoin)) (PP (P d') (NP " - + "(D une) (N phrase) (PP (P par) (NP (N exemple))) (AP (ADV très) (A compliqué)) " - + "(, ,) (Srel (NP (PRO qui)) (VN (V contient)) (NP (D des) (N constituants))))) " - + "(Ssub (C que) (NP (D de) (A nombreuses) (N dépendances))) (C et) (Ssub (C que) " - + "(A possible)) (. .))))"; - - String[] posTags = { "\"", ",", "-LRB-", "-RRB-", ".", ":", "A", "ADV", - "ADVP", "Afs", "C", "CC", "CL", "CS", "D", "Dmp", "ET", "I", "N", "ND", "P", "PC", - "PREF", "PRO", "S", "V", "X", "_unknown_", "p", "près" }; - - String[] constituentTags = { "AP", "AdP", "NP", "PP", "ROOT", "SENT", "Sint", - "Srel", "Ssub", "VN", "VPinf", "VPpart" }; - - String[] unmappedPos = { "\"", "-LRB-", "-RRB-", "ADVP", "Afs", "CC", - "CS", "Dmp", "ND", "PC", "S", "X", "_unknown_", "p", "près" }; - - assertPOS(posMapped, posOriginal, select(jcas, POS.class)); - assertPennTree(pennTree, selectSingle(jcas, PennTree.class)); - assertConstituents(constituentMapped, constituentOriginal, select(jcas, Constituent.class)); - assertTagset(POS.class, "ftb", posTags, jcas); - assertTagsetMapping(POS.class, "ftb", unmappedPos, jcas); - assertTagset(Constituent.class, "ftb", constituentTags, jcas); - assertTagsetMapping(Constituent.class, "ftb", new String[] {}, jcas); - } - - /** - * Setup CAS to test parser for the English language (is only called once if - * an English test is run) - */ - private JCas runTest(String aLanguage, String aText) - throws Exception - { - return runTest(aLanguage, null, aText, false); - } - - - private JCas runTest(String aLanguage, String aVariant, String aText, boolean aGoldPos, - Object... aExtraParams) - throws Exception - { - AggregateBuilder aggregate = new AggregateBuilder(); - - if (aGoldPos) { - aggregate.add(createEngineDescription(OpenNlpPosTagger.class)); - } - - Object[] params = new Object[] { - BerkeleyParser.PARAM_VARIANT, aVariant, - BerkeleyParser.PARAM_PRINT_TAGSET, true, - BerkeleyParser.PARAM_WRITE_PENN_TREE, true, - BerkeleyParser.PARAM_WRITE_POS, !aGoldPos, - BerkeleyParser.PARAM_READ_POS, aGoldPos}; - params = ArrayUtils.addAll(params, aExtraParams); - aggregate.add(createEngineDescription(BerkeleyParser.class, params)); - - return TestRunner.runTest(aggregate.createAggregateDescription(), aLanguage, aText); - } -} diff --git a/dkpro-core-berkeleyparser-gpl/src/test/resources/log4j2.xml b/dkpro-core-berkeleyparser-gpl/src/test/resources/log4j2.xml deleted file mode 100644 index 19bf03b585..0000000000 --- a/dkpro-core-berkeleyparser-gpl/src/test/resources/log4j2.xml +++ /dev/null @@ -1,15 +0,0 @@ - - - - - - - - - - - - - - - diff --git a/dkpro-core-bom-gpl/pom.xml b/dkpro-core-bom-gpl/pom.xml index 2a6e9fa3ca..58b01c8ce3 100644 --- a/dkpro-core-bom-gpl/pom.xml +++ b/dkpro-core-bom-gpl/pom.xml @@ -49,11 +49,6 @@ pom import - - org.dkpro.core - dkpro-core-berkeleyparser-gpl - 3.0.0-SNAPSHOT - org.dkpro.core dkpro-core-corenlp-gpl diff --git a/dkpro-core-gpl/pom.xml b/dkpro-core-gpl/pom.xml index 5b16432719..979eecacbe 100644 --- a/dkpro-core-gpl/pom.xml +++ b/dkpro-core-gpl/pom.xml @@ -41,7 +41,6 @@ - ../dkpro-core-berkeleyparser-gpl ../dkpro-core-corenlp-gpl ../dkpro-core-lingpipe-gpl ../dkpro-core-matetools-gpl