dict-ns-20070206.orig/0000755000175000017500000000000010562175350012732 5ustar dokodokodict-ns-20070206.orig/nso/0000755000175000017500000000000010562150175013527 5ustar dokodokodict-ns-20070206.orig/nso/.svn/0000755000175000017500000000000010562150176014414 5ustar dokodokodict-ns-20070206.orig/nso/.svn/text-base/0000755000175000017500000000000010562150175016307 5ustar dokodokodict-ns-20070206.orig/nso/.svn/text-base/VERSION.svn-base0000444000175000017500000000001110562150175021062 0ustar dokodoko20060120 dict-ns-20070206.orig/nso/.svn/text-base/ChangeLog.svn-base0000444000175000017500000000033010562150175021570 0ustar dokodoko2006-01-23 Dwayne Bailey * myspell/ns_ZA.aff: convert to iso-8859-15 2006-01-20 Dwayne Bailey * Build: everything - build structure setup for Northern Sotho dict-ns-20070206.orig/nso/.svn/text-base/COPYING.svn-base0000444000175000017500000006347610562150175021075 0ustar dokodoko GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! dict-ns-20070206.orig/nso/.svn/text-base/CREDITS.svn-base0000444000175000017500000000016710562150175021046 0ustar dokodokoDwayne Bailey Creation of the Northern Sotho build framework Translators of OpenOffice.org dict-ns-20070206.orig/nso/.svn/text-base/Makefile.svn-base0000444000175000017500000000121710562150175021463 0ustar dokodoko# this makefile is used to automate building of dictionaries # based on affix files etc... # if you need to adapt this Makefile for another language, # all you should have to do is change these variables. # if you need to change anything else then change it in Makefile.languages LANG=ns LANGNAME=Northern Sotho LANGNAMELOW=northern-sotho REGION=ZA REGIONNAME=South Africa # The input wordlists WORDLIST.IN=$(shell ls wordlists/wordlist.*.in) # Change these if your language is not defined in OpenOffice otherwise defaults # to the values you set in $LANG and $REGION #LANG_FAKE=it #REGION_FAKE=IT CHARSET=iso-8859-15 include ../utils/Makefile.language dict-ns-20070206.orig/nso/.svn/prop-base/0000755000175000017500000000000010562150175016303 5ustar dokodokodict-ns-20070206.orig/nso/.svn/prop-base/VERSION.svn-base0000444000175000017500000000012110562150175021060 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/.svn/prop-base/ChangeLog.svn-base0000444000175000017500000000012110562150175021562 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/.svn/prop-base/COPYING.svn-base0000444000175000017500000000012110562150175021043 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/.svn/prop-base/CREDITS.svn-base0000444000175000017500000000012110562150175021030 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/.svn/prop-base/Makefile.svn-base0000444000175000017500000000012110562150175021450 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/.svn/props/0000755000175000017500000000000010562150175015556 5ustar dokodokodict-ns-20070206.orig/nso/.svn/tmp/0000755000175000017500000000000010562150175015213 5ustar dokodokodict-ns-20070206.orig/nso/.svn/tmp/text-base/0000755000175000017500000000000010562150175017107 5ustar dokodokodict-ns-20070206.orig/nso/.svn/tmp/prop-base/0000755000175000017500000000000010562150175017103 5ustar dokodokodict-ns-20070206.orig/nso/.svn/tmp/props/0000755000175000017500000000000010562150175016356 5ustar dokodokodict-ns-20070206.orig/nso/.svn/entries0000444000175000017500000000172710562150175016014 0ustar dokodoko8 dir 9074 https://zaf.svn.sourceforge.net/svnroot/zaf/trunk/dict/nso https://zaf.svn.sourceforge.net/svnroot/zaf 2006-01-23T06:27:50.000000Z 8403 dwaynebailey svn:special svn:externals svn:needs-lock 2ddcbd3e-7f1e-0410-b01d-e1bca9a1112e aspell dir myspell dir VERSION file 2007-02-06T19:01:17.000000Z 9b818045ac3fa3d6961b16d1b08eeb14 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props ChangeLog file 2007-02-06T19:01:17.000000Z a1bad7bed9949ff66246c6f0a047ae63 2006-01-23T06:27:50.000000Z 8403 dwaynebailey has-props COPYING file 2007-02-06T19:01:17.000000Z 7fbc338309ac38fefcd64b04bb903e34 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props wordlists dir CREDITS file 2007-02-06T19:01:17.000000Z 3912570665a1ee1d7d9b914394a8c924 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props Makefile file 2007-02-06T19:01:17.000000Z 4be96551f10c79573ab82f957a679f77 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props dict-ns-20070206.orig/nso/.svn/format0000444000175000017500000000000210562150175015614 0ustar dokodoko8 dict-ns-20070206.orig/nso/.svn/all-wcprops0000444000175000017500000000110210562150175016571 0ustar dokodokoK 25 svn:wc:ra_dav:version-url V 41 /svnroot/zaf/!svn/ver/8403/trunk/dict/nso END VERSION K 25 svn:wc:ra_dav:version-url V 49 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/VERSION END ChangeLog K 25 svn:wc:ra_dav:version-url V 51 /svnroot/zaf/!svn/ver/8403/trunk/dict/nso/ChangeLog END COPYING K 25 svn:wc:ra_dav:version-url V 49 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/COPYING END CREDITS K 25 svn:wc:ra_dav:version-url V 49 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/CREDITS END Makefile K 25 svn:wc:ra_dav:version-url V 50 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/Makefile END dict-ns-20070206.orig/nso/aspell/0000755000175000017500000000000010562150175015007 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/0000755000175000017500000000000010562150176015674 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/text-base/0000755000175000017500000000000010562150175017567 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/text-base/info.in.svn-base0000444000175000017500000000035510562150175022570 0ustar dokodokoname_english Northern Sotho lang ns author: name Dwayne Bailey email dwayne at translate org za copyright LGPL version {VERSION} charset iso8859-15 special - -*- ' -** soundslike none alias ns northern-sotho dict: name ns add ns dict-ns-20070206.orig/nso/aspell/.svn/text-base/Copyright.svn-base0000444000175000017500000000035410562150175023177 0ustar dokodokoWordlists --------- The Aspell Northern Sotho dictionary is based on various the wordlist, either in the public domain or released under the LGPL. MySpell Affix File ------------------ Copyright (C) 2003 Dwayne Bailey under the LGPL dict-ns-20070206.orig/nso/aspell/.svn/prop-base/0000755000175000017500000000000010562150175017563 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/prop-base/info.in.svn-base0000444000175000017500000000012110562150175022553 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/aspell/.svn/prop-base/Copyright.svn-base0000444000175000017500000000012110562150175023163 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/aspell/.svn/props/0000755000175000017500000000000010562150175017036 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/tmp/0000755000175000017500000000000010562150175016473 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/tmp/text-base/0000755000175000017500000000000010562150175020367 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/tmp/prop-base/0000755000175000017500000000000010562150175020363 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/tmp/props/0000755000175000017500000000000010562150175017636 5ustar dokodokodict-ns-20070206.orig/nso/aspell/.svn/entries0000444000175000017500000000103210562150175017261 0ustar dokodoko8 dir 9074 https://zaf.svn.sourceforge.net/svnroot/zaf/trunk/dict/nso/aspell https://zaf.svn.sourceforge.net/svnroot/zaf 2006-01-23T06:14:31.000000Z 8402 dwaynebailey svn:special svn:externals svn:needs-lock 2ddcbd3e-7f1e-0410-b01d-e1bca9a1112e info.in file 2007-02-06T19:01:17.000000Z f334cc6d2d12952595da91d6598bac62 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props Copyright file 2007-02-06T19:01:17.000000Z dcb482c03ba232d40e904cb9f7b6a788 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props dict-ns-20070206.orig/nso/aspell/.svn/format0000444000175000017500000000000210562150175017074 0ustar dokodoko8 dict-ns-20070206.orig/nso/aspell/.svn/all-wcprops0000444000175000017500000000045710562150175020065 0ustar dokodokoK 25 svn:wc:ra_dav:version-url V 48 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/aspell END info.in K 25 svn:wc:ra_dav:version-url V 56 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/aspell/info.in END Copyright K 25 svn:wc:ra_dav:version-url V 58 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/aspell/Copyright END dict-ns-20070206.orig/nso/aspell/info.in0000644000175000017500000000035510562150175016275 0ustar dokodokoname_english Northern Sotho lang ns author: name Dwayne Bailey email dwayne at translate org za copyright LGPL version {VERSION} charset iso8859-15 special - -*- ' -** soundslike none alias ns northern-sotho dict: name ns add ns dict-ns-20070206.orig/nso/aspell/Copyright0000644000175000017500000000035410562150175016704 0ustar dokodokoWordlists --------- The Aspell Northern Sotho dictionary is based on various the wordlist, either in the public domain or released under the LGPL. MySpell Affix File ------------------ Copyright (C) 2003 Dwayne Bailey under the LGPL dict-ns-20070206.orig/nso/myspell/0000755000175000017500000000000010562150175015214 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/0000755000175000017500000000000010562150176016101 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/text-base/0000755000175000017500000000000010562150175017774 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/text-base/README_ns_ZA.txt.svn-base0000444000175000017500000007436610562150175024317 0ustar dokodokoMySpell Northern Sotho Spellchecker ----------------------------------- 1. Welcome 2. Copyright 3. Installation and Setup 4. Contributing 5. Copying Enjoy! 1. Welcome ========== This spellchecker is Free Software: Free to use - Free to share - Free to change. See section 4. Contributing to see how you can help make it even better. Why Free Software? ------------------ The Translate.org.za project's aim is to make language resources and software available to the speakers of that language and licensed in such a way that the resources remain Free and thus available to all the language's speakers. After all it is you, the speakers of Northern Sotho, who have actually developed and made Northern Sotho into the language that it is today. What is Free Software? ---------------------- For a good explanation of Free Software visit: http://www.gnu.org/philosophy/philosophy.html AND http://www.gnu.org/philosophy/free-sw.html 2. Copyright ============ Northern Sotho Wordlist ----------------------- The Aspell Northern Sotho dictionary is based on various the wordlist, either in the public domain or released under the LGPL. MySpell Affix File ------------------ Copyright (C) 2003 Dwayne Bailey under the LGPL 3. Installation and Setup ========================= Automated --------- Newer versions of OpenOffice.org have a built in macro to step you through an automatic install process. File -> Autopilot -> Install new dictionaries... If this is unavailable then download 'DicOOo.sxw' from: http://ftp.services.openoffice.org/pub/OpenOffice.org/contrib/dictionaries/dicooo/DicOOo.sxw Run the macro and follow the steps outlined. If you would like the dictionary to be available to all users then run the installation as the administrative or root user. It is best to restart OpenOffice.org after the installation. The macro operates in two modes: 1) Online - the latest dictionaries are retrieved from the OpenOffice.org website. 2) Offline - an offline dictionary pack, which you have already downloaded, is installed from the hard-drive. Offline dictionaries can be downloaded from: http://lingucomponent.openoffice.org/dictpack.html OR http://sourceforge.net/project/showfiles.php?group_id=91920&package_id=103504 For more detailed instructions see: http://lingucomponent.openoffice.org/auto_instal.html Non-automated ------------- For instructions on how to install the Northern Sotho dictionary manually please visit the following URL: http://lingucomponent.openoffice.org/manual_instal.html Spellchecker Selection ---------------------- Once the spellchecker is installed you need to configure a few settings and perform some checks. 1) Check that the Northern Sotho Spellchecker is enabled. Tools -> Options -> Language Settings -> Writing Aids In the section marked 'Available language modules' select 'Edit...'. Under the languages drop-down select Northern Sotho and ensure that the 'OpenOffice.org MySpell SpellChecker' is enabled. 2) Set your default document language to Northern Sotho If most of your writing is in Northern Sotho then this step will ensure that documents you compose from now on are treated as Northern Sotho documents. If much of your writing is in English you might want to skip this step. Tools -> Options -> Language Settings -> Languages In the section marked 'Default languages for documents' is a drop-down labelled 'Western'. Northern Sotho has a tick next to it to indicate that a spellchecker is installed. Set your default language to Northern Sotho. 3) Changing existing documents or paragraphs to Northern Sotho Some old document might be written in Northern Sotho but the document was stored indicating that the text was in English. You can indicate that this is Northern Sotho text by: a) Select the relevant text (Ctrl-A selects the whole document) b) Format -> Character... Change the 'Language' drop-down to Northern Sotho. 4. Contributing =============== You can help to make this software better by: a) Contributing corrections and missing words b) Contributing your wordlists c) Reviewing the existing wordlists and user contributed lists. d) Joining the Northern Sotho translation and dictionary discussion list 'translate-discuss-nso' at: http://sourceforge.net/mail/?group_id=91920 Email your contributions to Dwayne Bailey . 5. Copying ========== This software is released under the LGPL which is included here for your information. GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! dict-ns-20070206.orig/nso/myspell/.svn/text-base/ns_ZA.aff.svn-base0000444000175000017500000000161110562150175023176 0ustar dokodoko# ns_ZA.aff - Northern Sotho (ns) affix file for use in myspell # # Copyright (C) 2003 Dwayne Bailey # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # SET ISO8859-15 TRY aeoltinghmkswrpbdufyMcSjTBDLNPKRAvCEz-GIHOFWJV'xUYZqXQ dict-ns-20070206.orig/nso/myspell/.svn/prop-base/0000755000175000017500000000000010562150175017770 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/prop-base/README_ns_ZA.txt.svn-base0000444000175000017500000000012110562150175024265 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/myspell/.svn/prop-base/ns_ZA.aff.svn-base0000444000175000017500000000012110562150175023165 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/myspell/.svn/props/0000755000175000017500000000000010562150175017243 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/tmp/0000755000175000017500000000000010562150175016700 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/tmp/text-base/0000755000175000017500000000000010562150175020574 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/tmp/prop-base/0000755000175000017500000000000010562150175020570 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/tmp/props/0000755000175000017500000000000010562150175020043 5ustar dokodokodict-ns-20070206.orig/nso/myspell/.svn/entries0000444000175000017500000000104410562150175017471 0ustar dokodoko8 dir 9074 https://zaf.svn.sourceforge.net/svnroot/zaf/trunk/dict/nso/myspell https://zaf.svn.sourceforge.net/svnroot/zaf 2006-01-23T06:27:50.000000Z 8403 dwaynebailey svn:special svn:externals svn:needs-lock 2ddcbd3e-7f1e-0410-b01d-e1bca9a1112e README_ns_ZA.txt file 2007-02-06T19:01:17.000000Z 720d74fe71708b0d8126ae81dee9b86e 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props ns_ZA.aff file 2007-02-06T19:01:17.000000Z a299dc61997a58d4753021d2cb2c61f7 2006-01-23T06:27:50.000000Z 8403 dwaynebailey has-props dict-ns-20070206.orig/nso/myspell/.svn/format0000444000175000017500000000000210562150175017301 0ustar dokodoko8 dict-ns-20070206.orig/nso/myspell/.svn/all-wcprops0000444000175000017500000000050410562150175020263 0ustar dokodokoK 25 svn:wc:ra_dav:version-url V 49 /svnroot/zaf/!svn/ver/8403/trunk/dict/nso/myspell END README_ns_ZA.txt K 25 svn:wc:ra_dav:version-url V 66 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/myspell/README_ns_ZA.txt END ns_ZA.aff K 25 svn:wc:ra_dav:version-url V 59 /svnroot/zaf/!svn/ver/8403/trunk/dict/nso/myspell/ns_ZA.aff END dict-ns-20070206.orig/nso/myspell/README_ns_ZA.txt0000644000175000017500000007436610562150175020024 0ustar dokodokoMySpell Northern Sotho Spellchecker ----------------------------------- 1. Welcome 2. Copyright 3. Installation and Setup 4. Contributing 5. Copying Enjoy! 1. Welcome ========== This spellchecker is Free Software: Free to use - Free to share - Free to change. See section 4. Contributing to see how you can help make it even better. Why Free Software? ------------------ The Translate.org.za project's aim is to make language resources and software available to the speakers of that language and licensed in such a way that the resources remain Free and thus available to all the language's speakers. After all it is you, the speakers of Northern Sotho, who have actually developed and made Northern Sotho into the language that it is today. What is Free Software? ---------------------- For a good explanation of Free Software visit: http://www.gnu.org/philosophy/philosophy.html AND http://www.gnu.org/philosophy/free-sw.html 2. Copyright ============ Northern Sotho Wordlist ----------------------- The Aspell Northern Sotho dictionary is based on various the wordlist, either in the public domain or released under the LGPL. MySpell Affix File ------------------ Copyright (C) 2003 Dwayne Bailey under the LGPL 3. Installation and Setup ========================= Automated --------- Newer versions of OpenOffice.org have a built in macro to step you through an automatic install process. File -> Autopilot -> Install new dictionaries... If this is unavailable then download 'DicOOo.sxw' from: http://ftp.services.openoffice.org/pub/OpenOffice.org/contrib/dictionaries/dicooo/DicOOo.sxw Run the macro and follow the steps outlined. If you would like the dictionary to be available to all users then run the installation as the administrative or root user. It is best to restart OpenOffice.org after the installation. The macro operates in two modes: 1) Online - the latest dictionaries are retrieved from the OpenOffice.org website. 2) Offline - an offline dictionary pack, which you have already downloaded, is installed from the hard-drive. Offline dictionaries can be downloaded from: http://lingucomponent.openoffice.org/dictpack.html OR http://sourceforge.net/project/showfiles.php?group_id=91920&package_id=103504 For more detailed instructions see: http://lingucomponent.openoffice.org/auto_instal.html Non-automated ------------- For instructions on how to install the Northern Sotho dictionary manually please visit the following URL: http://lingucomponent.openoffice.org/manual_instal.html Spellchecker Selection ---------------------- Once the spellchecker is installed you need to configure a few settings and perform some checks. 1) Check that the Northern Sotho Spellchecker is enabled. Tools -> Options -> Language Settings -> Writing Aids In the section marked 'Available language modules' select 'Edit...'. Under the languages drop-down select Northern Sotho and ensure that the 'OpenOffice.org MySpell SpellChecker' is enabled. 2) Set your default document language to Northern Sotho If most of your writing is in Northern Sotho then this step will ensure that documents you compose from now on are treated as Northern Sotho documents. If much of your writing is in English you might want to skip this step. Tools -> Options -> Language Settings -> Languages In the section marked 'Default languages for documents' is a drop-down labelled 'Western'. Northern Sotho has a tick next to it to indicate that a spellchecker is installed. Set your default language to Northern Sotho. 3) Changing existing documents or paragraphs to Northern Sotho Some old document might be written in Northern Sotho but the document was stored indicating that the text was in English. You can indicate that this is Northern Sotho text by: a) Select the relevant text (Ctrl-A selects the whole document) b) Format -> Character... Change the 'Language' drop-down to Northern Sotho. 4. Contributing =============== You can help to make this software better by: a) Contributing corrections and missing words b) Contributing your wordlists c) Reviewing the existing wordlists and user contributed lists. d) Joining the Northern Sotho translation and dictionary discussion list 'translate-discuss-nso' at: http://sourceforge.net/mail/?group_id=91920 Email your contributions to Dwayne Bailey . 5. Copying ========== This software is released under the LGPL which is included here for your information. GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! dict-ns-20070206.orig/nso/myspell/ns_ZA.aff0000644000175000017500000000161110562150175016703 0ustar dokodoko# ns_ZA.aff - Northern Sotho (ns) affix file for use in myspell # # Copyright (C) 2003 Dwayne Bailey # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # SET ISO8859-15 TRY aeoltinghmkswrpbdufyMcSjTBDLNPKRAvCEz-GIHOFWJV'xUYZqXQ dict-ns-20070206.orig/nso/wordlists/0000755000175000017500000000000010562150175015561 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/0000755000175000017500000000000010562150176016446 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/text-base/0000755000175000017500000000000010562150175020341 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/text-base/wordlist.openoffice.in.svn-base0000444000175000017500000016736310562150175026407 0ustar dokodoko# wordlist.opeenoffic.in - Northern Sotho (nso) words extracted from the # translations of OpenOffice.org # # Copyright (C) 2006 Zuza Software Foundation # # Some words that were found have been expanded to cover plurals, # etc. Capitalisation has been validated. # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # go ya e ka le ga o sa se wa tša la a di tše ye bja yeo mo tsenya na gona ge gore faele ke nomoro boleng leina tšeo nyaka tla sengwalwa bakeng tokumente goba phošo version package tsebišo letlakala moka motheo kgetha lenaneo pele bjalo sedirišwa godimo tšwa gago temana mohuta sebopego ba bo text nako hle latelago gare boloka bjo thoma dipeakanyo ntle diriša tloša palo lego mothalo tafola bjale dira gape tšhupetšo mothopo morago dikagare mothaladi fetola kgone sekgoba tlase ho nago mathomo lokiša seo beakanya karolo kholomo difiwa kgetho wo selo mpsha mafelelo tshedimošo bontšha hlama Boetša setaele peakanyo swanetše seswantšho lanngele lagoja itiragalelago bogolo ao oketša mokgwa difaele bušetša be leo ditokumente kgotla tatelano romela mmala dikgetho kgolo tšhate lefelo aterese šetše modiriši wisate didirišwa thempoleiti šoma pego thala nngwe letšatšikgwedi nakong bara sehlogo kgethilwego tlhagišo tekanyetšo tsena tee methaladi datapeisi foromo fase sele rulaganya lebala hlogo fihla thekgo lekola tirišo maemo fonto feela ditlhaka dingwe tshepedišo tlhaka fomate leswa dikholomo tokomane template phatlalatšo fomula eba diphetogo hwetša tsela ntlha lepatlelo legato dintlha bea phumola disele bophara thušo sun raraganego openoffice kgokagano phumula ja sego pampiri mootledi botelele tšwela swanetšego nyenyane tloga tlhaelelo tekanyo kakaretšo bopa moo gomme boemo segatiši nale Microsoft leswao šomago nokela mošomo mapatlelo magareng gatiša diswantšho maina itiriša gabedi fela bala tswalela pono ngwala puku matlakala laetša data tokišo sehlopha org nngele foreime ditaele dinomoro mogato letšatši kgonthe foreimi amogela šomiša lekana gola bula yona tsenywa taelo lebaka hlakanya bothata Boikagelo tšweletše tsepamego java fonte dirišwa taolo mabala lentšuphetišo lelokelelo leka e-meile tšhireletšo rapamego modiro kopanya dilo beetšwe Url seabi mafelo kgopelo hlakantšha dithalwa poso setšweletšwa phetogo mosebe mantšu fapanego Excel X makopano fetilego bolokwa tiro nyakago mohlala kudu hwetšwa wepe khutlo kgatišo oketšegilego nyakega maswao mafelelong html fila bjoo yo tswala sephuthedi senotlelo ngongorego morumo filthara fetoša feta sekgokaganyi ProductName pejana tšhupane šome molaodi methalo mehla leleme khoutu dipelaelo akaretša tšhomišo nomorofatšo nnete lekanego theko šetšego ponelopele mohlotlo Microsystems mathomong dikarolo bokgobapuku none ngwaga mabapi kopanyo kgona generated Fofela ditokelo database bonyenyane Automatically xml tsejana palomoka mollwane lentšu elela dithulusi y tokumenteng seripa sekwere rekhoto poledišano molaetša lepokisi ikopanye hlakantšhwago dumelela Word tlhaloso thekgwe thea phapano lengwe kopiša koketšo fošagetšego copyright vor tokollo šuthiša Netefatša mohola tsepama tlwaelegilego mehuta leboelela filwego diaterese tswalo saese nyakegago mpshafatša laesense hwetšagale ela ditirišo ditafola dipalo dimakhro yago thalela StarDraw reka Pilot OLE mellwane matšatši lomaganyo laiša hloko faeleng dikgoba dikerafiki dika dibopego bolela beilwego Windows tsa thata StarImpress šomego rapama pdf mothalading maboleng Letšatši-kgwedi inc difonto bogare tsentšhitšwego tikologo swana seberekišwa lefeela kgonege kgale International fetolela di-template dikrii botlhami writer tsenywe tlatša tisiki selaete sekala palotlalo ODBC n morithi mananeo kgaola Id fetša fetotšwe dirwa bohlokwa bile temošo ngwadiša moriti legoro inthanete hlalosa godiša dithoto ditaba dikologa c Yuropa tsenyo tiragatšo swanago someng sephuthelwana sampolo noši nonwane MS modumo mmepe mebala konope kgethegilego kgakollofase Import Hangul draeveng ditšhupetšo dihlogo DDE calc tekolo Sql setšhaba sengwe seke sediko SeArapo PowerPoint paletšwe motho lekanya lapeng kgotle kgokaganyo kgokaganya dirolla dirišwe boso bobedi tšwele tshupane thuša tekanelo phagamego peeletšo no Naa mopeleto kopantšwego kgontšha JDBC dirišitšwego dikološa botseno boripana tlhatlamano tima thapo sethalwa se-China re nomora moutu mošomiši moabi mediro lenaneothero lekantšha khii hlopha hlogwana Export dutše ditaolo thaetlele swaya StarWriter StarCalc sematlafatši segolo seatla lengwalo kgaoga itšego gae fekse eya ditumedišo dipoelo CorrectSpell botlalo bolokwe bašomedi baka arola amogelwa web tšwelela tšona tsenye tšeela tlhalošo šomišwa pontšho phetolo phatlalatša okeditšwego ntšha mothalwana mašakana lefesetere lebelela konopi kgonthiša kgonego kelo katlego gobane FTP eupša ditlamorago butšwe boletšwego boithekgo bjang aowa tlwaelo tiilego thoto taba šireletša seswa SeSpanish Seisemane potšišo phokotšo neteweke mpshafaditšwe mongwe mongwadi matseno makhro letetšwe lebantšwego kgwedi kgokaganego kgaolo hyperbolic galoga ERR ee diteng dirilwego dintši dinako dikhutlo dikgwedi dife bolokilwe bofefo boeletša bewa tšwago thekišo Solaris s ruri rekoto polelo phapogo pedi morulaganyi moamogedi macro mabaka lefelong khansela khalendara kgopolo kgopamiša impress hlokomologa fetolelwa fetleka dinthokolwana dihlopha botee boitirišo bodikela base abela tshwantšho Tsepanya tšea tlago thulaganyo TemplatePath setatamente serapa Own nkgokolo Mogala matlakaleng lerungwana lekanela laetšwago Kgapeletšo godingwana bulwa bogodimo boela bego XX uno tlhago tlhaelo Thulusi thongwa thibelwa thekge thapalalo sekorola sefetleki phesente nngeleng ngwadišo mphato moswa morero menu matšatšikgwedi laeditšwego kgwebo kgethe JRE ipiletša hwetšwe hwetšwago fomo fokotša fax efe DOS ditlhakakgolo ditemana dipampiri de bonagatša bonagala bézier anega all v tumelelo tšwelapele tshepetšo tshepedišong tsebjego tlwaelanya Tlasana tiišetšo Tiiša thomiša swere šireleditšwego romelwa rights reserved r pukuntšu programa ponagalo poelo pharologantšho nyako nolofaditšwego naga mola minimamo Mehlotlo mathata mangwalo Lenane lege kopanywa kgahliša katišo ithekgilego iša hlaloša gamma felela emiša elemente ditirelo diregile dibara bogareng aroganya Apple ala tswaletšwe tšhupetšong tlošwa tirelo thipo tekano StarOffice sona setlankana sekgala saete rata ponagatšo phuthela phetha Otlolla OpenDocument Naledi mosepelo mogaleng mmagojeng mehola MB maksimamo Macintosh mabedi Maaka llaga letlakaleng lekanago legatong lefapantšhi lefa laola laišwa kapejana i gatelela gana etšwa ema ele ditšhupo Dithempoleiti dirwe direkhoto dikarolwana difomula DataPilot bulwe botala bona bolokilwego Bit bapetša badiriši z vnd tshwanelo tšhumile tšhuma tsepanyo tšeelwa tlwaetšwego tliša tlhamo timilwe thome thekga stardivision Speech setšo setlwaedi Sete sešupo senotlelong sekamiša Ripa rekhota Products popego phethilwe pharola pepeneneng MySQL mošomong moragonyana melaetša mehlala matsogo magomo logarithm letelwago Lernout lekanyetša khomphuthara kgonthišegile kgethwa kgato hwetšagala Hauspie galase fomata fapana ditsenywa ditseno dirišwago dikwere CJK CD bušetšwago boemong bar akhaonto yuniti XSLT tswalano tsentšhitšwe tseno tsebjwego tokelo tletšego tlatšwa timile thesaurus thepe thempoleiting tafoleng t swanela swane šomišwago software Setsenyi sešupi sešo Sekgomaretši ratwago putlago putla phokoletšo pampiring nyakišišo Mozilla moleko mokgokaganyi mohlomongwe mmogo maswaodikga mahlaodi linear lemoga lekolwa lefsa lebelo kopolla kišontle kgobokeditšwego ingwadiša hlophilwego dumelelana draw ditlhaloso ditiro dirwago dirapa dipoledišano dipatelo Corporation bophagamo binary beta beilwe BASIC balwa area ama u tšwe tšhelete tsentšwego TMP tlošwe timetše thomelo šutha setsopolwa setifikeiti Segerika searoganyi sampole Potleng phetošo phetolelo para office nyakišiša nyakile nnyane ngwadišitšwego ngwadilwego netewekeng motšule mo sengwalwa modulu metsotso metriki methopo mangwe leke lekane lebota lebakanyana kua kopana khutlonne khataloko kgomaretša kgokolo kgauswi kaonafatša kamoo Inso hweditšwego hlangwa hlalositšwego hlahla Hanja goteditšwe gabotse fetolwa fedile ditšhate ditsela ditlhagišo diswari dirišetšwa diragatša diphuthelwana diphetolo dipharologantšho diforomo diforeime dibeke des bopše bophelo Boolean bokantle bitmap beke amogetšwe abetšwego Zip tšhupaboteng tsentšho tseneletšego tse Tlwaetša tlhakakgolo Tlhahlo tlatšo tlaleletšo thwii theogela tesimale teko talalerata taga Swantšha Setsemeledi setlankane sepelelanago Sejeremane Sefora sefahlego sediriswa rula ratago phumulwa palogare palediša nyakwa ngwageng mosepediši mmalwa mm matla makro Maikemišetšo logo lephoto legodimo Lapološa kopi kgonthišetša kgoboketša kgaotšo kgaoletšo kgakollo kgabaganya hweditšwe hlokega gatee ganyenyane gantši fomete FILE fihlilwego fetolwe fetolwago fetogile feletšego feditšwe fapa-fapanego F etela e-poso eng ditokumenteng ditiragalo ditaelo dirišitšwe dirilwe direkoto dire diphethogo Dipeke dibulete desimale datapeise D CR boraro bontši bonagalago boingwadišo Bohlabela Bessel beakanywa Adabas tšwelopele tšohle tshekamo tlogela tlami thaepa thaele telele Teka-tekanyo tebo swara SVsd1 Šutiša Širollela šireleditšwe sine Sesiriliki sephutheding sephetho se-Korea sekirini Seheberu Ruma rotogela Roman rena Postscript poloko polokelo phutha phaphamala patela parameter par Papišo paledišitšwe Otlologilego ntši nokelwa ngwalollo ngwadiše nepagetšego moseka moromedi mofetleki moemedi mmušo mengwaga maikhutšo lenaneong leletere Lekanyetšega lefoko lebanya Laser kwanago kwagala kopišwe kopano Khupetša khomphuthareng kgopamišo kgonthišege inthafeisi input hwetše Hunyetša hlopholla hlongwa hlomo hlamiwe hlalošitšwego hlalosago hlakantšhwa Galogiša fonetiki filwe fetotšwego fetišetša et emelago eksponente dumeletšwego dumelelwago dumelelanago dula ditekanyetšo ditefo ditatelano dirago dipiramiti diphošo dingwalwa dikološitšwego dikoketšo dikgokaganyi difomate dielemente didatapeisi dBase cosine com chi bošweu Bora bonolo bongwe boloke boikgethelo bj bega Basepediši baamogedi Asia arogantšha Ankora amogetšwego afe www wena US tumelelano tswalanego tswa tsošološo tshetla Tsepanyetša toropo tlemilwe tiragalo thuto thomago therešo theoša tharollo tangent Šuthišetša šireletšwa Setseka Sethomi sepetša senyenyane senyegile Semolao Selatin seka Sejapane sehla sefetodi searodi runyela romelwago Rategago Potlakišago ponego poledišanong phokotšego phethagatša Phaya pelaelo patrone OS Oracle oketše ofe nyakwago nthokolwana nthokolo nolofatša ngwalwa nakwana motsotswana motsotso mothopong Mošongwana mollwaneng mmele mmagoja mesebe mesaeno mebedi math master Marungwana mapi mantši makgobapuku maemong lona lomaganya lomagano lokolla lepokising lenyenyane lelokelelong Lehlakore legotlo lefe kwano Kiriti khwetšo kgopelwa Kgopamišitšwego kgethilwe kgethilego kgatello kemišo KB kabelo ikhutša ii hlokomela hlahlela gwa fometa fetogago explorer eletšwa dumelelwa DPI dll ditsenyo ditokomane ditikiri ditemošo dišupo diriše dipego dinageng Dikhouni dikgato digatiši difonte difilthara difila di-cookie diberekišwa diabi DD bule bontšhitšwego bokgole bokaalo boitiriso Biti Bipolla bibliokrafi bapetšwa baotledi bao baagi b and ananya aga Access wona tumelelanong tšwetša tšwelelago tswalanago Tšhela tsenyago tsentšhitše tsebjwe tlošitšwe tloše tlišwa tlema Time thumo theoga theilwego thapamo Temogo taetšo taetšaletlakala Šuthela StarMath šira sethiki Sepotokisi Senepe semeno sekorolo sekema Sekamišetša SeChina se-Bengali SeAsia romelwe putswa projeke profaele ponegelo pogelo phihlelelo phethwa pharamethara Phaelote PC palophatlo p ofisi of octal Ntshofaditšwe ntšhi ntšhetša notlela nepagalago mouse motheong motheodifiwa mosela morekiši mogolo metsotswana mekgwa mediya matlotlo malokelelo makatšago magato Mac maatla maano lomagantšwego lokile leinaphetišo legolo lega lefago lebiša lebilego lebato lebaleng lebakeng LDAP lahlega Lagojeng laetšago kwagalago klipiboto klipiboroto Khutlotharo Kharensi khamphani kgolwane kgoboketšo kgatelelo katišani kala kae is iri inthaneteng Internet India ile ikgokaganya iii Hlola hlokegago hlaola hexa gatišitšwego fošagetše for filter FIELDNAME fetošetša fetolelwago fetago fapantšwego fana fa Env enfelopo Electronic efa Dumela ditshenyagalelo ditokollo dithušo diteko disk diphapano dipeeletšo dipalopalo dinyakwa dikonopi Dikološetša dikarata Dikala cookie contangent cm bušeletša bosephiri bopilwego bopilwe bontšhwa bonnyane bone bonagale bolumo bokagodimo bohubedu boa bjona beakantšwe bapetšago balege bala-feela Audio ARG2 app akaretšago YY XP woo Weibull w Var VALUE utamilego tšwetšopele tšwetšego tšweletšego Tswela tšhutišo tšhologa tshehlo tsenwa tsentšha tsenela Tsemeletša Tšaka tletše tlemaganyo tlanya tiišetša thušago thongwe thekinolotši theilwe tebelelo swarwago swanelegago sv StDev src source šomišwe Šomišwa-tlhathollo SMTP šielanago Setoko serolwana Sepediša selete selaetši sekhutlo sekgokanyi sekgaoganyi Sefane sebadi seabelo ruby RTF rilego rekilwego pv Poelo-morago poelomorago poeletšo pi phumolwa phaphametšego Papetla pako Paelote padile Outlook otlela Nper nolofaditšwe Naletšana mpshafatšwa mothalong Mošomoši mosaeno morago-rago mong moneelo monagano molao modirisi modirelwa Mmetse MIME metswako meta mešomo memmepe Maswaopuku Marontho maletere mafesetere m lokologilego lokišwa lokišitšwego lokiše log LF letsogo letšatšikgweding letlotlo lereo lerei Lentšuphethišo leloko lekwa lekelela lefasetere leemaema learogi latedišiša laetšwego kwana krite Khwibidu khwaliti khesara kgopamo Kgopama kgontšhitšwe kgethile kgafetša Kamano iwago išwago in IIS hwetšagalago HOST hlongwe hloka hloba hlaolago hlame Hlakola histori griti gatišitšwe Galogela foromong fokotšega filimi fetilwe feteletšego fegelwana fedišwa fapantšha fao emetšego dt ditšweletšwa ditswalano ditokišo Ditekanyo diselaete Dirisa direga dipotšišo diphikisele diphahlo dipalo-palo dipalomoka dinotlelo dingwadiso dikologilwego Dikhii dikgokagano dikgobana dikgaoletšo dikatlego Dika-dikago dijithale diintši dihlogwana die-meile didiriswa di-degree CTL csv boyo botwago bosese Borwa boreledi bontšhago Bonelapele bolokologi bokoto bokaakang bofilwego Bofase bitšwago bitša bitimapa beeleditšwego beakanye bapetšwago bapetšego balega baenari atiša Areka amogelwe amanago alpha Alien abjwa YYYY yoo xlt xl WinWord wepeng VBA VarP Tsopolwa tširoga tšhireletšego tshesane tsepamo tsentšhwa tsenelano tsenago tsebje tsebiša trademark Tous Topa tokologo Tokišetšo tm tlošitšwego tlogo Tlhakatlhakano tlhakantšho tlhahlelo Tlemo tle Thunderbird thomološa thibela thewe thebe Technologies tebišo TARGET SVsa1 šuthišitšwego StDevP StarRealtimeClient StarDrawDocument Star Spline skena širolla šireletšegilego Silintere Se-Turkey Setswana seterata Setaka seswari seswantšhong seswantsho seswai se-Swahili Sešupanako seriyale sepelelana SELECT šele Se-Kurdish sekhwi sekhwama Sekgotlwa SekaSediko Sehlogwana Segopotši Sedikadikwe sebopegogare sebaka Se-Arapo Saesa saennwego rulaganye rot13 rometšwego romele ripiwa ResultSet réservés renke regression Raragantšha raragane Raragana qui putlilwego pot popafoko Ponya-ponya Ponong polygon Poisson Pocket phumutšwe phumolwe Phoso phopholetša Phopholego phetšhe Phetlela phethagatšwe phethagatšwa phethagaditšwe phaphašo phaphaša patelo Palelo Pakane packed Oterro open okeditšwe OEM Nyakela ntšhitšwe npery nna ngwadišolla Ngwadiso ngwadišitšwe ngwadilwe nete nea mpshafatšwe mpale motšweletši moswari moswananoši Moswai morumong mollo Mohumagadi mmapa methalwana merero meneelo Memojulo megato Medu Matšatši-kgwedi mathoko matee marques mareo makga maiteko magoro Mafapantšhi lomaganyolla lokišetša lokeleditšwego Linux Leporogo lekanyetšwa lekanyeditšwego lekanetšego lekanelago lebišago lebakana latela lahlegelwa laetšwa koto kopišwa klika klase khupone khophi khona khomphuta kholomong khiiboto Kgoromeletša kgorametša Kgopamišetša kgontšhago kgonega kgonagalo kgokolong kgokagantšwe Kgethwego kgethega kerning kelohloko kelelo katološa Karodi karata karabo kantle Kamoka kalo kabo ithekgilwe ithekgile išago io InsoCorporation ini IDyaPeeletšo HTTP holofela hlamilwe hlamago hlalošwago goga Gnome giriti gatišwa gararo gannwego flash fihlilwe FIELD fetišetšwa feletšwe feleletša feditše fedišitšwe fediša fasana Fapanya est eps emetše emeile Elipise elego dumeletšwe dumelelwe droits doka Ditshwaro Ditšhupu Ditšhelete ditsejana Ditlhahlo ditekanelo dirollwe diragatšwa diprojeke Dipitšo diphuthedi Dipharamethara diparameter Dinkgokolo dingongorego dilomaganyo dikgokanyi Dikgakollo dikete difaeleng didijiti diayekhone diaroganyi Default datapeising cotangent correction CDE botse botša bopšwa bopša bope bonagatšwa bonabo bolokwago bolelago bokamorago boingwadišong Boima bogolong bodiba binomial beiwa beakantšwego batho bapala bago baabi ayekhone aux atišwago Aretša Arc applet alfabete Alfa akareditšwego afm ADO Zipi Yaka website watšwetšopele usr usa URL1 Unix txt Tumedišo tswalelwa tswalelano tswalanong tswakilego Tswaka tsošolotšo Tsošološa Tšhweu Tšhupadikagare Tshedimoso Tšeometri tsenywago tsentšwe tseneletše tsenelelano tsenelela tsejwego tsebiwe Tšatšikgwedi Tolara tlošo Tlhopho tlharologago Tlhakanya tlhahlamano tlhagišong Tlhaelediša Tladitšwe tirišong timetšego tiišetšwa Tiile TIFF thomišwa thomilwego thomilwe thomile Thibelago thekontle thekgwego thekgwago thekgwa thaepe thabela temaneng Tala-morogo-lerata talamorogo taetši tab Taamane Switzerland SWF swerego swantšhe swanetsego SVsc1 šuthišitšwe Šupetša StarImage StarChart SSL SPARC šomišitšwego Sobeletša Ševerone setlogo Se-Thai seteginiki Sesotho seripagare sepetšwa Sepaniši senyegilego Sengwalwaboitirišo sekoloto Sekhupetši sekgomaretšwa Sekgobana seipone Sehlophi Seetša se-Dutch sedirwa sediri Se-Baltic searogantšhi SDBC samorago saennwe saenne saena rulaganyega rometšwe rekwa rarollwa rarolla RAM Radiyase radians radian ra pukutshwayo protšeke potego popofoko Pontsho pompi pitšo phumotšwe phuhlama phophoma pholisi phethwe Phethogo phethagetšego phefa phatlalatše Pearson Peakanyoya patente patelwago papatšo Palopatlo Palette paledišwa pakollwa pakolla pakilwego OUTFILE Otlolotšwe oketšwa Ofising nyalelane nyalelana ntšhwago ntshofatšo ntshofatša Ntsho nthetelego notletšwe nomorofatso nkgokolong ngwagamolele ngangišano network Netscape namune namelela Itokišeleditše mpshafatšo mpshafaditšwego Motswako Motomo motheoga motelele mosekamo mosehlwana Morena Moreki monwana Mongwalonyane Mongwalokgolo monei Mojulo Mohuta Mohuta mogatong mogare mofsa modu misc methopong Metheoga metheo methalong mesese mesesane menyu mentši Matswalo matšatšing manyenyane mantšuphetišo mang maleme maleba maks Madulo Macromedia Luxembourg Loop lomagantšwe lokišwe lokišeletša Lokilogilego Lokela loke LetšatšikgwedileeRekilwego Leswaopuku lesome-tshela Leputlo lekolwago lekelelago lekanetša leihlo Lefastere leamanyi Latin laolla lanngle Lanngele-Tlase Lanngele-Godimo lambda lahlegile lahlago lahla Lagoja-Tlase Lagoja-Godimo Laeta Kwantšha kwane kwanantšho kopantšwe koketšo-itiriša klipiborotong kitimiša Kimollo Khaontareng kgothaletša kgorametšwa Kgonthišiša kgonegago kgonagale kgokologela kgokaganywa kgoboketšwe kgethotee kgethopedi KgethaKa kgethago Kgethagatšo kgaotšego kgaoseditšwe kgaolwa kgaoletša kganya kganetšo kgahlišago Katološitšwe Katoganya katakana Karolwana Kapi kanale kamogelo kai JIS itokišeletša ISO iše Išantle intemete hlomilwego hlokomelo hlangwe hlamiwa hlamilwego hlalositšwe hlalosisitswego hlalošišitšwe hlakantšhitšwego hlahlelwa hlaelelago hiragana Hid gotee gongwe gogela goema Godišetša geometri Franc Foreimetebanywa fomateng fokoditšwego fokoditšwe Fisher fihlela fetšwa fetole fetogego fetoga fetile felelago Federal Evolution euro etetšwego eta Esego emišitše Elipsi draeve Domain dlg di-URL ditumelelo Ditšwetšwopele ditšhišinyo ditomotsebe ditlhatlamano Ditlhaka-kgolo Ditla-morago dithipo dithepe dithalwana ditatamente ditaollo disiki diselaeteng Disekmente dirišana diragetše diragaditšwe Diponagalo Diphopholego dipharologantsho dipeakanyong diparametara dipalomokanyana diotara dinoko dimodulu dimakro dimacro dikopi dikologwa dikologago dikgonagalo dikgolo Dikgobeng dikgatong dikerafo Dikema diinišiale di-ID difetodi Dif diega dialogs dialog DEFINEDVERSION DEFINEDPRODUCT Cyrillic clipboard Clipart Canada by butšwego bušetšwe bušetšwa bulegile Botlhakanyane Botlase botlalokgolo both Boteng Botebo Botala-morogo Botala-legodimo boswa Boroto boputswa Bopgare bopago bontšhwe bontšhwago bontšhe bonnete bonala bonagatšago bolokwego boloko bolokile bokotokoto boikgopolelo Bohwibidu-madi Boemakepe boeletšwago boditšhaba-tšhaba bobolokelo bmp Biff5 bidio Bevele Belgium bedi beakanywe beakanyetšwa batšweletši bapelanego Bangladesh balwe balwago Balela balanna baemedi Babuši atišwa arotšwego aroganywa ARG arctangent application AportisDoc amogele amegago algebra alfanyumeriki akaretšwe akaretšwa Ai Agente Aekhone Acquisitions accessibility abelwago Zoomela zi zeta Zealand x-starimpress x-stardraw x-starcalc XLS50 xi wisateng WinLatin win wepesaeteng wepesaete Volume video VER VCL utolotšwego utollwa utamego upsilon Unicode une un UI tswetšwego TšweleditšweKe tswalwa TswalaeHweditšwego tswakwa tswakilwego tsopolo tsopola Tšokotša Tshwayatshwayo Tshwarofelo tshwaro Tshwaelo tšhuana Tšhipi tshielano Tshetledi tshesanetshesane tshepa Tshela TshedimošoyaPhepo Tšhalelo tšerwego tsenyege tsenwe tsentšhitšego tsenege tsene tšeetšwe tsebišong tsebišo2 tsebišo1 touchpad ToropoyamoeYago Toolbar tomaganyo Tobetša Tobeletšo tlositswe Tlosa Tlolela tlo tlišo Tlisa tlilego tlhokomelo TlhalosoyaTiragalo TlhalosoyaProjeke tlhalošišo Tlhagiso tlemilwego tladitšwego tirišano timeletše timelela tiišo tiers thušong thuše Thumelo Thomisalefsa thlaelelo Thipego theta Therei Thel ThekoyagoRekaRekiša ThekoyagoReka theknoloji thekema theipi theelwa tharo Thapalola thalwe thalwa Thaletšwe thalelo ThaetleleyagoIkgokaganya TGA Telnet TekanyoyaTefo TekanyoyaSephuthelwa TekanyoyaKholofetšo TekanyoeTšwetšegopele TekanyoeNtšhitšwego TekanyoeDirišitšwego TekanyetšoyaSekoloto TekanyetšokaIri Tekanyetso tefo TefišoyaTirelo TefišoyaMorwalo TefišogoyakaMotho technologie tebego tšwela tau tatelanong tate Tala Taetšathoko swayolla Svx SVG šuthišetšwago šupeditšwego šupa Sowivela sont šomišitšwe šomišago šomela sobeleditšwego sobeleditšwe so šitišitšwe Šireletšwago sigma Sidikadikwe SF SeUzbek SeUrdu setopo setlabelo Se-Tibetan sethuši Sethomiši seteišene se-Tamil Setaliana SeSwedish Seswayi sešupetši se-Slovak SeSerbian sesane se-Russia Seroma Serepudi Sepolaine sepetšwe sepelwago sepelago Sepela Sepeke sentšwe SeNorway sengwalweng sengwalwana Sengwala SeNepali sendmail semenya SeMalay Sellathekeng SeletesaNagasamoeYago Selekanyo selaeteng Sekotšho Sekorolela Sekopanyi Sekolo Sekhutlwaneng sekgetho sekgahla Sekatshepedišo SeKashmiri sekama Seithali Seiši Se-Iceland SeHolanere se-Gujarati segologolo SeGeorgian segatišing sefonetiki Sefiwa sefere sefe sedirišweng sedikong SeCyrillic se-Croatia Seburu sebudi Sebapadi sebakeng seabing sdp sdi Šarakanywa SAR Sans SANE sampoleng sammaletee salvage ROWNUM rotošwago root RometšwegoTšwa rho restreignent resource res REPORTFORM relative rekiša rekhotong rekhotilwego Rasterfile Radio radins quartile quantile python Putlela pušetšo pušeletšo pukwana pukuntšung PTNUM psi protégé program ProfenseyaNagayamoeYago praebete PPT97 poroutšhara poraefete popopolelo ponya poly polokong polices polatefomong PM platefomo pixel Pitch phumulega phumotšwego Photo-CD phošollwa Phošolla PHONE Pholigone Phifatšo phi phethe Phethagatšago Pheteletšo Phepolo phenšene phefoga Phaye phapoši Phalete Phafogela phaephe Phae phadimiša phadima Perl Penta pelo pegong Pedifatša peakanyong PCX pays Pastei Paralleograma Pane PaloyaDisolwa PaloYaDinepe PaloyaDikoša PalomokayaTekanyetšoyaSekoloto PalomokaYaDikhalori Palm palelwa ou otara orthographique or OpenGL OOOVENDOR online omicron Okthakone oketšwe Nyenyefatša nyake num nu ntšhwa ntše NontšhaForekwensi NomoroyagoOtarayagoReka nolofatšwa noketšwe nokelelwa nnyanennyane Ngwedi ngwalweng ngwalela ngwalege NgwagawaTokollo NgwagawaTokeloyaNgwalollo ngwadišwa NFS NEWLINE New nepo nepagetsego neng neela nanya NakoyaPeeletšo NakoyagoLokišetša NakoyagoFihla NakoEDirišitšwego nabilego mu Tloša Sephuthedi Mohuta Go msi Mpshafatsa mpho MPHIWAFEELA mpeg Motsetaphethiši motiišetši motheogo mothalaladi moswana-noši Moso mosadi MorethethoWaGoKhutša MorethethoOMogolo Morathofatšo mootleding mongwalo MonaboOSepetšwego Molwane Moletši Molahledi MokgwawaTefo MokgwawaPhokotšegoYaTheko mokgwa mokgwa Mokgatlo mokero MohutaWaTšhireletšego MohutawaKaratayaSekoloto MohutaWaGoItšhidulla MohutawaDitshenyagalelo MohutaWaAkhaonto Mohlare mohl mogo MogatoWaGoOtaraGape moelo Modikelelabotlalo methalading mesela Meratho mephato menyenyane Menotšwego mengwe Mekgoko meetse mebolelwana matrikse MathType matelele Mašakanathotana Mašakanabora marque Mark mapatlelong mantšung mangwalong mananeong mamaretša maloko makopanyi Mahlakore mahala magorwana magolo mafolofolo mafeela MaemoATefo MaemoAGoBaLeloko Maele macros Mac-Pict Macaulay mabakeng maarogi l'utilisation Ltelago Lotus Loma lokollwa lokollotšwe lokišitšwe lokišago lokisa Lokeletša lokarithimi lokafatša lokafaditšwe LOGICOPERATOR logiciel lingu LIKE licencié licences lib letšibogo letšatšing LetšatšiNako LetšatšikgwedileHolofeditšwego LetšatšikgwedileeTšweleditšwego LetšatšikgwedileeNošeditšwego LetšatšikgwedileeHweditšwego LetšatšikgwedileeBjadilwego LetšatšikgwedileeBeilwegoNakong LetšatšikgwedileeBegilwego LetšatšikgwediLaTefoYaTšeKolotwago LetšatšikgwediLaTefoYaKholofetšo LetšatšikgwedilaTefo LetšatšikgwedilaPeeletšo LetšatšikgwedilaLenaneotheko LetšatšikgwedilaLehu LetšatšikgwedilagoThoma LetšatšikgwedilagoRekaRekiša LetšatšikgwediLaGoItšhidulla LetšatšikgwedilagoFihla LetšatšikgwedilagoFelelwakeNakogaKaratayaSekoloto LetšatšikgwedilagoFelelwakeNakogaFilimi Letlapa letetšwego LeswaoLaTšhireletšego LeswaolaRekhoto lesedi Lešakana lepelela lepatlelong Leotwana Lemoša lemogwe Lemogwa lekotšwego Lekopanyi lekole lekile lekanyeditšwe lekantšwe lekanele LeinaLaTšhireletšego LeinalaProjeke LeinalaMophatlalatši LeinaLaMokgatlo LeinalaKhamphani LeinalagoIkgokaganya LeinaLaAkhaonto Leina-kopana Leinakopana Lehono legotlwana legorwana Legorong lefša LefeloleeRekilwego LefelolaOfisi LefelolaGonabjale LefelolagoItlwaetša LefelolagoeLata lefasetereng lefapha lefapanyi lebišitše Lebelolašathara lebelelwa lebatong lebanego Lebane leago latelana lapile LaMorena laletša laišwe laišitšwe laeborari L kwagalo kwagal Kubiki k-th kopišitšwego Kong Kodak kitima Kišo Khwalithi khutšo Khutlonnethwii khubedu KhoutuyaPosoyaSekepe KhoutuyaPosoyamoeYago KhoutuyagoLatedišiša Khouto khouta khompo Khiinote khamera khalara khabinete kgwthilwego kgweding kgotlilwe kgorameditšwego kgopetšwego kgopela Kgopamego kgonwa kgontšhwa kgonnego kgonne kgomegago kgomaganya kgole kgokaganywe kgokaganywago kgokagane kgokagana Kgodišo kgoboketšwago kgoboketšwa kgobokeditše kgethong kgethego kgethegago kgauswiuswi kgatišotee Kgatiso Kgašo Kgaotso kganyogwago Kgakollotlase kgagollo kgabaganyago Kerafiki kemo kemelo kemedi kelotshehlo katološitšwego Katologano Karolwa kappa Kana Kama kalwa Kakaretso kakanyo kadimo kaa June JPEG joina Jenale Jan Jamo itiragalela Ithuta ISBN Iraq ipoeletšego iota Intel ingwadiše impress-packed IMAP ikopanya ikhole ikgokaganye ikgethela Iketle ikemišeditše IDyatšeodiDirilwego IDyaSetšweletšwa IDyaOtarayaMošomo IDyaNakoeKolotwago IDyaMokgwawaTefo IDyaMohutawaTiragalo IDYaMohutaWaGoIkgokaganya IDYaMohutaWaAkhaonto IDyaMohlokomedi IDyaMediroyaBašomedi IDyaLegorolaMmino IDyaLegorolaLefa IDyaKgoro IDyaKgoboketšo IDyaDintlhatšaLenaneotheko IDyaDintlhatšagoOtara IDyaBoingwadišo Ichitaro hypebolic hweletšwe HRESULT HMTL Hlwekiša hlotlilwe hlotla hlophilwe hlongwago hlolegile hlokomelwa HlokomeloeLatelagoeBeakantšwego Hlodimela Hlephilego hlatloga Hlaotswe hlaolwa hlaloswe hlaloswago hlaloswa hlalošišwago hlalošišwa hlalose Hlakatšha Hlaka-hlakanego Hlakahlakanego hlagile header haephalinki ha GPF Goso Gopola gonyenyane gontši GoKgethwagaThempheretšhara GoKgethwagaSeetša gogolo godišwago godišitšwe GoAmegagabonologaSenepe GmbH GIF geno gatišwago gatišegego Gatetšego gata garefaditšwe gannwe ganetša galogilego gabjale G fournisseurs ForekwensiYagoNošetša foreimeng font fomong Fomateboitirišo Fološa fokotšwa FM3 fiwa Finland fihlelelago fetšwe fetoletšwego fetolelwe fetogilego fetišwa fetišeditšwe fetiša fetilwego felo feleleditše felago fektoring fasefase fapanago fabrique États-Unis epsilon enngwe enkripšene en Emišitšwe emetšwe Ellipse elipse eletšwago eletša DTD Dokholomo doc DN dl Diwisate Division DitutuetšoTšeKgolo ditumedišong ditumammogo Ditsošološo Ditshupane Ditšhupadikagare ditšhomišo Ditshepedišo DitshenyagalelotšagoRomela Ditshekamo Ditlwaelo ditlhaelelo ditlankane ditlami ditirišong ditikrii ditho ditheto dithempoleiting dithapo ditebelelo ditatamenteng ditaodi ditafoleng di-tab Dišupi Distribué disiphetšha DišereTšaGago Disaese dirunyi dirollwago dirišago Diripana Dirhombus diretšwe Diresose dir dipukuntšu diprograma dipontšho diponelopele Dipolygone dipolokelo dipolelo diphetošo dipharametara Diphaphašo dipegong Dipatrone Diparallelograma dipalotlalo dintšhi Dintlhanyana Dinaletšana Dinaledi DimiligramotšaSodiyamo dimetriki dilemogi dikopnelo dikopanyi dikološwa diklase dikhona Dikhamphani DikhaloriTšeFišitšwego DikhaloriGoYaKaSesola Dikgopamišo dikgaotšo Dikgaolo dikgakollofase DikgahlegoTšaMolekane DikgahlegoTšaBaoOKaIkgokaganyagoLeBona dikemišo dikelo dikarabo dika-palomoka dikamano dikakanyo dikadintlha DiiritšePatedišwago DigramoDiproteine DigramoDikhabohaedereite diforeimi difomo diegiša Didiko didijithale didesimale di-database dibiti Diatrese diataerese dialfabete détenu Desktop DepositaTekanyo déposées déposée delta DB d'autres datefunc Date dans cursor Currency COUNT core control connurl Connectivity config comprend component Commercial classes caractères cache bušwago bušeditšwego buša Bulete bulegilego Botšhaba Botseka botsebi botlhakakgolo botho Botelel botegago bosekete BophelobjoFokotšegago bonwa Bontsha Bontša bonnyanennyane bong bonalago bonagatšwe bonagaditšwe bolokilego bolokela bolokegile BolengbjoLekanyeditšwego BolengbjasePhološitšwego BolengbjaGonabjale bolelwa Bokgopapuku bokgoni bokaone boitshwaro boitsebišo boithaopo BoimabjaSephuthelwa bohle bohlatse bohlale Bogomo BogolobjoBeeleditšwego Bogale bog bofsa bofelo Bofefe boetšago BoemoBjaLenyalo boelng boeletšwa bo-4 bo-3 bo-2 bitšwa bin Biff8 bewago betha begwa begilwego beeleditšwe bee beakanyetša Bapela bapa bangwe Bangwadi bakwa bahlami BahiriwabaNyakegago B6 B5 B4 Azerbaijani AutoCAD Austria atlegile AtereseyaSekepe AtereseyamoeYago AtereseYaEmeile at ASCII arolwago arogantswego aroganego arogana arcsine arabela araba amanya ALPS Alkorithimi akgofišwa akaretšego akaretše Akanya Afrika Adobe activex About abetšwe abelanwe abelana aba AAA AA A1 Zumu Zumo zu ZTEST Z-Soft zoom Zimbabwe Zhuyini ze YYYY-MM-DD YY-MM-DD YX YURO YunitiyaNomoro Yunibesithi yo-on Yn YIELDMAT YIELDDISC YIELD Yi Yemen yekhwi YEARFRAC YaTšhupetšo YaTšhireletšoyaSelegae YaTšheke YatšeodiDirilwego YaTiišetšoyaKaratayaSekoloto yapampiri yaMošomedi yamorithi YaMogalayaSekepe YaMogalaWagoSepelaleWona YaMogala YaModele YaKgatišo YaKaratayaSekoloto yagrid YaFekse YaBarkhoutu YaAkhaonto XYZ XY XStorable xsltfilter xsltdialog XSL XRowUpdate XResultSetUpdate XQueriesSupplier XPM Xor XNPV XLS80 XLS40 xls XIRR XHTML XDarwin X11 wrtsh WordPerfect wizardname wiše Wiša WinWord97 Winword6 winexplorerext Windows-Johab-1361 Windows-950 Windows-949 Windows-936 Windows-932 Windows-874 Windows-1257 Windows-1256 Windows-1255 Windows-1254 Windows-1253 Windows-1252 Windows-1251 Windows-1250 wildcard WHERE wepesaeteYaka Wela Weierstrass WEEKNUM Webtop wa-web Watšhe wathekontle wašomiša wago W4W vyu VRML VLOOKUP VIM viewer view via Venezuela vektoro VDB vCard vartheta varsigma varrho varpi varphi VARPA varepsilon VARA va utolotšwe utolotswe utollegego Utolla utlui Utilwego UTF-8 UTF-7 Uta USERNAME Uruguay URL2 unset Union undo UK uiview UId UAE Typography type twips twip TWAIN tva Turkey Tunisia Tumelano Tulothwii TULO Tthalathala TTEST tšwilego tšwewa tšwetšwa Tšwetšo Tšwetšapele tšweletšwa Tšweletšo tšweletšeng Tswelela Tšwelego tšweleditšwego tšwelago tšwel Tswantšho tswanelo tswaletswego tswalelwe tswalelege tswalele tswalege tswalane Tswalana Tswakanya tšupetšo Tšubutla Tsotho tsošwe tsošwa tsošološitšwe Tsoša tsoma Tsogo Tsoga tšofala tsi Tshwayo Tshwaya tshwaotshwao tshwao tshwantsho tshwantšhišo Tshupetso-phapantsi Tšhupetšopatlelo tshupetšo Tshupetso tšhupetša tšhupanekgolo Tshupaletlakala Tšhupaditeng Tshuma tšhollwa tšhišinyo tšhireletso Tshireletšo Tšhirego Tšhinyego Tshetlelo Tshese Tshepelo tshepedišomohola tšhentšha tshehla tšhateng tšhaša Tshaeno tšha Tsepelelo Tsepanyeditšwe tsepamišitšwego tsepame tseokeditswego TšeodiDirilwego tseo tsenywatirišong tsenyegago tsentšhwe tsentšhong tsentšego tsentše tseneletšo Tsenelana tsenega tseleng Tsejaneng tšeiwago tšeiwa tšeetšwego tšeelwago tšeele tšeelago tšee tsebšo Tsebo tsebjwago tsebišoY tsebišoX Tsebegago tsebega tsebagatša tseba tšeAmogetšwego tšeago tSaennwe TRUNC TrueVision true Tristate Trinidad TRIMMEAN TRIM TREND Trei Trapezoid TRANSPOSE TOTAL Torus ToropoyaSekepe Toropo-kgolo toolbox toolbars Tomeine Tološetša Tološa Tokumwente Tokumente Boemo tokomaneng tokomae tokologoyaditikiri2 tokologoyaditikiri1 tokologoyaditikiri tokišoy tokišox Tokišeletšo Tokafatšo Tok tobeditše Tlwaetšo tlwaetšego tlwaelegago Tlwaelanyo tlwaelanyago tlwaelane tlošweng tlošwago tlošege Tlola tlogile tlogetšwego tlogelwe tlogelwago tlogele tlogago tlišitšwego tlišitšwe TlišaLetšatšikgwedi tlile Tlhokatekano tlhoba Tlhlokomelo tlhaolo tlhamego tlhalošwa Tlhalosantšu Tlhakantšha Tlhakakgolofatša tlhaka-kgolo Tlhahlong tlhahlelong tlhaelelelo tletšsego tletsego Tlerola Tlemolla tlemelela Tlemano tlemaganya Tlatšwe tlatšwago Tlatšotirišo tlatše tlase-lanngele tlase-lagoja tlamo tlamiwa tlamilwego tlama tlaleletša tlaleleditšwego tlala TITEL tisikithata tisiking TIS-620 tirili tiragatšong TINV tingwa timelwe tikrii tiišitšwego tiišetše tiišeditšwe Tibetan thutong Thupalalo Thunya Thumomoka thulana Thothomela thopo thongweng thongwago thomološwe thomišwe Thomišo thomilego Thomelontle thomelantle Thololo thokong thobego Thlagišo thkong thibetšwego Thibetšwe Thibelo thi thewago thewa thetha Theoleswa Theo thenkgollwa Thempoleti thempoleitiyaLenaneotherolaka thempoleit thempholeiti THEME Thelela thelefomo ThekoYaYuniti ThekoyagoRekiša Thekemiša Thedimoga thebula thebo Theatlele Thealeswa Thapolola thapalatšo thalwathalwa Thaletšwego thadilwego thabula Thaana textconversiondlgs teteano testtool tesekeng Teseke Tenya Tempolete Tempoleite temošoya temana2 temana1 Temaa tema telefaditšwego tekusuto tekolapejana tekisuto tekemišo TekanyoeLefilwego TekanyoeKolotwago TekanyetšoyaThekišoyaDithekišo TekanyetšoyaMotšheloyaDithekišo tekanyetšoyagobeeletšagape Teisi tebanywa Tatelao Tatelano tatelanonyana TARGA Taodišongwalo Tanzania tantšwe TANH TAN Talamorogo-talalerata Tala-morogo-putswa Taiwan Wisate Tagbanwa Tagalog Taetsi Taetšatšhupane tše tabledesign table tabeng Ta Sekgotli Sekgoba T2 T1 Syriac Syria Synaptics Sylk SYD sxc šweu swekere Sweden swayilwego swayile swaye Swayasway swayapeakanyo Swarwa Swaregile sware swantšhwe swantšhwago Swantšhitšwe Swantšhanya swantšhago swanetse swanelwago swanelegilego swanelega swanelago swanelagago swaiwa swailwego swaile svxlink SVXB svdraw Šutišetša Sutisetsa šuthišwe šuthišwago šuthišwa šuthišetšwe šuthišetšwa šuthišega šuthile šuthego šuthago Support šupetšwago šupetšwa SUNWzlib SUMXMY2 SUMX2PY2 SUMX2MY2 SUMSQ SUMPRODUCT SUMIF SUBSTITUTE styleui stw STEYX STDEVPA STDEVA STD stbctrls STATTYP STATEMENT statbar statamente StarView StarOfiice StarObject StarFrameSet StarChannel StarCalcDocument STANDARDIZE Ssc1 SQRTPI SQRT SQL92 Spanish Spain SP Sowivele sotfware SORTMODE Šoro SONTAGA Šomišwa-tlhathollo5 Šomišwa-tlhathollo4 Šomišwa-tlhathollo3 Šomišwa-tlhathollo2 Šomišwa-tlhathollo1 šomišetšwago šomišege šomiše šomilego soment SOLK sokuon sohle SOCKS šoa šma SLOPE SLN skrini SKEW skenwa Šitšwe šitišwa Šišinya šišintšwego širwa širilwe Siriliki Siria Sireletswe šireletše Sireletsa širega Sinhala SINH Singapore Sindhi Sinaptiki SIN šila šhomišo Shift-JIS shells she share SHA1 SGML SGI Sfx sfwk SFP Sezulu se-Zulu se-Xhosa SeWestern Se-Welsh se-Vietnam se-Venda Seutolli SeUkrainian Se-Ukrainia setup SetšweletšwasakaLapeng Setšweletšwa-mmogo šetšwe Setswaledi Setsošološi se-Tsonga setšhabeng Setsenywa setsekana setsego setse Setšatši Setrata SetokoSaDiyuniti Setilwe Sethokgwa Setho Setemere Se-Telugu Setegniki Setebele SeTatar Setalisana sešweu se-Sweden se-Swazi seswanšho Seswanelegi sesupi SESSIONMANAGER SeSpain SeSlovenian SeSlovakian Sešireletši Se-Sardinia SeSankrit sesanesesane seSaense serwadi services servicename Seruthwane serunyi Se-Rumania Seroto SeRomania Seripakatišo Serif SERIESSUM Sererwa šere Seragamabje se-Punjabi sephuthelwa Sepholiši sephiring sephiri Sephatlalatši sepelelane Sepedi se-Oriya Se-Occitan senyega Senomoro sennyane SengwalwasaSele seng Senanyi senago SeMongolia semmušo Semate SeMasedonia SeMaori Se-Malayalam SeLithuanian Se-Lithuania Seletšamegala SeleteSaNaga Šeleng Seleng Selemogi selegae Sele#1 SeLatvian Selatini SeLatin-1 se-Lao Sela SEL Sekrini sekorole Sekmente Sekiša sekirining SeKinyarwanda sekhutlwana Sekhutlong se-Khmer sekgotli Sekgorametšwa sekgorametši sekgoiba SekgobaseoseLegoGona Sekgobafatšo Sekgethi Seketšhe sekete seka-ntshofatšo Se-Kannada sekameng sekamego seka-bofefo Se-Japane Se-Irish Se-Interlingua SeIndonesia se-Hungary Sehlophiši sehlopheng Sehlongwa SehlogosaFilimi SehlogosaAlebamo Sehlilwego Sehlaodi se-Hindi Se-Hangul SeHangarian segora segoleng Se-Georgia segatišwa Se-Galicia Se-Gaelic Se-Frisia SeFinnish sefetoši sefetoledi sefetleking Sefepi Sefediši SeEstonian se-Estonia SeEsperanto Seema Se-Dzongkha sediririšwa sedimoša šedi Se-Dhivehi Se-Dash SeCzech se-Czech SeCroatia SeCatalan SeByelorussia SeBulgaria se-Bulgaria Se-Bosnia sebopegong Seboledi Sebjale-bjale Sebalamatlakala se-Asia searolwa searolo Se-Armenia Searabia SE-ARAB Seamogela seamogedi SeAlbanian script Scotland schedule scanner sbx SB SAXReadFile SAX Saudi samplo Salvador SALFRAME šaletše šalago saka Saga saenwe saenwa saense Saene Rwanda rwala Ruthufala Runya Runtime Runic Rulatsepami Rulathapamo Rulanganya rulaganywe RSQ RSN RRI ROWSTR ROWNAME ROW ROUNDUP ROUNDDOWN rotošitšwego Rotoga romwla romwelwa RometšweKa Romela-Monithara RomelaKarata RoK robegilego RLE ripša Ripela Ringi rile Rico Rica ribbar rhombus Rhaeto-Romance RGB rfc822 Return REPT Repota Rep Renkec renka relationdesign rekotilwego rekota rekhotwa rekhoteng rejistara-nnete Rejistara registry REF readme READ RDB ratwa ratege rate rarollwe Raranego Rapametša RANTA RANK RANDBETWEEN Radiyale radius Rabokgabo QUOTIENT Quickstarter quickstart querydesign Qatar Python-UNO Putswa-serolwana-tsotho Putlile Putlaganyago Punt pulong PULOKWANO Pulete pukung Puerto PTSTR PT154 pt pstack proxy protocol protchk propctrlr projekeng progarama Profešene ProfenseYaNaga PROFENSE productregistration PROB PRICEMAT PRICEDISC preload PR PPOPTŠWSEKGOBA PPMT PPM pp PowerPC potlako Potišiši Posa Portugal Portal Poratšhe poraebete popegp POP3 POP ponyo ponye Pontshop Ponelo Ponalo ponaglo Polyline polokelong Poleiti Polastiki Polasitiki poetšo poelolebelo Poelo2 PNG PMT plugapp Plug pkgadd piyano Pitlagantšwe pitlagana Piramiti Pinyini Pinki-serolwana piletšontle PID PICT piano Phutšego phuthollotšwego Phutholla Phuthilwego Phuthetšwego Phuthelwa phumulwe phumulwago Phumulo phuhlamo Photoshop phostara Phororo Phong Pholosi Phološa Phillipines phihleleo phifadu Phetšheng phetšha phetoso Phetišo phetholo Phetho phethilwego phethegile phethagatšwago phethagatšong Phethagatšo phethagatše phethagala Pheta Phenthakone phema phedišo Phayo phatlolwa Phatlola phatlaladitšego Phathekgo Phathakga Phatalalo phasile pharologanya phaphathi Phaphametsego phapanyo phalago Phakiša Phakete Phaethone phaepe Phadimo PGM Peseta Peru PERMUTATIONA PERMUT PERCENTRANK PERCENTILE PERCENT Per Peo Pentium Penthakone pene peletilwe peleng Pego1 peelo peeletšong Peelano PBM Patronetokogano PATH patelwa PASEKA Parser Parse paretone Parenthesis Parametera Parametara Paraguay Papetšo Panama PaloyaDiyuniti palong PalomokayaMothaladi PalomokaeLetetšwego Palema Palegofela palego-fela palatatelano Palam pakolotšwego pakolle Pakistan pajete pagedlg Paesekopo paenari Pa OWNFORMAT OVER output outliner Oubox Otlologago othometiki othomatiki OtaraYaDiyuniti OS2-869 OS2-866 OS2-865 OS2-864 OS2-863 OS2-862 OS2-861 OS2-860 OS2-857 OS2-855 OS2-852 OS2-850 OS2-775 OS2-737 OS2-437 org2 options OOOLICENSE ooo ONE ompshafatša Omfolopo omeka Oman Oktoboro okthale oketšwago oketšega Oketša-Tloša oketšago okeditšwe-B Okeditšwe-A OK OJ Ogham ods odiyo Nyutherone Nynorsk nykega Nyenyefaditšwe nyana nyalelanago Nyalanya Nyalantšha Nyakisisa nyakilego nyakišitše NyakegakaLetšatšikgwedi nyakatemana nyakakelo Nwelela ntsogošo ntshontshofatšo Ntšho ntšhitše ntšhege ntlheng ntleši ntlentle N-th NT nsetšhaba NPV Noto Notletšwego Not NORMSINV NORMSDIST NORMINV NORMDIST NomoroyaTšhupetšo NomoroyaTšhireletšoyaSelegae NomoroyaTšheke NomoroyatšeodiDirilwego NomoroyaTiišetšoyaKaratayaSekoloto NomoroyaSeriyale NomoroyaMošomedi NomoroyaMogalayaSekepe NomoroyaMogalayaMoromedi NomoroYaMogalaWagoSepelaleWona NomoroYaMogala NomoroyaModele NomoroYaKgatišo NomoroyaKaratayaSekoloto NomoroYaISBN NomoroYaFekse NomoroyaBarkhoutu NomoroYaAkhaonto nomorofatšong nomoro2 nomoro1 nomoreng Nomofatšo Nomoeofatšo Nomnorofatso NOM Nolofatšo Noko noketšwego nokelwago nokelago Nofemere Nodiki nnoto Nnoši nngwelegatong nngwadišetše Nnetel Nne Nkgopotše nke nja Nicaragua ngwalwe ngwalolla ngwalelanago ngwalegago Ngwadiva Ngwadisokgolo ngwadišitše Ngwadfišo ngongoregoy Ngongoregong Ngongorega Ngatana ngangišo NeXT NEWS newa NETWORKDAYS Netherlands Netefatšo netefatše neta net Nescape Nepal Nepagalo nepagala neilwego NEGBINOMDIST NEG nee Nawa navipi Navigator NASD Nanyago nameletša nama nakwan NakoyeseTšerwego NakoyagoThoma NakoyagoFetša NakoyagoEtelaPele NakoYagoeLata Nakotshepedišo NakoeKolotwago nakoe nageng Naganišiša naganelwago NagaleProfenseyaSekepe NagagobaSeletesaSekepe NagaGobaSelete NagaGobaProfenseyaSekepe NagaGobaProfense Nabla Myemyelago Myanmar Mthaladi Tumelelano Tshedimošo Tlwaelanya Phethilwe Peakanyo Mpshafatša Maele Lokiša Lefelo Kgetho Hlokomelo Fetola Feletšwe Dinyakwa Difaele mspha msilanguages mpshanyana mpshafatše mpsaha mphsato Mphsa mpg mpe mov moutung Moutolli Motule Motswalle motšuleng motšheneng MotšhelowagoRekiša motsenyi motsenya Motšeakarolo Motsamaiši Mothunyo mothopo Mothomi Mothoe Mothalonyana mothalontši Mothala Motaele Mošupologo mosesanesesane mosesane Moselana Morunmo Morulagnyi Moromelwa morogo Morocco Morathofatso Moratho moragorago moragonyaka moragobjale Moputso Mophatlalatši mopelong mootleedi monyenyane Monyakišiši Monopo monnyane Monna Monithara Monitara moniker mongweboleng MongwaKarata monggae Monetary MonateMo Monarch Monaco Momaganya Molokoloko Molemogi molebeledi Molaong molagare Mokotlaneng mokopana Mokgwakgokaganyo mokgobo Mokgantšhi Mokgabišo mojako Mohwetši mohuteng Mohutawatirišo Mohutawamothalo MohutaWaGoKhupetša MohutaWaDaete Mohlwaela Mohlomphegi mohlologadi Mohlokomedi Mohlohlomiši mohla mogwera Mogatiši Mogatisi Mofetoledi Mofetodi Moeno Modusekwere modumong modulus modulung module Modulasetulo Modirong modirišii Modiriši E-Meile Modiri Modirelo Modikelabotlalo Modify MOD Moago Mmušong mmuši MMULT Mmerpe mme miter miscdlgs misc1 MIRR MINVERSE minimami MINA migration MIDI MID Microsotf mhlo Mexico metsotsong metšo metšhene metriksi Metrikse metheogo methalomentši Methaladitee metha metelele Metaga MET meswa Mesebe-B Mesebe-A Meriti meokgo Menopo Mene Memorantamo Mekhuri Mei Mehuta-huta mehleng Mehlalaa Megolo megala Medumo MediroyaBašomedi MEDIAN mebotšule Mebalabala ME MDURATION MDI MDETERM MD5 maxnum MAXA Max Matšoba Matšhe matsetseleko MATŠATŠIANGWAGENG MATŠATŠIAKGWEDING MATŠATŠI360 Matlakalantši Matlakalantsi Matlafatšago Matlafatša mathomo-thomo MathML materiale maswaralefelo maswaong maswa mašaledi Mašakanathota Marothodi Marathi Marara maphoto Manyokenyoke manyami Mantsu Manipuri mananeothero Mananeotheko manager Mametla mamatletšwe Mamatletša Mamatlela mamaretšo Malete Malasia maksimamogo makopana makgwakgwa Makenete Makalo makae Majinalia Maitirelo maithomedi Maithekgo maitemogelo MainaABana MAILTO Mailš mail mahlo Mahlakore-mabedi Magomokgakgano magenta magatwana magatong Magahlano mafsa mafoko mafelong mafelokelelo Mafelo-beke mafapanyi Madume madimabe Maddin2 Maddin1 Macau Macao Mabolo Ma LZW lwkanego Ltd Lst LS LRU lota Lomanago lomaganywa lokologa lokišwago Lokisša lokišetšwa lokišetše lokilego Lokia Loketše lokelwa lokeleditšwe lokele loka LogYagoItšhidulla LogYaDaete LOGNORMDIST LOGINV LOGEST Logagantšwe LOG10 local lobja LN List Lira LINEST Liechtenstein Libya libemp lewatleng lewatle letsogong Letšoba letseno LETŠATŠILAMOŠOMO Letšatšilamatswalo LetšatšikgwediNako LetšatšikgwedileseTšerwego LetšatšikgwedileeTlišitšwego LetšatšikgwedileeRekišitšwego LetšatšikgwedileePomilwego LetšatšikgwedileeNyakegago LetšatšikgwediLeEKopantšwego LetšatšikgwedileaHirilwego LetšatšikgwedilaSekepe LetšatšikgwedilaOtara LetšatšikgwedilagoFetša LetšatšikgwedilagoeLata LetšatšikgwedilagoDiraSekoloto Letšatšikgwedi2 Letšatšikgwedi1 letša Lethale Letetše letelele letata leta Leswaotlhaboši Leswaotlhabosi Leswao9 Lešela Lešata Leru Lerothwane Lerothi Lerontho Lerato Leratadima Lepokisana Lepeletšego Lepeletša Lentšuphetiši Lentsu lentši LenseeDirišitšwego lengwalophatlalatšwa Lengwalko lenaneo Lenane2 LEN lemogwego lemogilwego LelokeleloLaGoRomela lelela lekotšwe lekopana lekilwe Lekgwara lekeletšego lekeletše lekanywa lekanyetšwego lekantšhe Lekannya lekanetšwago lekanetše Lekanathwii lekanango Leka-lekanya Leisara Leina-telele Leina-sesomo LeinaleTlwaelegilego LeinalaTiragalo LeinalaSekepe LeinaLaPele LeinaLaNgwana LeinaLaMolekane LeinaLaMagareng Leinala Leinakgaotši Lehlwa Lehlaodi Lehlalošetšagotee lehlakoreng Legong Legatoi Legapi Legadima lefšwago lefšwa Lefokisi LefišwagoMotšhelo lefilwego Lefestere lefesetereng lefelotshwaro LefeloleTšerwego Lefelolatswalo lefelegago LEFELA Lefeeela lefase leele Leefela Lediri Leboto Lebone lebogiša leboga Leboa-Bohlabela Leboa-Bodikela Leboa lebišwa lebišitšego lebeletšwego lebelelwe lebelele lebelelatokišo lebelega Lebanon Lebana LCM lbeilwego Latšatši Latlakala Lathe latetago Latelela latele Latelantšha latelanago latediša lapološwe Lapa laolwa laollwa laollotše Laka laiva lahlwa Lahlele Lahlela lahlegilego lahlege lahle Lagoja-go Laetšo Laetšha laetše Laetsa Labala Kuwait kurtosis KURT kudu-kudu Kube Kua-Hong ku kotsi kotara kopišetšwa Kopišadipoelo kopantšha Kopanelo kopanego Kopanaya kopanat kopanafatšwago kopanafatšwa Kopanafatša Konteraka Konkani kolotwago koloba Kokobatšo Koketšso KoketšoItiriša Koketšo-A Koipanaya KOI8-U KOI8-R Kobilwego Kn km klike Klaemete Klabere Kišofase Kiopanya ki Khwibidu-talalerata Khwateratiki Khutšofatšo khutšišitšwe Khutšiša Khutlwaneng Khutlwana Khutlopedi Khutlonnr Khutiša khutilego khupu khulwana Khubiki KhoutuyaPoso Khouni khotlwa khomputa Khomponente khomolo Khombo kholomotee Kholofelo khipoto Khesaratebanyi Kheromiyamo Kheraeteria Khepetlele Khaontara khansetšwe khalentara khalendra kgotsofaditšwego kgotsofaditšego kgotleng Kgotlelelo Kgotlelelano Kgorometša Kgoro kgorameditšwe Kgopotšo kgopetswego kgopamišwe kgonwe kgontšwe kgontšhollotšwe kgonthišetše kgonago kgonagatše kgonagalwe Kgomatetša Kgomaretšo Kgomaretšadifiwa kgomanywa Kgomagano Kgolonyana kgolokgolo kgokolla kgokellwa kgokanyikgolo kgokantšwego Kgokaganyi kgokaganye kgokagantšwego kgokaganong Kgobokeditšwe Kgobokanya Kgobetšwe kgethwe Kgethontši Kgetholla Kgethio kgauswana kgatišong kgateng Kgatelo Kgarametša kgapele kgaotšwego kgaotšamothalo Kgaotšaletlakala kgaolomothopo kgaoletšago kgaolele Kgaolela kgaoleditšwego Kgaole Kgantšha kgakollolo kgahlanong kgahlano kgagollofase kgafetšakgafetša KEYWORDS ketšišo ke Letšatšikgwedi ke Letšatši Kernel Kerene kerekeng Kenya KENGWAGAMOLELE Kelomoka kelelong Katološo Katologanyo Katoganyo Katanaka Kashmir Kasak karabelo kaone kaonafatšo Kanxi kanji Kanbun kamorago kamohlala Kalari kakaretšong kagong kadilwego Kadilwe kadietšego kabago Julae JPG Jordan Jn je Javascript javafilter JAR Japanese Janaware James Jamaica iya ivf itshola itšeng itsebiša itriša itokišeleditše itlwaetše itlamile itiriše itima ithekgago itheilego iteration items1 items Italy itaiji itahlele išwa ISTEXT IssueZilla ISREF ISPMT ISODD ISO-8859-9 ISO-8859-8 ISO-8859-7 ISO-8859-6 ISO-8859-5 ISO-8859-4 ISO-8859-3 ISO-8859-2 ISO-8859-15 ISO-8859-14 ISO-8859-13 ISO-8859-11 ISO-8859-10 ISO-8859-1 ISO-2022-KR ISO-2022-JP ISO-2022-CN ISNONTEXT ISNA ISLOGICAL ISEVEN ISERROR ISERR ISBLANK IRR irilwe Ireland Iran ipshina IPMT IPA IP intro INTRATE interface INTERCEPT INT INSTALLDIR INSRT Inšorilwe ingwadiši ingwadišago INDIRECT index Indeo IMSUM IMSUB IMSQRT IMSIN IMREAL IMPRODUCT IMPOWER importwizard IMLOG2 IMLOG10 IMLN IMEXP IMDIV IMCOS IMCONJUGATE IMARGUMENT IMAGINARY IMABS Ileditšwego ikwe ikwa Ikgokaganyago Ikgethelwago iketlile ikemišetšwa ikemela ikarabelago Ikarabela ifonto If IDyaTiragalo IDyaThušo IDyaTefo IDyaSenepe IDyaSemela IDyaResipe IDyaPuku IDyaProjeke IDyaPhapoši IDyaOtara IDYaMotho IDyaMoswananoši IDyaMošomedi IDyaMorekiši IDyaMoreki IDyaMongwadi IDyaMokgwawaSekepe IDyaMokgwawagoRomela IDyaModiro IDyaModirelwa IDYaLog IDyaLenaneotheko IDyaLeloko IDYaLelokeleloLaGoRomela IDyaLefa IDyagoIša IDyaFilimi IDyaDitshenyagalelo IDyaBoemo IDYaBaoOKaIkgokaganyagoLeBona IDyaAterese IDyaAkhaonto IDE Icelandic ia hyu HYPGEOMDIST HYPERLINK hypergeometric HYP hwetswe hwetšege hwetšasengwalwa HwetšaPhošoeFetilego hweditše Hunyela humanega huduša HTTPS HSQL Hong Honduras homotšego Homotša holega hoko hlophiwa hlophe HLOOKUP hlompha hlomiwago hlomiwa hlome hloma Hlokolomoga hlokege hlokago hlohleletšago hlogwaneng hlobogilwe Hlkogo Hlatloša Hlatlosa hlathollago hlaotšwego hlaolwe hlaološitšwego hlaolo hlaoila hlamilego hlameng hlamege hlalošwe hlalošitšwe Hlalošiša Hlalosisa hlalolago Hlakilego hlakantšheng hlakanela hlakane hlakahlakantšhago hlakahlakane hlaka-hlakana hlahloba hlahlelong hlahlelege hlahlago hlagišwago hlagišitšwego hlabolla hh HEX2OCT HEX2DEC HEX2BIN heksatesimale Heksakone heksadesimale Hebrew HARMEAN hardware Hanunoo Hanjul Gurmukhi Guilder gui Guatamala grid gray graphicfilter Gouraud gotšwa gotšhupetšo gotetša Goswa Gosub gorošitšwego Gorapama gopotša Golokile gologolo golago Gokgaolwa goi gohlegohle Gohle gogago gofe goemela goe godišwa godimo-lanngele godimo-lagoja GoBewaNakonggaLetšatšikgwedi gobai GOALSEEK Glogwana globdoc glibc2 gkale ghost GESTEP Germany GEOMEAN Genus Genre GDI GCD GBT-12345 GBK GB-2312-80 GB-2312 GB-18030 GB Gauta GAUSS gatišego gatisego Gatišegago gatišega Gatisa gateletšwego gatelelwago Gatelelwa Gatela gašana garegare garefaditswe gaologilego gao ganyenyane-ganyenyane gane GAMMALN GAMMAINV GAMMADIST Galoša gallery2 gakaone gagolo gaelekane G3 fyu FVSCHEDULE FV Functions FUNCTION FullName FTEST ft frmdlg FREQUENCY freime France framework Founu FOUND fototšwe fotogile fosagetse fošabetšego Foromo-B formwizard formdlg FORMAT form Foriza Foreimela Foreiemetebanywa Foramo Fora Footer FontName fomuleng Fometwa fomatilwego Fomatilwe fomatetšwe Fomatekgokaganyi Folikhara Foleshe Foleše Foleša fokotšwe Fokotšegago fokola fokoditše fokodišwa fokodiša Fofiša Foamate fmtui fmcomp fldui Fldr fiwe fiwago FISHERINV FINV Filwe Filwe FiltharaeDirišitšwego filters FilimiyaMmala FILENAME fihlwa fihleletšwego fihlelelwa fihlelelege fihlelela Fifatša FIELDTITLE FIELDNAME2 FIELDNAME1 fetše fetšago fetotše fetošwa Fetošsa fetošege fetošeditšwe Fetoše fetolewago fetoleng fetolelana fetolana fetolago fetogela fetoge Fetlekela fetleke fetišetšwe fetišetše Fetilegot fetela fetego fete ferla Felola felelwa fegilwego fegilwe fedišwe fediše fedilego Febereware Feb fe FDIST FC FAXSE Farsi Faroese FAR fapenego fapantšhe Fapantšhago Fapantsha fapanegole Fanele fanago FamilyName Fale FACTDOUBLE FACT F9 F4 EXT Express EXPONDIST EXP exe EXACT EVEN European eupsa EUC-TW EUC-KR EUC-JP EUC-CN etlogaeleenyenyanego etla Etile Ethopic etetšego etelwago etellago Esekudo ERFC ERF Equador EPSI eppm epict epgm epbm eos2met EOMONTH EOF Enyaka envelp Entšine enkriptilwego engine3d Enela Endif emp emišwe emišwa emelwa emela e-meilel emego EM elwa Else Ellipsoid eletšwe Elelmente Elektroniki El ekišwa eItiragalelago Eire egif Egepeta efoga EFFECTIVE editeng edirilwego EDATE DVD DVARP DVAR dumelelwego duma du Dtshwao Dthepe dtappintegrate-u-s dtappintegrate DSUM DSTDEVP DSTDEV Drive drawfunc Drachma DPRODUCT Dpeakanyo Dot Dom DOLLARFR DOLLARDE docvw docshell dochdl dlged DiyunitiTšeOtarilwego DiyunitiSetokong diyuniti di-XSLT diX ditwatši Ditumanoši ditšwetšopele Ditsopolwa Ditsopolo Ditshwaotshwao Ditshwao Ditshwaelo Ditšhupo-B Ditšhupo-A Ditšhupetšwana ditšhupetša Ditšhupane ditšhuma Ditšhuana ditshepediši Ditshenyegelo Ditshehlo Ditshate ditšhašo Ditsebi ditomatsebe Ditokologo Ditlošo Ditlošabodutu Ditllhaka ditlkahakgolo Ditlhokomelo Ditlhaolo ditlhalošo Ditlhakapele ditlhakantšhong ditlhakantšho Ditlhahli ditlhaedi Ditlha ditlankana Ditlamafatši Ditiragatšo ditiragalong ditikologong Ditifikeiti Dithuši dithupana Dithulusi Dikgetho Kakaretšo Dithulusi Dikgetho Inthanete Poso dithulaganyo dithotong dithiki ditheko dithapalalo Dithaka dithaele ditesimale Ditepisi ditekelelo Ditebo ditebišo Ditakaletšo Ditaetšo Ditaba Poso di-taba diswa Distiller di-slide dišere disepediši Disemere diseleng disegmente DISC disampole Dirula Dirubi Diroses dirlwego diriswe diriswa Dirišolla dirišetšwe dirišetša dirišanago Diripagare diretšwego Diresipe direng direlwa direkhotong diregilego direge diragetšego diragatše Diragape Diragaditšwego Dipulete dipuku Diprotšeke Diporiki dipopego dipolygon dipolakeng dipogelo Dipoeletšo diplug-in Di-pixel diphutheding diphuthana Diphumulo diphuhlamo diphošollo Diphokotšo Diphifatšo diphetšhe diphetse diphetogpdi diphesente Dipharologanyo diphapogo Diphae Dipetšhe dipeonakong dipatelwa Di-parameter Dipara dipalophatlo Dipalamonwana Dipakana dipaete diomfolopo dinyenyane dintsi Dintlheng DintlhatšaLenaneotheko DintlhatšagoOtara Dintlhakgaotšo dinomorong dinomorofatšo dinolofatši Dingwalwana dingwadisokgolo Dingwadfiso dingongoregong Dingbats dingangišano Dinepe Dinawa dimpshafatšo dimpsha Dimotšule Di-moniker dimodule Dimethafaele Dimela Dimatrikse Dimaraka dilomaganyi Dilokelwa dillaga Dilekanyo Dilatedišiši Dilaeborari Dilaboratori dikwano dikuranta dikoti Dikotara dikopanyo dikopano Dikontraka Dikonope Dikološsa dikolo dikliki Dikiriti Dikhutšofatšo Dikhutlwana Dikhutlotharo Dikhutlonne Dikhupu dikhunyelo dikhoutu Dikhouto Dikhoni Dikhomputa dikholomong dikheraetheria dikgopelo dikgopamo dikgomaretšwa dikgomaretši Dikgomagantšho Dikgokanyo dikgokanyio Dikgokanyikgolo dikgokaanyi dikgohlano DikgobatšeodiLegoGona Dikgethegilego dikgatonyana dikgatelelo dikgaotša Dikemelo dikatišo dikarolwa dikanale dikabo dikabelo DijoDife DiiriTšeRobetšwego Diiri Dihlophiši dihlomo DigramoMakhura Diforomo-A Difontemotheo Difolaga Difoka DIFIWADEVSEKGOBA DifilimitšaMiniatšhara difetleking difetleki difere Difepammele difekse difegelwana diexes di-engine di-ekhoišene Dieakhone didraeveng didraeve Didiriši Didikadikwe di-dijithale dibolumong Dibloko Di-bitmap DIBEKETŠANGWAGENG Di-Bar Dibaloni Dibaka diatla diatereseng Diarolo Diareka diarea Diapolete Diakhaonto Diaekhone dia dhi DGET DEVSQ Devanagari Deseke DESC DepositieLetetšwego DEGREES DEC2OCT DEC2HEX DEC2BIN ddikgetho DDEML DDB DCOUNTA DCOUNT dbui dbpilots dbhhelp dbgui dbf DatabaseEngine Darusalam Da currentdate Crrency crashrep covariance Costa COSH COS CORREL Coptic contnr Combo COMBINA COMBIN Colombia CMYK CLOB Clipboto Client Clark Cl chrdlg cho-on CHL CHITEST China Chile CHIINV CHIDIST Cherokee Chart Charcoal CHAR Ch CEILING CD-ROM Cc Carribean Can CALCULATEDFUNCTION C65 C6 C5 C4 byu butše bušeditšwe buše bulwago bulege bulega Buhid Budulela Brunei browser Brazil Braille Box Boviolet botwego Botswana botsothwa Botšišwago botšišwa botšišitšwe boto Botlaseng Botlalonyane botlalakgolo Bothekgo Bothatakakaretšo Bošupa bošoro Boserolwana Bosenyane Boselela Borwa-Bohlabela Borwa-Bodikela Boreletšana Boraša bopwa Boporaefete Bopomogo Bopomofo bopiwe bopiwago bophelong bopetšwe bopegago Boomerang bonwego Bonwago bontšitšwe Bontshitswe Bontšhi BontšhaHID Bontšhadiphethogo bonolwanaš bonalego bonago bonagatšwago bonagatšego bonagatše bonagalo bonagaditšwego bolokago Bolivia bolitirišo boletšwe boleta boleletšwego bolaodi Bokmål Bokhwibidu bokgobopuku bokgauswi Bokgabo bokafaseng Bokafase BOITSHEPO boitlamo boithomedi boithekgong boiteko BoingwadišobjaNagabjaSekepe boineelo boikokobetšo Boiketlo Bohwibidu Bohwefe Bohlano Bohlami bohlaba bogologolo BogolobjagoGatiša Boglo Bogela bofelong bofe Bofa boeletšwe boele Bodikelatšatši boago boaakang bo-5 bo-1 BLOB bjbj bjaY bja Lepatlelo Bjaloka bjalebjale Bipollela BINOMDIST BIN2OCT BIN2HEX BIN2DEC Biletša bilego BigInt BIG5-HKSCS Big5 biditšwe Bibliokragi bibliography Bhutan bewe bevel Bethile BETAINV BETADIST BESSELY BESSELK BESSELJ BESSELI Bengali Belize bekapo beiwago begilego beeletša beakanywago beakanyeng Beakanyalefsa beakanyago Bcc Batswadi batsenyaseatla batheetši baswa bastyp Basque bašomiši basicide Basadi BAS barerišani bareng Bareki Barasetlabelo bapilego Baphatlalatši Bapetše bapetšanago bapelana Bapatša Banna balega-fela balega-feela Balebeledi bale Balamago bala-fela BalaA Bala2 Bala1 bakilego bakile bakago BaJagoMerogo baj BAHTTEXT Baht Bahrain Bagwera baekanyolla BACKUPNAME Šireletša axis Axial awt avi AVERAGEA AVEDEV Australia AU Atresepuku atrese atlegilego atlegago atlega Atišago atereseng Aterere ATANH ATAN2 ATAN Assami ASP ASINH ASIN ASC Arotšwe arosine arolelanwago arole arogilego aroganye arogantšwe Argentina Arccotangent arccosine Arabia arabetše Aquawm AppType Apple's appl Aporele Apoleteng Apolete API Apha Apetšhara animations anegago Andale analysis AMORLINC AMORDEGRC AmogetšweKe amogelwago amogelega Amiga Amerika Amegilego Amantšha Alikorithimi algorithm Algerian Aleph akgokanyikgolo akareditšwe akareditršwego Akanywago AIFF Ah Agostose AG Aesoselese ADDRESS ADD ActiveSync ACOTH ACOT ACOSH ACOS ACCRINTM ACCRINT accel Abulela absolute ABS abpilot abelwe abelwa abele abelanwago abelanago abc Abaganya Aabaganya A5 A4 A3 A2 A0 3D 2D dict-ns-20070206.orig/nso/wordlists/.svn/prop-base/0000755000175000017500000000000010562150175020335 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/prop-base/wordlist.openoffice.in.svn-base0000444000175000017500000000012110562150175026355 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/nso/wordlists/.svn/props/0000755000175000017500000000000010562150175017610 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/tmp/0000755000175000017500000000000010562150175017245 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/tmp/text-base/0000755000175000017500000000000010562150175021141 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/tmp/prop-base/0000755000175000017500000000000010562150175021135 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/tmp/props/0000755000175000017500000000000010562150175020410 5ustar dokodokodict-ns-20070206.orig/nso/wordlists/.svn/entries0000444000175000017500000000064210562150175020041 0ustar dokodoko8 dir 9074 https://zaf.svn.sourceforge.net/svnroot/zaf/trunk/dict/nso/wordlists https://zaf.svn.sourceforge.net/svnroot/zaf 2006-01-23T06:14:31.000000Z 8402 dwaynebailey svn:special svn:externals svn:needs-lock 2ddcbd3e-7f1e-0410-b01d-e1bca9a1112e wordlist.openoffice.in file 2007-02-06T19:01:17.000000Z e25d9b3c7dde95fee00539f1598977e1 2006-01-23T06:14:31.000000Z 8402 dwaynebailey has-props dict-ns-20070206.orig/nso/wordlists/.svn/format0000444000175000017500000000000210562150175017646 0ustar dokodoko8 dict-ns-20070206.orig/nso/wordlists/.svn/all-wcprops0000444000175000017500000000034610562150175020634 0ustar dokodokoK 25 svn:wc:ra_dav:version-url V 51 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/wordlists END wordlist.openoffice.in K 25 svn:wc:ra_dav:version-url V 74 /svnroot/zaf/!svn/ver/8402/trunk/dict/nso/wordlists/wordlist.openoffice.in END dict-ns-20070206.orig/nso/wordlists/wordlist.openoffice.in0000644000175000017500000016736310562150175022114 0ustar dokodoko# wordlist.opeenoffic.in - Northern Sotho (nso) words extracted from the # translations of OpenOffice.org # # Copyright (C) 2006 Zuza Software Foundation # # Some words that were found have been expanded to cover plurals, # etc. Capitalisation has been validated. # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # go ya e ka le ga o sa se wa tša la a di tše ye bja yeo mo tsenya na gona ge gore faele ke nomoro boleng leina tšeo nyaka tla sengwalwa bakeng tokumente goba phošo version package tsebišo letlakala moka motheo kgetha lenaneo pele bjalo sedirišwa godimo tšwa gago temana mohuta sebopego ba bo text nako hle latelago gare boloka bjo thoma dipeakanyo ntle diriša tloša palo lego mothalo tafola bjale dira gape tšhupetšo mothopo morago dikagare mothaladi fetola kgone sekgoba tlase ho nago mathomo lokiša seo beakanya karolo kholomo difiwa kgetho wo selo mpsha mafelelo tshedimošo bontšha hlama Boetša setaele peakanyo swanetše seswantšho lanngele lagoja itiragalelago bogolo ao oketša mokgwa difaele bušetša be leo ditokumente kgotla tatelano romela mmala dikgetho kgolo tšhate lefelo aterese šetše modiriši wisate didirišwa thempoleiti šoma pego thala nngwe letšatšikgwedi nakong bara sehlogo kgethilwego tlhagišo tekanyetšo tsena tee methaladi datapeisi foromo fase sele rulaganya lebala hlogo fihla thekgo lekola tirišo maemo fonto feela ditlhaka dingwe tshepedišo tlhaka fomate leswa dikholomo tokomane template phatlalatšo fomula eba diphetogo hwetša tsela ntlha lepatlelo legato dintlha bea phumola disele bophara thušo sun raraganego openoffice kgokagano phumula ja sego pampiri mootledi botelele tšwela swanetšego nyenyane tloga tlhaelelo tekanyo kakaretšo bopa moo gomme boemo segatiši nale Microsoft leswao šomago nokela mošomo mapatlelo magareng gatiša diswantšho maina itiriša gabedi fela bala tswalela pono ngwala puku matlakala laetša data tokišo sehlopha org nngele foreime ditaele dinomoro mogato letšatši kgonthe foreimi amogela šomiša lekana gola bula yona tsenywa taelo lebaka hlakanya bothata Boikagelo tšweletše tsepamego java fonte dirišwa taolo mabala lentšuphetišo lelokelelo leka e-meile tšhireletšo rapamego modiro kopanya dilo beetšwe Url seabi mafelo kgopelo hlakantšha dithalwa poso setšweletšwa phetogo mosebe mantšu fapanego Excel X makopano fetilego bolokwa tiro nyakago mohlala kudu hwetšwa wepe khutlo kgatišo oketšegilego nyakega maswao mafelelong html fila bjoo yo tswala sephuthedi senotlelo ngongorego morumo filthara fetoša feta sekgokaganyi ProductName pejana tšhupane šome molaodi methalo mehla leleme khoutu dipelaelo akaretša tšhomišo nomorofatšo nnete lekanego theko šetšego ponelopele mohlotlo Microsystems mathomong dikarolo bokgobapuku none ngwaga mabapi kopanyo kgona generated Fofela ditokelo database bonyenyane Automatically xml tsejana palomoka mollwane lentšu elela dithulusi y tokumenteng seripa sekwere rekhoto poledišano molaetša lepokisi ikopanye hlakantšhwago dumelela Word tlhaloso thekgwe thea phapano lengwe kopiša koketšo fošagetšego copyright vor tokollo šuthiša Netefatša mohola tsepama tlwaelegilego mehuta leboelela filwego diaterese tswalo saese nyakegago mpshafatša laesense hwetšagale ela ditirišo ditafola dipalo dimakhro yago thalela StarDraw reka Pilot OLE mellwane matšatši lomaganyo laiša hloko faeleng dikgoba dikerafiki dika dibopego bolela beilwego Windows tsa thata StarImpress šomego rapama pdf mothalading maboleng Letšatši-kgwedi inc difonto bogare tsentšhitšwego tikologo swana seberekišwa lefeela kgonege kgale International fetolela di-template dikrii botlhami writer tsenywe tlatša tisiki selaete sekala palotlalo ODBC n morithi mananeo kgaola Id fetša fetotšwe dirwa bohlokwa bile temošo ngwadiša moriti legoro inthanete hlalosa godiša dithoto ditaba dikologa c Yuropa tsenyo tiragatšo swanago someng sephuthelwana sampolo noši nonwane MS modumo mmepe mebala konope kgethegilego kgakollofase Import Hangul draeveng ditšhupetšo dihlogo DDE calc tekolo Sql setšhaba sengwe seke sediko SeArapo PowerPoint paletšwe motho lekanya lapeng kgotle kgokaganyo kgokaganya dirolla dirišwe boso bobedi tšwele tshupane thuša tekanelo phagamego peeletšo no Naa mopeleto kopantšwego kgontšha JDBC dirišitšwego dikološa botseno boripana tlhatlamano tima thapo sethalwa se-China re nomora moutu mošomiši moabi mediro lenaneothero lekantšha khii hlopha hlogwana Export dutše ditaolo thaetlele swaya StarWriter StarCalc sematlafatši segolo seatla lengwalo kgaoga itšego gae fekse eya ditumedišo dipoelo CorrectSpell botlalo bolokwe bašomedi baka arola amogelwa web tšwelela tšona tsenye tšeela tlhalošo šomišwa pontšho phetolo phatlalatša okeditšwego ntšha mothalwana mašakana lefesetere lebelela konopi kgonthiša kgonego kelo katlego gobane FTP eupša ditlamorago butšwe boletšwego boithekgo bjang aowa tlwaelo tiilego thoto taba šireletša seswa SeSpanish Seisemane potšišo phokotšo neteweke mpshafaditšwe mongwe mongwadi matseno makhro letetšwe lebantšwego kgwedi kgokaganego kgaolo hyperbolic galoga ERR ee diteng dirilwego dintši dinako dikhutlo dikgwedi dife bolokilwe bofefo boeletša bewa tšwago thekišo Solaris s ruri rekoto polelo phapogo pedi morulaganyi moamogedi macro mabaka lefelong khansela khalendara kgopolo kgopamiša impress hlokomologa fetolelwa fetleka dinthokolwana dihlopha botee boitirišo bodikela base abela tshwantšho Tsepanya tšea tlago thulaganyo TemplatePath setatamente serapa Own nkgokolo Mogala matlakaleng lerungwana lekanela laetšwago Kgapeletšo godingwana bulwa bogodimo boela bego XX uno tlhago tlhaelo Thulusi thongwa thibelwa thekge thapalalo sekorola sefetleki phesente nngeleng ngwadišo mphato moswa morero menu matšatšikgwedi laeditšwego kgwebo kgethe JRE ipiletša hwetšwe hwetšwago fomo fokotša fax efe DOS ditlhakakgolo ditemana dipampiri de bonagatša bonagala bézier anega all v tumelelo tšwelapele tshepetšo tshepedišong tsebjego tlwaelanya Tlasana tiišetšo Tiiša thomiša swere šireleditšwego romelwa rights reserved r pukuntšu programa ponagalo poelo pharologantšho nyako nolofaditšwego naga mola minimamo Mehlotlo mathata mangwalo Lenane lege kopanywa kgahliša katišo ithekgilego iša hlaloša gamma felela emiša elemente ditirelo diregile dibara bogareng aroganya Apple ala tswaletšwe tšhupetšong tlošwa tirelo thipo tekano StarOffice sona setlankana sekgala saete rata ponagatšo phuthela phetha Otlolla OpenDocument Naledi mosepelo mogaleng mmagojeng mehola MB maksimamo Macintosh mabedi Maaka llaga letlakaleng lekanago legatong lefapantšhi lefa laola laišwa kapejana i gatelela gana etšwa ema ele ditšhupo Dithempoleiti dirwe direkhoto dikarolwana difomula DataPilot bulwe botala bona bolokilwego Bit bapetša badiriši z vnd tshwanelo tšhumile tšhuma tsepanyo tšeelwa tlwaetšwego tliša tlhamo timilwe thome thekga stardivision Speech setšo setlwaedi Sete sešupo senotlelong sekamiša Ripa rekhota Products popego phethilwe pharola pepeneneng MySQL mošomong moragonyana melaetša mehlala matsogo magomo logarithm letelwago Lernout lekanyetša khomphuthara kgonthišegile kgethwa kgato hwetšagala Hauspie galase fomata fapana ditsenywa ditseno dirišwago dikwere CJK CD bušetšwago boemong bar akhaonto yuniti XSLT tswalano tsentšhitšwe tseno tsebjwego tokelo tletšego tlatšwa timile thesaurus thepe thempoleiting tafoleng t swanela swane šomišwago software Setsenyi sešupi sešo Sekgomaretši ratwago putlago putla phokoletšo pampiring nyakišišo Mozilla moleko mokgokaganyi mohlomongwe mmogo maswaodikga mahlaodi linear lemoga lekolwa lefsa lebelo kopolla kišontle kgobokeditšwego ingwadiša hlophilwego dumelelana draw ditlhaloso ditiro dirwago dirapa dipoledišano dipatelo Corporation bophagamo binary beta beilwe BASIC balwa area ama u tšwe tšhelete tsentšwego TMP tlošwe timetše thomelo šutha setsopolwa setifikeiti Segerika searoganyi sampole Potleng phetošo phetolelo para office nyakišiša nyakile nnyane ngwadišitšwego ngwadilwego netewekeng motšule mo sengwalwa modulu metsotso metriki methopo mangwe leke lekane lebota lebakanyana kua kopana khutlonne khataloko kgomaretša kgokolo kgauswi kaonafatša kamoo Inso hweditšwego hlangwa hlalositšwego hlahla Hanja goteditšwe gabotse fetolwa fedile ditšhate ditsela ditlhagišo diswari dirišetšwa diragatša diphuthelwana diphetolo dipharologantšho diforomo diforeime dibeke des bopše bophelo Boolean bokantle bitmap beke amogetšwe abetšwego Zip tšhupaboteng tsentšho tseneletšego tse Tlwaetša tlhakakgolo Tlhahlo tlatšo tlaleletšo thwii theogela tesimale teko talalerata taga Swantšha Setsemeledi setlankane sepelelanago Sejeremane Sefora sefahlego sediriswa rula ratago phumulwa palogare palediša nyakwa ngwageng mosepediši mmalwa mm matla makro Maikemišetšo logo lephoto legodimo Lapološa kopi kgonthišetša kgoboketša kgaotšo kgaoletšo kgakollo kgabaganya hweditšwe hlokega gatee ganyenyane gantši fomete FILE fihlilwego fetolwe fetolwago fetogile feletšego feditšwe fapa-fapanego F etela e-poso eng ditokumenteng ditiragalo ditaelo dirišitšwe dirilwe direkoto dire diphethogo Dipeke dibulete desimale datapeise D CR boraro bontši bonagalago boingwadišo Bohlabela Bessel beakanywa Adabas tšwelopele tšohle tshekamo tlogela tlami thaepa thaele telele Teka-tekanyo tebo swara SVsd1 Šutiša Širollela šireleditšwe sine Sesiriliki sephutheding sephetho se-Korea sekirini Seheberu Ruma rotogela Roman rena Postscript poloko polokelo phutha phaphamala patela parameter par Papišo paledišitšwe Otlologilego ntši nokelwa ngwalollo ngwadiše nepagetšego moseka moromedi mofetleki moemedi mmušo mengwaga maikhutšo lenaneong leletere Lekanyetšega lefoko lebanya Laser kwanago kwagala kopišwe kopano Khupetša khomphuthareng kgopamišo kgonthišege inthafeisi input hwetše Hunyetša hlopholla hlongwa hlomo hlamiwe hlalošitšwego hlalosago hlakantšhwa Galogiša fonetiki filwe fetotšwego fetišetša et emelago eksponente dumeletšwego dumelelwago dumelelanago dula ditekanyetšo ditefo ditatelano dirago dipiramiti diphošo dingwalwa dikološitšwego dikoketšo dikgokaganyi difomate dielemente didatapeisi dBase cosine com chi bošweu Bora bonolo bongwe boloke boikgethelo bj bega Basepediši baamogedi Asia arogantšha Ankora amogetšwego afe www wena US tumelelano tswalanego tswa tsošološo tshetla Tsepanyetša toropo tlemilwe tiragalo thuto thomago therešo theoša tharollo tangent Šuthišetša šireletšwa Setseka Sethomi sepetša senyenyane senyegile Semolao Selatin seka Sejapane sehla sefetodi searodi runyela romelwago Rategago Potlakišago ponego poledišanong phokotšego phethagatša Phaya pelaelo patrone OS Oracle oketše ofe nyakwago nthokolwana nthokolo nolofatša ngwalwa nakwana motsotswana motsotso mothopong Mošongwana mollwaneng mmele mmagoja mesebe mesaeno mebedi math master Marungwana mapi mantši makgobapuku maemong lona lomaganya lomagano lokolla lepokising lenyenyane lelokelelong Lehlakore legotlo lefe kwano Kiriti khwetšo kgopelwa Kgopamišitšwego kgethilwe kgethilego kgatello kemišo KB kabelo ikhutša ii hlokomela hlahlela gwa fometa fetogago explorer eletšwa dumelelwa DPI dll ditsenyo ditokomane ditikiri ditemošo dišupo diriše dipego dinageng Dikhouni dikgato digatiši difonte difilthara difila di-cookie diberekišwa diabi DD bule bontšhitšwego bokgole bokaalo boitiriso Biti Bipolla bibliokrafi bapetšwa baotledi bao baagi b and ananya aga Access wona tumelelanong tšwetša tšwelelago tswalanago Tšhela tsenyago tsentšhitše tsebjwe tlošitšwe tloše tlišwa tlema Time thumo theoga theilwego thapamo Temogo taetšo taetšaletlakala Šuthela StarMath šira sethiki Sepotokisi Senepe semeno sekorolo sekema Sekamišetša SeChina se-Bengali SeAsia romelwe putswa projeke profaele ponegelo pogelo phihlelelo phethwa pharamethara Phaelote PC palophatlo p ofisi of octal Ntshofaditšwe ntšhi ntšhetša notlela nepagalago mouse motheong motheodifiwa mosela morekiši mogolo metsotswana mekgwa mediya matlotlo malokelelo makatšago magato Mac maatla maano lomagantšwego lokile leinaphetišo legolo lega lefago lebiša lebilego lebato lebaleng lebakeng LDAP lahlega Lagojeng laetšago kwagalago klipiboto klipiboroto Khutlotharo Kharensi khamphani kgolwane kgoboketšo kgatelelo katišani kala kae is iri inthaneteng Internet India ile ikgokaganya iii Hlola hlokegago hlaola hexa gatišitšwego fošagetše for filter FIELDNAME fetošetša fetolelwago fetago fapantšwego fana fa Env enfelopo Electronic efa Dumela ditshenyagalelo ditokollo dithušo diteko disk diphapano dipeeletšo dipalopalo dinyakwa dikonopi Dikološetša dikarata Dikala cookie contangent cm bušeletša bosephiri bopilwego bopilwe bontšhwa bonnyane bone bonagale bolumo bokagodimo bohubedu boa bjona beakantšwe bapetšago balege bala-feela Audio ARG2 app akaretšago YY XP woo Weibull w Var VALUE utamilego tšwetšopele tšwetšego tšweletšego Tswela tšhutišo tšhologa tshehlo tsenwa tsentšha tsenela Tsemeletša Tšaka tletše tlemaganyo tlanya tiišetša thušago thongwe thekinolotši theilwe tebelelo swarwago swanelegago sv StDev src source šomišwe Šomišwa-tlhathollo SMTP šielanago Setoko serolwana Sepediša selete selaetši sekhutlo sekgokanyi sekgaoganyi Sefane sebadi seabelo ruby RTF rilego rekilwego pv Poelo-morago poelomorago poeletšo pi phumolwa phaphametšego Papetla pako Paelote padile Outlook otlela Nper nolofaditšwe Naletšana mpshafatšwa mothalong Mošomoši mosaeno morago-rago mong moneelo monagano molao modirisi modirelwa Mmetse MIME metswako meta mešomo memmepe Maswaopuku Marontho maletere mafesetere m lokologilego lokišwa lokišitšwego lokiše log LF letsogo letšatšikgweding letlotlo lereo lerei Lentšuphethišo leloko lekwa lekelela lefasetere leemaema learogi latedišiša laetšwego kwana krite Khwibidu khwaliti khesara kgopamo Kgopama kgontšhitšwe kgethile kgafetša Kamano iwago išwago in IIS hwetšagalago HOST hlongwe hloka hloba hlaolago hlame Hlakola histori griti gatišitšwe Galogela foromong fokotšega filimi fetilwe feteletšego fegelwana fedišwa fapantšha fao emetšego dt ditšweletšwa ditswalano ditokišo Ditekanyo diselaete Dirisa direga dipotšišo diphikisele diphahlo dipalo-palo dipalomoka dinotlelo dingwadiso dikologilwego Dikhii dikgokagano dikgobana dikgaoletšo dikatlego Dika-dikago dijithale diintši dihlogwana die-meile didiriswa di-degree CTL csv boyo botwago bosese Borwa boreledi bontšhago Bonelapele bolokologi bokoto bokaakang bofilwego Bofase bitšwago bitša bitimapa beeleditšwego beakanye bapetšwago bapetšego balega baenari atiša Areka amogelwe amanago alpha Alien abjwa YYYY yoo xlt xl WinWord wepeng VBA VarP Tsopolwa tširoga tšhireletšego tshesane tsepamo tsentšhwa tsenelano tsenago tsebje tsebiša trademark Tous Topa tokologo Tokišetšo tm tlošitšwego tlogo Tlhakatlhakano tlhakantšho tlhahlelo Tlemo tle Thunderbird thomološa thibela thewe thebe Technologies tebišo TARGET SVsa1 šuthišitšwego StDevP StarRealtimeClient StarDrawDocument Star Spline skena širolla šireletšegilego Silintere Se-Turkey Setswana seterata Setaka seswari seswantšhong seswantsho seswai se-Swahili Sešupanako seriyale sepelelana SELECT šele Se-Kurdish sekhwi sekhwama Sekgotlwa SekaSediko Sehlogwana Segopotši Sedikadikwe sebopegogare sebaka Se-Arapo Saesa saennwego rulaganye rot13 rometšwego romele ripiwa ResultSet réservés renke regression Raragantšha raragane Raragana qui putlilwego pot popafoko Ponya-ponya Ponong polygon Poisson Pocket phumutšwe phumolwe Phoso phopholetša Phopholego phetšhe Phetlela phethagatšwe phethagatšwa phethagaditšwe phaphašo phaphaša patelo Palelo Pakane packed Oterro open okeditšwe OEM Nyakela ntšhitšwe npery nna ngwadišolla Ngwadiso ngwadišitšwe ngwadilwe nete nea mpshafatšwe mpale motšweletši moswari moswananoši Moswai morumong mollo Mohumagadi mmapa methalwana merero meneelo Memojulo megato Medu Matšatši-kgwedi mathoko matee marques mareo makga maiteko magoro Mafapantšhi lomaganyolla lokišetša lokeleditšwego Linux Leporogo lekanyetšwa lekanyeditšwego lekanetšego lekanelago lebišago lebakana latela lahlegelwa laetšwa koto kopišwa klika klase khupone khophi khona khomphuta kholomong khiiboto Kgoromeletša kgorametša Kgopamišetša kgontšhago kgonega kgonagalo kgokolong kgokagantšwe Kgethwego kgethega kerning kelohloko kelelo katološa Karodi karata karabo kantle Kamoka kalo kabo ithekgilwe ithekgile išago io InsoCorporation ini IDyaPeeletšo HTTP holofela hlamilwe hlamago hlalošwago goga Gnome giriti gatišwa gararo gannwego flash fihlilwe FIELD fetišetšwa feletšwe feleletša feditše fedišitšwe fediša fasana Fapanya est eps emetše emeile Elipise elego dumeletšwe dumelelwe droits doka Ditshwaro Ditšhupu Ditšhelete ditsejana Ditlhahlo ditekanelo dirollwe diragatšwa diprojeke Dipitšo diphuthedi Dipharamethara diparameter Dinkgokolo dingongorego dilomaganyo dikgokanyi Dikgakollo dikete difaeleng didijiti diayekhone diaroganyi Default datapeising cotangent correction CDE botse botša bopšwa bopša bope bonagatšwa bonabo bolokwago bolelago bokamorago boingwadišong Boima bogolong bodiba binomial beiwa beakantšwego batho bapala bago baabi ayekhone aux atišwago Aretša Arc applet alfabete Alfa akareditšwego afm ADO Zipi Yaka website watšwetšopele usr usa URL1 Unix txt Tumedišo tswalelwa tswalelano tswalanong tswakilego Tswaka tsošolotšo Tsošološa Tšhweu Tšhupadikagare Tshedimoso Tšeometri tsenywago tsentšwe tseneletše tsenelelano tsenelela tsejwego tsebiwe Tšatšikgwedi Tolara tlošo Tlhopho tlharologago Tlhakanya tlhahlamano tlhagišong Tlhaelediša Tladitšwe tirišong timetšego tiišetšwa Tiile TIFF thomišwa thomilwego thomilwe thomile Thibelago thekontle thekgwego thekgwago thekgwa thaepe thabela temaneng Tala-morogo-lerata talamorogo taetši tab Taamane Switzerland SWF swerego swantšhe swanetsego SVsc1 šuthišitšwe Šupetša StarImage StarChart SSL SPARC šomišitšwego Sobeletša Ševerone setlogo Se-Thai seteginiki Sesotho seripagare sepetšwa Sepaniši senyegilego Sengwalwaboitirišo sekoloto Sekhupetši sekgomaretšwa Sekgobana seipone Sehlophi Seetša se-Dutch sedirwa sediri Se-Baltic searogantšhi SDBC samorago saennwe saenne saena rulaganyega rometšwe rekwa rarollwa rarolla RAM Radiyase radians radian ra pukutshwayo protšeke potego popofoko Pontsho pompi pitšo phumotšwe phuhlama phophoma pholisi phethwe Phethogo phethagetšego phefa phatlalatše Pearson Peakanyoya patente patelwago papatšo Palopatlo Palette paledišwa pakollwa pakolla pakilwego OUTFILE Otlolotšwe oketšwa Ofising nyalelane nyalelana ntšhwago ntshofatšo ntshofatša Ntsho nthetelego notletšwe nomorofatso nkgokolong ngwagamolele ngangišano network Netscape namune namelela Itokišeleditše mpshafatšo mpshafaditšwego Motswako Motomo motheoga motelele mosekamo mosehlwana Morena Moreki monwana Mongwalonyane Mongwalokgolo monei Mojulo Mohuta Mohuta mogatong mogare mofsa modu misc methopong Metheoga metheo methalong mesese mesesane menyu mentši Matswalo matšatšing manyenyane mantšuphetišo mang maleme maleba maks Madulo Macromedia Luxembourg Loop lomagantšwe lokišwe lokišeletša Lokilogilego Lokela loke LetšatšikgwedileeRekilwego Leswaopuku lesome-tshela Leputlo lekolwago lekelelago lekanetša leihlo Lefastere leamanyi Latin laolla lanngle Lanngele-Tlase Lanngele-Godimo lambda lahlegile lahlago lahla Lagoja-Tlase Lagoja-Godimo Laeta Kwantšha kwane kwanantšho kopantšwe koketšo-itiriša klipiborotong kitimiša Kimollo Khaontareng kgothaletša kgorametšwa Kgonthišiša kgonegago kgonagale kgokologela kgokaganywa kgoboketšwe kgethotee kgethopedi KgethaKa kgethago Kgethagatšo kgaotšego kgaoseditšwe kgaolwa kgaoletša kganya kganetšo kgahlišago Katološitšwe Katoganya katakana Karolwana Kapi kanale kamogelo kai JIS itokišeletša ISO iše Išantle intemete hlomilwego hlokomelo hlangwe hlamiwa hlamilwego hlalositšwe hlalosisitswego hlalošišitšwe hlakantšhitšwego hlahlelwa hlaelelago hiragana Hid gotee gongwe gogela goema Godišetša geometri Franc Foreimetebanywa fomateng fokoditšwego fokoditšwe Fisher fihlela fetšwa fetole fetogego fetoga fetile felelago Federal Evolution euro etetšwego eta Esego emišitše Elipsi draeve Domain dlg di-URL ditumelelo Ditšwetšwopele ditšhišinyo ditomotsebe ditlhatlamano Ditlhaka-kgolo Ditla-morago dithipo dithepe dithalwana ditatamente ditaollo disiki diselaeteng Disekmente dirišana diragetše diragaditšwe Diponagalo Diphopholego dipharologantsho dipeakanyong diparametara dipalomokanyana diotara dinoko dimodulu dimakro dimacro dikopi dikologwa dikologago dikgonagalo dikgolo Dikgobeng dikgatong dikerafo Dikema diinišiale di-ID difetodi Dif diega dialogs dialog DEFINEDVERSION DEFINEDPRODUCT Cyrillic clipboard Clipart Canada by butšwego bušetšwe bušetšwa bulegile Botlhakanyane Botlase botlalokgolo both Boteng Botebo Botala-morogo Botala-legodimo boswa Boroto boputswa Bopgare bopago bontšhwe bontšhwago bontšhe bonnete bonala bonagatšago bolokwego boloko bolokile bokotokoto boikgopolelo Bohwibidu-madi Boemakepe boeletšwago boditšhaba-tšhaba bobolokelo bmp Biff5 bidio Bevele Belgium bedi beakanywe beakanyetšwa batšweletši bapelanego Bangladesh balwe balwago Balela balanna baemedi Babuši atišwa arotšwego aroganywa ARG arctangent application AportisDoc amogele amegago algebra alfanyumeriki akaretšwe akaretšwa Ai Agente Aekhone Acquisitions accessibility abelwago Zoomela zi zeta Zealand x-starimpress x-stardraw x-starcalc XLS50 xi wisateng WinLatin win wepesaeteng wepesaete Volume video VER VCL utolotšwego utollwa utamego upsilon Unicode une un UI tswetšwego TšweleditšweKe tswalwa TswalaeHweditšwego tswakwa tswakilwego tsopolo tsopola Tšokotša Tshwayatshwayo Tshwarofelo tshwaro Tshwaelo tšhuana Tšhipi tshielano Tshetledi tshesanetshesane tshepa Tshela TshedimošoyaPhepo Tšhalelo tšerwego tsenyege tsenwe tsentšhitšego tsenege tsene tšeetšwe tsebišong tsebišo2 tsebišo1 touchpad ToropoyamoeYago Toolbar tomaganyo Tobetša Tobeletšo tlositswe Tlosa Tlolela tlo tlišo Tlisa tlilego tlhokomelo TlhalosoyaTiragalo TlhalosoyaProjeke tlhalošišo Tlhagiso tlemilwego tladitšwego tirišano timeletše timelela tiišo tiers thušong thuše Thumelo Thomisalefsa thlaelelo Thipego theta Therei Thel ThekoyagoRekaRekiša ThekoyagoReka theknoloji thekema theipi theelwa tharo Thapalola thalwe thalwa Thaletšwe thalelo ThaetleleyagoIkgokaganya TGA Telnet TekanyoyaTefo TekanyoyaSephuthelwa TekanyoyaKholofetšo TekanyoeTšwetšegopele TekanyoeNtšhitšwego TekanyoeDirišitšwego TekanyetšoyaSekoloto TekanyetšokaIri Tekanyetso tefo TefišoyaTirelo TefišoyaMorwalo TefišogoyakaMotho technologie tebego tšwela tau tatelanong tate Tala Taetšathoko swayolla Svx SVG šuthišetšwago šupeditšwego šupa Sowivela sont šomišitšwe šomišago šomela sobeleditšwego sobeleditšwe so šitišitšwe Šireletšwago sigma Sidikadikwe SF SeUzbek SeUrdu setopo setlabelo Se-Tibetan sethuši Sethomiši seteišene se-Tamil Setaliana SeSwedish Seswayi sešupetši se-Slovak SeSerbian sesane se-Russia Seroma Serepudi Sepolaine sepetšwe sepelwago sepelago Sepela Sepeke sentšwe SeNorway sengwalweng sengwalwana Sengwala SeNepali sendmail semenya SeMalay Sellathekeng SeletesaNagasamoeYago Selekanyo selaeteng Sekotšho Sekorolela Sekopanyi Sekolo Sekhutlwaneng sekgetho sekgahla Sekatshepedišo SeKashmiri sekama Seithali Seiši Se-Iceland SeHolanere se-Gujarati segologolo SeGeorgian segatišing sefonetiki Sefiwa sefere sefe sedirišweng sedikong SeCyrillic se-Croatia Seburu sebudi Sebapadi sebakeng seabing sdp sdi Šarakanywa SAR Sans SANE sampoleng sammaletee salvage ROWNUM rotošwago root RometšwegoTšwa rho restreignent resource res REPORTFORM relative rekiša rekhotong rekhotilwego Rasterfile Radio radins quartile quantile python Putlela pušetšo pušeletšo pukwana pukuntšung PTNUM psi protégé program ProfenseyaNagayamoeYago praebete PPT97 poroutšhara poraefete popopolelo ponya poly polokong polices polatefomong PM platefomo pixel Pitch phumulega phumotšwego Photo-CD phošollwa Phošolla PHONE Pholigone Phifatšo phi phethe Phethagatšago Pheteletšo Phepolo phenšene phefoga Phaye phapoši Phalete Phafogela phaephe Phae phadimiša phadima Perl Penta pelo pegong Pedifatša peakanyong PCX pays Pastei Paralleograma Pane PaloyaDisolwa PaloYaDinepe PaloyaDikoša PalomokayaTekanyetšoyaSekoloto PalomokaYaDikhalori Palm palelwa ou otara orthographique or OpenGL OOOVENDOR online omicron Okthakone oketšwe Nyenyefatša nyake num nu ntšhwa ntše NontšhaForekwensi NomoroyagoOtarayagoReka nolofatšwa noketšwe nokelelwa nnyanennyane Ngwedi ngwalweng ngwalela ngwalege NgwagawaTokollo NgwagawaTokeloyaNgwalollo ngwadišwa NFS NEWLINE New nepo nepagetsego neng neela nanya NakoyaPeeletšo NakoyagoLokišetša NakoyagoFihla NakoEDirišitšwego nabilego mu Tloša Sephuthedi Mohuta Go msi Mpshafatsa mpho MPHIWAFEELA mpeg Motsetaphethiši motiišetši motheogo mothalaladi moswana-noši Moso mosadi MorethethoWaGoKhutša MorethethoOMogolo Morathofatšo mootleding mongwalo MonaboOSepetšwego Molwane Moletši Molahledi MokgwawaTefo MokgwawaPhokotšegoYaTheko mokgwa mokgwa Mokgatlo mokero MohutaWaTšhireletšego MohutawaKaratayaSekoloto MohutaWaGoItšhidulla MohutawaDitshenyagalelo MohutaWaAkhaonto Mohlare mohl mogo MogatoWaGoOtaraGape moelo Modikelelabotlalo methalading mesela Meratho mephato menyenyane Menotšwego mengwe Mekgoko meetse mebolelwana matrikse MathType matelele Mašakanathotana Mašakanabora marque Mark mapatlelong mantšung mangwalong mananeong mamaretša maloko makopanyi Mahlakore mahala magorwana magolo mafolofolo mafeela MaemoATefo MaemoAGoBaLeloko Maele macros Mac-Pict Macaulay mabakeng maarogi l'utilisation Ltelago Lotus Loma lokollwa lokollotšwe lokišitšwe lokišago lokisa Lokeletša lokarithimi lokafatša lokafaditšwe LOGICOPERATOR logiciel lingu LIKE licencié licences lib letšibogo letšatšing LetšatšiNako LetšatšikgwedileHolofeditšwego LetšatšikgwedileeTšweleditšwego LetšatšikgwedileeNošeditšwego LetšatšikgwedileeHweditšwego LetšatšikgwedileeBjadilwego LetšatšikgwedileeBeilwegoNakong LetšatšikgwedileeBegilwego LetšatšikgwediLaTefoYaTšeKolotwago LetšatšikgwediLaTefoYaKholofetšo LetšatšikgwedilaTefo LetšatšikgwedilaPeeletšo LetšatšikgwedilaLenaneotheko LetšatšikgwedilaLehu LetšatšikgwedilagoThoma LetšatšikgwedilagoRekaRekiša LetšatšikgwediLaGoItšhidulla LetšatšikgwedilagoFihla LetšatšikgwedilagoFelelwakeNakogaKaratayaSekoloto LetšatšikgwedilagoFelelwakeNakogaFilimi Letlapa letetšwego LeswaoLaTšhireletšego LeswaolaRekhoto lesedi Lešakana lepelela lepatlelong Leotwana Lemoša lemogwe Lemogwa lekotšwego Lekopanyi lekole lekile lekanyeditšwe lekantšwe lekanele LeinaLaTšhireletšego LeinalaProjeke LeinalaMophatlalatši LeinaLaMokgatlo LeinalaKhamphani LeinalagoIkgokaganya LeinaLaAkhaonto Leina-kopana Leinakopana Lehono legotlwana legorwana Legorong lefša LefeloleeRekilwego LefelolaOfisi LefelolaGonabjale LefelolagoItlwaetša LefelolagoeLata lefasetereng lefapha lefapanyi lebišitše Lebelolašathara lebelelwa lebatong lebanego Lebane leago latelana lapile LaMorena laletša laišwe laišitšwe laeborari L kwagalo kwagal Kubiki k-th kopišitšwego Kong Kodak kitima Kišo Khwalithi khutšo Khutlonnethwii khubedu KhoutuyaPosoyaSekepe KhoutuyaPosoyamoeYago KhoutuyagoLatedišiša Khouto khouta khompo Khiinote khamera khalara khabinete kgwthilwego kgweding kgotlilwe kgorameditšwego kgopetšwego kgopela Kgopamego kgonwa kgontšhwa kgonnego kgonne kgomegago kgomaganya kgole kgokaganywe kgokaganywago kgokagane kgokagana Kgodišo kgoboketšwago kgoboketšwa kgobokeditše kgethong kgethego kgethegago kgauswiuswi kgatišotee Kgatiso Kgašo Kgaotso kganyogwago Kgakollotlase kgagollo kgabaganyago Kerafiki kemo kemelo kemedi kelotshehlo katološitšwego Katologano Karolwa kappa Kana Kama kalwa Kakaretso kakanyo kadimo kaa June JPEG joina Jenale Jan Jamo itiragalela Ithuta ISBN Iraq ipoeletšego iota Intel ingwadiše impress-packed IMAP ikopanya ikhole ikgokaganye ikgethela Iketle ikemišeditše IDyatšeodiDirilwego IDyaSetšweletšwa IDyaOtarayaMošomo IDyaNakoeKolotwago IDyaMokgwawaTefo IDyaMohutawaTiragalo IDYaMohutaWaGoIkgokaganya IDYaMohutaWaAkhaonto IDyaMohlokomedi IDyaMediroyaBašomedi IDyaLegorolaMmino IDyaLegorolaLefa IDyaKgoro IDyaKgoboketšo IDyaDintlhatšaLenaneotheko IDyaDintlhatšagoOtara IDyaBoingwadišo Ichitaro hypebolic hweletšwe HRESULT HMTL Hlwekiša hlotlilwe hlotla hlophilwe hlongwago hlolegile hlokomelwa HlokomeloeLatelagoeBeakantšwego Hlodimela Hlephilego hlatloga Hlaotswe hlaolwa hlaloswe hlaloswago hlaloswa hlalošišwago hlalošišwa hlalose Hlakatšha Hlaka-hlakanego Hlakahlakanego hlagile header haephalinki ha GPF Goso Gopola gonyenyane gontši GoKgethwagaThempheretšhara GoKgethwagaSeetša gogolo godišwago godišitšwe GoAmegagabonologaSenepe GmbH GIF geno gatišwago gatišegego Gatetšego gata garefaditšwe gannwe ganetša galogilego gabjale G fournisseurs ForekwensiYagoNošetša foreimeng font fomong Fomateboitirišo Fološa fokotšwa FM3 fiwa Finland fihlelelago fetšwe fetoletšwego fetolelwe fetogilego fetišwa fetišeditšwe fetiša fetilwego felo feleleditše felago fektoring fasefase fapanago fabrique États-Unis epsilon enngwe enkripšene en Emišitšwe emetšwe Ellipse elipse eletšwago eletša DTD Dokholomo doc DN dl Diwisate Division DitutuetšoTšeKgolo ditumedišong ditumammogo Ditsošološo Ditshupane Ditšhupadikagare ditšhomišo Ditshepedišo DitshenyagalelotšagoRomela Ditshekamo Ditlwaelo ditlhaelelo ditlankane ditlami ditirišong ditikrii ditho ditheto dithempoleiting dithapo ditebelelo ditatamenteng ditaodi ditafoleng di-tab Dišupi Distribué disiphetšha DišereTšaGago Disaese dirunyi dirollwago dirišago Diripana Dirhombus diretšwe Diresose dir dipukuntšu diprograma dipontšho diponelopele Dipolygone dipolokelo dipolelo diphetošo dipharametara Diphaphašo dipegong Dipatrone Diparallelograma dipalotlalo dintšhi Dintlhanyana Dinaletšana Dinaledi DimiligramotšaSodiyamo dimetriki dilemogi dikopnelo dikopanyi dikološwa diklase dikhona Dikhamphani DikhaloriTšeFišitšwego DikhaloriGoYaKaSesola Dikgopamišo dikgaotšo Dikgaolo dikgakollofase DikgahlegoTšaMolekane DikgahlegoTšaBaoOKaIkgokaganyagoLeBona dikemišo dikelo dikarabo dika-palomoka dikamano dikakanyo dikadintlha DiiritšePatedišwago DigramoDiproteine DigramoDikhabohaedereite diforeimi difomo diegiša Didiko didijithale didesimale di-database dibiti Diatrese diataerese dialfabete détenu Desktop DepositaTekanyo déposées déposée delta DB d'autres datefunc Date dans cursor Currency COUNT core control connurl Connectivity config comprend component Commercial classes caractères cache bušwago bušeditšwego buša Bulete bulegilego Botšhaba Botseka botsebi botlhakakgolo botho Botelel botegago bosekete BophelobjoFokotšegago bonwa Bontsha Bontša bonnyanennyane bong bonalago bonagatšwe bonagaditšwe bolokilego bolokela bolokegile BolengbjoLekanyeditšwego BolengbjasePhološitšwego BolengbjaGonabjale bolelwa Bokgopapuku bokgoni bokaone boitshwaro boitsebišo boithaopo BoimabjaSephuthelwa bohle bohlatse bohlale Bogomo BogolobjoBeeleditšwego Bogale bog bofsa bofelo Bofefe boetšago BoemoBjaLenyalo boelng boeletšwa bo-4 bo-3 bo-2 bitšwa bin Biff8 bewago betha begwa begilwego beeleditšwe bee beakanyetša Bapela bapa bangwe Bangwadi bakwa bahlami BahiriwabaNyakegago B6 B5 B4 Azerbaijani AutoCAD Austria atlegile AtereseyaSekepe AtereseyamoeYago AtereseYaEmeile at ASCII arolwago arogantswego aroganego arogana arcsine arabela araba amanya ALPS Alkorithimi akgofišwa akaretšego akaretše Akanya Afrika Adobe activex About abetšwe abelanwe abelana aba AAA AA A1 Zumu Zumo zu ZTEST Z-Soft zoom Zimbabwe Zhuyini ze YYYY-MM-DD YY-MM-DD YX YURO YunitiyaNomoro Yunibesithi yo-on Yn YIELDMAT YIELDDISC YIELD Yi Yemen yekhwi YEARFRAC YaTšhupetšo YaTšhireletšoyaSelegae YaTšheke YatšeodiDirilwego YaTiišetšoyaKaratayaSekoloto yapampiri yaMošomedi yamorithi YaMogalayaSekepe YaMogalaWagoSepelaleWona YaMogala YaModele YaKgatišo YaKaratayaSekoloto yagrid YaFekse YaBarkhoutu YaAkhaonto XYZ XY XStorable xsltfilter xsltdialog XSL XRowUpdate XResultSetUpdate XQueriesSupplier XPM Xor XNPV XLS80 XLS40 xls XIRR XHTML XDarwin X11 wrtsh WordPerfect wizardname wiše Wiša WinWord97 Winword6 winexplorerext Windows-Johab-1361 Windows-950 Windows-949 Windows-936 Windows-932 Windows-874 Windows-1257 Windows-1256 Windows-1255 Windows-1254 Windows-1253 Windows-1252 Windows-1251 Windows-1250 wildcard WHERE wepesaeteYaka Wela Weierstrass WEEKNUM Webtop wa-web Watšhe wathekontle wašomiša wago W4W vyu VRML VLOOKUP VIM viewer view via Venezuela vektoro VDB vCard vartheta varsigma varrho varpi varphi VARPA varepsilon VARA va utolotšwe utolotswe utollegego Utolla utlui Utilwego UTF-8 UTF-7 Uta USERNAME Uruguay URL2 unset Union undo UK uiview UId UAE Typography type twips twip TWAIN tva Turkey Tunisia Tumelano Tulothwii TULO Tthalathala TTEST tšwilego tšwewa tšwetšwa Tšwetšo Tšwetšapele tšweletšwa Tšweletšo tšweletšeng Tswelela Tšwelego tšweleditšwego tšwelago tšwel Tswantšho tswanelo tswaletswego tswalelwe tswalelege tswalele tswalege tswalane Tswalana Tswakanya tšupetšo Tšubutla Tsotho tsošwe tsošwa tsošološitšwe Tsoša tsoma Tsogo Tsoga tšofala tsi Tshwayo Tshwaya tshwaotshwao tshwao tshwantsho tshwantšhišo Tshupetso-phapantsi Tšhupetšopatlelo tshupetšo Tshupetso tšhupetša tšhupanekgolo Tshupaletlakala Tšhupaditeng Tshuma tšhollwa tšhišinyo tšhireletso Tshireletšo Tšhirego Tšhinyego Tshetlelo Tshese Tshepelo tshepedišomohola tšhentšha tshehla tšhateng tšhaša Tshaeno tšha Tsepelelo Tsepanyeditšwe tsepamišitšwego tsepame tseokeditswego TšeodiDirilwego tseo tsenywatirišong tsenyegago tsentšhwe tsentšhong tsentšego tsentše tseneletšo Tsenelana tsenega tseleng Tsejaneng tšeiwago tšeiwa tšeetšwego tšeelwago tšeele tšeelago tšee tsebšo Tsebo tsebjwago tsebišoY tsebišoX Tsebegago tsebega tsebagatša tseba tšeAmogetšwego tšeago tSaennwe TRUNC TrueVision true Tristate Trinidad TRIMMEAN TRIM TREND Trei Trapezoid TRANSPOSE TOTAL Torus ToropoyaSekepe Toropo-kgolo toolbox toolbars Tomeine Tološetša Tološa Tokumwente Tokumente Boemo tokomaneng tokomae tokologoyaditikiri2 tokologoyaditikiri1 tokologoyaditikiri tokišoy tokišox Tokišeletšo Tokafatšo Tok tobeditše Tlwaetšo tlwaetšego tlwaelegago Tlwaelanyo tlwaelanyago tlwaelane tlošweng tlošwago tlošege Tlola tlogile tlogetšwego tlogelwe tlogelwago tlogele tlogago tlišitšwego tlišitšwe TlišaLetšatšikgwedi tlile Tlhokatekano tlhoba Tlhlokomelo tlhaolo tlhamego tlhalošwa Tlhalosantšu Tlhakantšha Tlhakakgolofatša tlhaka-kgolo Tlhahlong tlhahlelong tlhaelelelo tletšsego tletsego Tlerola Tlemolla tlemelela Tlemano tlemaganya Tlatšwe tlatšwago Tlatšotirišo tlatše tlase-lanngele tlase-lagoja tlamo tlamiwa tlamilwego tlama tlaleletša tlaleleditšwego tlala TITEL tisikithata tisiking TIS-620 tirili tiragatšong TINV tingwa timelwe tikrii tiišitšwego tiišetše tiišeditšwe Tibetan thutong Thupalalo Thunya Thumomoka thulana Thothomela thopo thongweng thongwago thomološwe thomišwe Thomišo thomilego Thomelontle thomelantle Thololo thokong thobego Thlagišo thkong thibetšwego Thibetšwe Thibelo thi thewago thewa thetha Theoleswa Theo thenkgollwa Thempoleti thempoleitiyaLenaneotherolaka thempoleit thempholeiti THEME Thelela thelefomo ThekoYaYuniti ThekoyagoRekiša Thekemiša Thedimoga thebula thebo Theatlele Thealeswa Thapolola thapalatšo thalwathalwa Thaletšwego thadilwego thabula Thaana textconversiondlgs teteano testtool tesekeng Teseke Tenya Tempolete Tempoleite temošoya temana2 temana1 Temaa tema telefaditšwego tekusuto tekolapejana tekisuto tekemišo TekanyoeLefilwego TekanyoeKolotwago TekanyetšoyaThekišoyaDithekišo TekanyetšoyaMotšheloyaDithekišo tekanyetšoyagobeeletšagape Teisi tebanywa Tatelao Tatelano tatelanonyana TARGA Taodišongwalo Tanzania tantšwe TANH TAN Talamorogo-talalerata Tala-morogo-putswa Taiwan Wisate Tagbanwa Tagalog Taetsi Taetšatšhupane tše tabledesign table tabeng Ta Sekgotli Sekgoba T2 T1 Syriac Syria Synaptics Sylk SYD sxc šweu swekere Sweden swayilwego swayile swaye Swayasway swayapeakanyo Swarwa Swaregile sware swantšhwe swantšhwago Swantšhitšwe Swantšhanya swantšhago swanetse swanelwago swanelegilego swanelega swanelago swanelagago swaiwa swailwego swaile svxlink SVXB svdraw Šutišetša Sutisetsa šuthišwe šuthišwago šuthišwa šuthišetšwe šuthišetšwa šuthišega šuthile šuthego šuthago Support šupetšwago šupetšwa SUNWzlib SUMXMY2 SUMX2PY2 SUMX2MY2 SUMSQ SUMPRODUCT SUMIF SUBSTITUTE styleui stw STEYX STDEVPA STDEVA STD stbctrls STATTYP STATEMENT statbar statamente StarView StarOfiice StarObject StarFrameSet StarChannel StarCalcDocument STANDARDIZE Ssc1 SQRTPI SQRT SQL92 Spanish Spain SP Sowivele sotfware SORTMODE Šoro SONTAGA Šomišwa-tlhathollo5 Šomišwa-tlhathollo4 Šomišwa-tlhathollo3 Šomišwa-tlhathollo2 Šomišwa-tlhathollo1 šomišetšwago šomišege šomiše šomilego soment SOLK sokuon sohle SOCKS šoa šma SLOPE SLN skrini SKEW skenwa Šitšwe šitišwa Šišinya šišintšwego širwa širilwe Siriliki Siria Sireletswe šireletše Sireletsa širega Sinhala SINH Singapore Sindhi Sinaptiki SIN šila šhomišo Shift-JIS shells she share SHA1 SGML SGI Sfx sfwk SFP Sezulu se-Zulu se-Xhosa SeWestern Se-Welsh se-Vietnam se-Venda Seutolli SeUkrainian Se-Ukrainia setup SetšweletšwasakaLapeng Setšweletšwa-mmogo šetšwe Setswaledi Setsošološi se-Tsonga setšhabeng Setsenywa setsekana setsego setse Setšatši Setrata SetokoSaDiyuniti Setilwe Sethokgwa Setho Setemere Se-Telugu Setegniki Setebele SeTatar Setalisana sešweu se-Sweden se-Swazi seswanšho Seswanelegi sesupi SESSIONMANAGER SeSpain SeSlovenian SeSlovakian Sešireletši Se-Sardinia SeSankrit sesanesesane seSaense serwadi services servicename Seruthwane serunyi Se-Rumania Seroto SeRomania Seripakatišo Serif SERIESSUM Sererwa šere Seragamabje se-Punjabi sephuthelwa Sepholiši sephiring sephiri Sephatlalatši sepelelane Sepedi se-Oriya Se-Occitan senyega Senomoro sennyane SengwalwasaSele seng Senanyi senago SeMongolia semmušo Semate SeMasedonia SeMaori Se-Malayalam SeLithuanian Se-Lithuania Seletšamegala SeleteSaNaga Šeleng Seleng Selemogi selegae Sele#1 SeLatvian Selatini SeLatin-1 se-Lao Sela SEL Sekrini sekorole Sekmente Sekiša sekirining SeKinyarwanda sekhutlwana Sekhutlong se-Khmer sekgotli Sekgorametšwa sekgorametši sekgoiba SekgobaseoseLegoGona Sekgobafatšo Sekgethi Seketšhe sekete seka-ntshofatšo Se-Kannada sekameng sekamego seka-bofefo Se-Japane Se-Irish Se-Interlingua SeIndonesia se-Hungary Sehlophiši sehlopheng Sehlongwa SehlogosaFilimi SehlogosaAlebamo Sehlilwego Sehlaodi se-Hindi Se-Hangul SeHangarian segora segoleng Se-Georgia segatišwa Se-Galicia Se-Gaelic Se-Frisia SeFinnish sefetoši sefetoledi sefetleking Sefepi Sefediši SeEstonian se-Estonia SeEsperanto Seema Se-Dzongkha sediririšwa sedimoša šedi Se-Dhivehi Se-Dash SeCzech se-Czech SeCroatia SeCatalan SeByelorussia SeBulgaria se-Bulgaria Se-Bosnia sebopegong Seboledi Sebjale-bjale Sebalamatlakala se-Asia searolwa searolo Se-Armenia Searabia SE-ARAB Seamogela seamogedi SeAlbanian script Scotland schedule scanner sbx SB SAXReadFile SAX Saudi samplo Salvador SALFRAME šaletše šalago saka Saga saenwe saenwa saense Saene Rwanda rwala Ruthufala Runya Runtime Runic Rulatsepami Rulathapamo Rulanganya rulaganywe RSQ RSN RRI ROWSTR ROWNAME ROW ROUNDUP ROUNDDOWN rotošitšwego Rotoga romwla romwelwa RometšweKa Romela-Monithara RomelaKarata RoK robegilego RLE ripša Ripela Ringi rile Rico Rica ribbar rhombus Rhaeto-Romance RGB rfc822 Return REPT Repota Rep Renkec renka relationdesign rekotilwego rekota rekhotwa rekhoteng rejistara-nnete Rejistara registry REF readme READ RDB ratwa ratege rate rarollwe Raranego Rapametša RANTA RANK RANDBETWEEN Radiyale radius Rabokgabo QUOTIENT Quickstarter quickstart querydesign Qatar Python-UNO Putswa-serolwana-tsotho Putlile Putlaganyago Punt pulong PULOKWANO Pulete pukung Puerto PTSTR PT154 pt pstack proxy protocol protchk propctrlr projekeng progarama Profešene ProfenseYaNaga PROFENSE productregistration PROB PRICEMAT PRICEDISC preload PR PPOPTŠWSEKGOBA PPMT PPM pp PowerPC potlako Potišiši Posa Portugal Portal Poratšhe poraebete popegp POP3 POP ponyo ponye Pontshop Ponelo Ponalo ponaglo Polyline polokelong Poleiti Polastiki Polasitiki poetšo poelolebelo Poelo2 PNG PMT plugapp Plug pkgadd piyano Pitlagantšwe pitlagana Piramiti Pinyini Pinki-serolwana piletšontle PID PICT piano Phutšego phuthollotšwego Phutholla Phuthilwego Phuthetšwego Phuthelwa phumulwe phumulwago Phumulo phuhlamo Photoshop phostara Phororo Phong Pholosi Phološa Phillipines phihleleo phifadu Phetšheng phetšha phetoso Phetišo phetholo Phetho phethilwego phethegile phethagatšwago phethagatšong Phethagatšo phethagatše phethagala Pheta Phenthakone phema phedišo Phayo phatlolwa Phatlola phatlaladitšego Phathekgo Phathakga Phatalalo phasile pharologanya phaphathi Phaphametsego phapanyo phalago Phakiša Phakete Phaethone phaepe Phadimo PGM Peseta Peru PERMUTATIONA PERMUT PERCENTRANK PERCENTILE PERCENT Per Peo Pentium Penthakone pene peletilwe peleng Pego1 peelo peeletšong Peelano PBM Patronetokogano PATH patelwa PASEKA Parser Parse paretone Parenthesis Parametera Parametara Paraguay Papetšo Panama PaloyaDiyuniti palong PalomokayaMothaladi PalomokaeLetetšwego Palema Palegofela palego-fela palatatelano Palam pakolotšwego pakolle Pakistan pajete pagedlg Paesekopo paenari Pa OWNFORMAT OVER output outliner Oubox Otlologago othometiki othomatiki OtaraYaDiyuniti OS2-869 OS2-866 OS2-865 OS2-864 OS2-863 OS2-862 OS2-861 OS2-860 OS2-857 OS2-855 OS2-852 OS2-850 OS2-775 OS2-737 OS2-437 org2 options OOOLICENSE ooo ONE ompshafatša Omfolopo omeka Oman Oktoboro okthale oketšwago oketšega Oketša-Tloša oketšago okeditšwe-B Okeditšwe-A OK OJ Ogham ods odiyo Nyutherone Nynorsk nykega Nyenyefaditšwe nyana nyalelanago Nyalanya Nyalantšha Nyakisisa nyakilego nyakišitše NyakegakaLetšatšikgwedi nyakatemana nyakakelo Nwelela ntsogošo ntshontshofatšo Ntšho ntšhitše ntšhege ntlheng ntleši ntlentle N-th NT nsetšhaba NPV Noto Notletšwego Not NORMSINV NORMSDIST NORMINV NORMDIST NomoroyaTšhupetšo NomoroyaTšhireletšoyaSelegae NomoroyaTšheke NomoroyatšeodiDirilwego NomoroyaTiišetšoyaKaratayaSekoloto NomoroyaSeriyale NomoroyaMošomedi NomoroyaMogalayaSekepe NomoroyaMogalayaMoromedi NomoroYaMogalaWagoSepelaleWona NomoroYaMogala NomoroyaModele NomoroYaKgatišo NomoroyaKaratayaSekoloto NomoroYaISBN NomoroYaFekse NomoroyaBarkhoutu NomoroYaAkhaonto nomorofatšong nomoro2 nomoro1 nomoreng Nomofatšo Nomoeofatšo Nomnorofatso NOM Nolofatšo Noko noketšwego nokelwago nokelago Nofemere Nodiki nnoto Nnoši nngwelegatong nngwadišetše Nnetel Nne Nkgopotše nke nja Nicaragua ngwalwe ngwalolla ngwalelanago ngwalegago Ngwadiva Ngwadisokgolo ngwadišitše Ngwadfišo ngongoregoy Ngongoregong Ngongorega Ngatana ngangišo NeXT NEWS newa NETWORKDAYS Netherlands Netefatšo netefatše neta net Nescape Nepal Nepagalo nepagala neilwego NEGBINOMDIST NEG nee Nawa navipi Navigator NASD Nanyago nameletša nama nakwan NakoyeseTšerwego NakoyagoThoma NakoyagoFetša NakoyagoEtelaPele NakoYagoeLata Nakotshepedišo NakoeKolotwago nakoe nageng Naganišiša naganelwago NagaleProfenseyaSekepe NagagobaSeletesaSekepe NagaGobaSelete NagaGobaProfenseyaSekepe NagaGobaProfense Nabla Myemyelago Myanmar Mthaladi Tumelelano Tshedimošo Tlwaelanya Phethilwe Peakanyo Mpshafatša Maele Lokiša Lefelo Kgetho Hlokomelo Fetola Feletšwe Dinyakwa Difaele mspha msilanguages mpshanyana mpshafatše mpsaha mphsato Mphsa mpg mpe mov moutung Moutolli Motule Motswalle motšuleng motšheneng MotšhelowagoRekiša motsenyi motsenya Motšeakarolo Motsamaiši Mothunyo mothopo Mothomi Mothoe Mothalonyana mothalontši Mothala Motaele Mošupologo mosesanesesane mosesane Moselana Morunmo Morulagnyi Moromelwa morogo Morocco Morathofatso Moratho moragorago moragonyaka moragobjale Moputso Mophatlalatši mopelong mootleedi monyenyane Monyakišiši Monopo monnyane Monna Monithara Monitara moniker mongweboleng MongwaKarata monggae Monetary MonateMo Monarch Monaco Momaganya Molokoloko Molemogi molebeledi Molaong molagare Mokotlaneng mokopana Mokgwakgokaganyo mokgobo Mokgantšhi Mokgabišo mojako Mohwetši mohuteng Mohutawatirišo Mohutawamothalo MohutaWaGoKhupetša MohutaWaDaete Mohlwaela Mohlomphegi mohlologadi Mohlokomedi Mohlohlomiši mohla mogwera Mogatiši Mogatisi Mofetoledi Mofetodi Moeno Modusekwere modumong modulus modulung module Modulasetulo Modirong modirišii Modiriši E-Meile Modiri Modirelo Modikelabotlalo Modify MOD Moago Mmušong mmuši MMULT Mmerpe mme miter miscdlgs misc1 MIRR MINVERSE minimami MINA migration MIDI MID Microsotf mhlo Mexico metsotsong metšo metšhene metriksi Metrikse metheogo methalomentši Methaladitee metha metelele Metaga MET meswa Mesebe-B Mesebe-A Meriti meokgo Menopo Mene Memorantamo Mekhuri Mei Mehuta-huta mehleng Mehlalaa Megolo megala Medumo MediroyaBašomedi MEDIAN mebotšule Mebalabala ME MDURATION MDI MDETERM MD5 maxnum MAXA Max Matšoba Matšhe matsetseleko MATŠATŠIANGWAGENG MATŠATŠIAKGWEDING MATŠATŠI360 Matlakalantši Matlakalantsi Matlafatšago Matlafatša mathomo-thomo MathML materiale maswaralefelo maswaong maswa mašaledi Mašakanathota Marothodi Marathi Marara maphoto Manyokenyoke manyami Mantsu Manipuri mananeothero Mananeotheko manager Mametla mamatletšwe Mamatletša Mamatlela mamaretšo Malete Malasia maksimamogo makopana makgwakgwa Makenete Makalo makae Majinalia Maitirelo maithomedi Maithekgo maitemogelo MainaABana MAILTO Mailš mail mahlo Mahlakore-mabedi Magomokgakgano magenta magatwana magatong Magahlano mafsa mafoko mafelong mafelokelelo Mafelo-beke mafapanyi Madume madimabe Maddin2 Maddin1 Macau Macao Mabolo Ma LZW lwkanego Ltd Lst LS LRU lota Lomanago lomaganywa lokologa lokišwago Lokisša lokišetšwa lokišetše lokilego Lokia Loketše lokelwa lokeleditšwe lokele loka LogYagoItšhidulla LogYaDaete LOGNORMDIST LOGINV LOGEST Logagantšwe LOG10 local lobja LN List Lira LINEST Liechtenstein Libya libemp lewatleng lewatle letsogong Letšoba letseno LETŠATŠILAMOŠOMO Letšatšilamatswalo LetšatšikgwediNako LetšatšikgwedileseTšerwego LetšatšikgwedileeTlišitšwego LetšatšikgwedileeRekišitšwego LetšatšikgwedileePomilwego LetšatšikgwedileeNyakegago LetšatšikgwediLeEKopantšwego LetšatšikgwedileaHirilwego LetšatšikgwedilaSekepe LetšatšikgwedilaOtara LetšatšikgwedilagoFetša LetšatšikgwedilagoeLata LetšatšikgwedilagoDiraSekoloto Letšatšikgwedi2 Letšatšikgwedi1 letša Lethale Letetše letelele letata leta Leswaotlhaboši Leswaotlhabosi Leswao9 Lešela Lešata Leru Lerothwane Lerothi Lerontho Lerato Leratadima Lepokisana Lepeletšego Lepeletša Lentšuphetiši Lentsu lentši LenseeDirišitšwego lengwalophatlalatšwa Lengwalko lenaneo Lenane2 LEN lemogwego lemogilwego LelokeleloLaGoRomela lelela lekotšwe lekopana lekilwe Lekgwara lekeletšego lekeletše lekanywa lekanyetšwego lekantšhe Lekannya lekanetšwago lekanetše Lekanathwii lekanango Leka-lekanya Leisara Leina-telele Leina-sesomo LeinaleTlwaelegilego LeinalaTiragalo LeinalaSekepe LeinaLaPele LeinaLaNgwana LeinaLaMolekane LeinaLaMagareng Leinala Leinakgaotši Lehlwa Lehlaodi Lehlalošetšagotee lehlakoreng Legong Legatoi Legapi Legadima lefšwago lefšwa Lefokisi LefišwagoMotšhelo lefilwego Lefestere lefesetereng lefelotshwaro LefeloleTšerwego Lefelolatswalo lefelegago LEFELA Lefeeela lefase leele Leefela Lediri Leboto Lebone lebogiša leboga Leboa-Bohlabela Leboa-Bodikela Leboa lebišwa lebišitšego lebeletšwego lebelelwe lebelele lebelelatokišo lebelega Lebanon Lebana LCM lbeilwego Latšatši Latlakala Lathe latetago Latelela latele Latelantšha latelanago latediša lapološwe Lapa laolwa laollwa laollotše Laka laiva lahlwa Lahlele Lahlela lahlegilego lahlege lahle Lagoja-go Laetšo Laetšha laetše Laetsa Labala Kuwait kurtosis KURT kudu-kudu Kube Kua-Hong ku kotsi kotara kopišetšwa Kopišadipoelo kopantšha Kopanelo kopanego Kopanaya kopanat kopanafatšwago kopanafatšwa Kopanafatša Konteraka Konkani kolotwago koloba Kokobatšo Koketšso KoketšoItiriša Koketšo-A Koipanaya KOI8-U KOI8-R Kobilwego Kn km klike Klaemete Klabere Kišofase Kiopanya ki Khwibidu-talalerata Khwateratiki Khutšofatšo khutšišitšwe Khutšiša Khutlwaneng Khutlwana Khutlopedi Khutlonnr Khutiša khutilego khupu khulwana Khubiki KhoutuyaPoso Khouni khotlwa khomputa Khomponente khomolo Khombo kholomotee Kholofelo khipoto Khesaratebanyi Kheromiyamo Kheraeteria Khepetlele Khaontara khansetšwe khalentara khalendra kgotsofaditšwego kgotsofaditšego kgotleng Kgotlelelo Kgotlelelano Kgorometša Kgoro kgorameditšwe Kgopotšo kgopetswego kgopamišwe kgonwe kgontšwe kgontšhollotšwe kgonthišetše kgonago kgonagatše kgonagalwe Kgomatetša Kgomaretšo Kgomaretšadifiwa kgomanywa Kgomagano Kgolonyana kgolokgolo kgokolla kgokellwa kgokanyikgolo kgokantšwego Kgokaganyi kgokaganye kgokagantšwego kgokaganong Kgobokeditšwe Kgobokanya Kgobetšwe kgethwe Kgethontši Kgetholla Kgethio kgauswana kgatišong kgateng Kgatelo Kgarametša kgapele kgaotšwego kgaotšamothalo Kgaotšaletlakala kgaolomothopo kgaoletšago kgaolele Kgaolela kgaoleditšwego Kgaole Kgantšha kgakollolo kgahlanong kgahlano kgagollofase kgafetšakgafetša KEYWORDS ketšišo ke Letšatšikgwedi ke Letšatši Kernel Kerene kerekeng Kenya KENGWAGAMOLELE Kelomoka kelelong Katološo Katologanyo Katoganyo Katanaka Kashmir Kasak karabelo kaone kaonafatšo Kanxi kanji Kanbun kamorago kamohlala Kalari kakaretšong kagong kadilwego Kadilwe kadietšego kabago Julae JPG Jordan Jn je Javascript javafilter JAR Japanese Janaware James Jamaica iya ivf itshola itšeng itsebiša itriša itokišeleditše itlwaetše itlamile itiriše itima ithekgago itheilego iteration items1 items Italy itaiji itahlele išwa ISTEXT IssueZilla ISREF ISPMT ISODD ISO-8859-9 ISO-8859-8 ISO-8859-7 ISO-8859-6 ISO-8859-5 ISO-8859-4 ISO-8859-3 ISO-8859-2 ISO-8859-15 ISO-8859-14 ISO-8859-13 ISO-8859-11 ISO-8859-10 ISO-8859-1 ISO-2022-KR ISO-2022-JP ISO-2022-CN ISNONTEXT ISNA ISLOGICAL ISEVEN ISERROR ISERR ISBLANK IRR irilwe Ireland Iran ipshina IPMT IPA IP intro INTRATE interface INTERCEPT INT INSTALLDIR INSRT Inšorilwe ingwadiši ingwadišago INDIRECT index Indeo IMSUM IMSUB IMSQRT IMSIN IMREAL IMPRODUCT IMPOWER importwizard IMLOG2 IMLOG10 IMLN IMEXP IMDIV IMCOS IMCONJUGATE IMARGUMENT IMAGINARY IMABS Ileditšwego ikwe ikwa Ikgokaganyago Ikgethelwago iketlile ikemišetšwa ikemela ikarabelago Ikarabela ifonto If IDyaTiragalo IDyaThušo IDyaTefo IDyaSenepe IDyaSemela IDyaResipe IDyaPuku IDyaProjeke IDyaPhapoši IDyaOtara IDYaMotho IDyaMoswananoši IDyaMošomedi IDyaMorekiši IDyaMoreki IDyaMongwadi IDyaMokgwawaSekepe IDyaMokgwawagoRomela IDyaModiro IDyaModirelwa IDYaLog IDyaLenaneotheko IDyaLeloko IDYaLelokeleloLaGoRomela IDyaLefa IDyagoIša IDyaFilimi IDyaDitshenyagalelo IDyaBoemo IDYaBaoOKaIkgokaganyagoLeBona IDyaAterese IDyaAkhaonto IDE Icelandic ia hyu HYPGEOMDIST HYPERLINK hypergeometric HYP hwetswe hwetšege hwetšasengwalwa HwetšaPhošoeFetilego hweditše Hunyela humanega huduša HTTPS HSQL Hong Honduras homotšego Homotša holega hoko hlophiwa hlophe HLOOKUP hlompha hlomiwago hlomiwa hlome hloma Hlokolomoga hlokege hlokago hlohleletšago hlogwaneng hlobogilwe Hlkogo Hlatloša Hlatlosa hlathollago hlaotšwego hlaolwe hlaološitšwego hlaolo hlaoila hlamilego hlameng hlamege hlalošwe hlalošitšwe Hlalošiša Hlalosisa hlalolago Hlakilego hlakantšheng hlakanela hlakane hlakahlakantšhago hlakahlakane hlaka-hlakana hlahloba hlahlelong hlahlelege hlahlago hlagišwago hlagišitšwego hlabolla hh HEX2OCT HEX2DEC HEX2BIN heksatesimale Heksakone heksadesimale Hebrew HARMEAN hardware Hanunoo Hanjul Gurmukhi Guilder gui Guatamala grid gray graphicfilter Gouraud gotšwa gotšhupetšo gotetša Goswa Gosub gorošitšwego Gorapama gopotša Golokile gologolo golago Gokgaolwa goi gohlegohle Gohle gogago gofe goemela goe godišwa godimo-lanngele godimo-lagoja GoBewaNakonggaLetšatšikgwedi gobai GOALSEEK Glogwana globdoc glibc2 gkale ghost GESTEP Germany GEOMEAN Genus Genre GDI GCD GBT-12345 GBK GB-2312-80 GB-2312 GB-18030 GB Gauta GAUSS gatišego gatisego Gatišegago gatišega Gatisa gateletšwego gatelelwago Gatelelwa Gatela gašana garegare garefaditswe gaologilego gao ganyenyane-ganyenyane gane GAMMALN GAMMAINV GAMMADIST Galoša gallery2 gakaone gagolo gaelekane G3 fyu FVSCHEDULE FV Functions FUNCTION FullName FTEST ft frmdlg FREQUENCY freime France framework Founu FOUND fototšwe fotogile fosagetse fošabetšego Foromo-B formwizard formdlg FORMAT form Foriza Foreimela Foreiemetebanywa Foramo Fora Footer FontName fomuleng Fometwa fomatilwego Fomatilwe fomatetšwe Fomatekgokaganyi Folikhara Foleshe Foleše Foleša fokotšwe Fokotšegago fokola fokoditše fokodišwa fokodiša Fofiša Foamate fmtui fmcomp fldui Fldr fiwe fiwago FISHERINV FINV Filwe Filwe FiltharaeDirišitšwego filters FilimiyaMmala FILENAME fihlwa fihleletšwego fihlelelwa fihlelelege fihlelela Fifatša FIELDTITLE FIELDNAME2 FIELDNAME1 fetše fetšago fetotše fetošwa Fetošsa fetošege fetošeditšwe Fetoše fetolewago fetoleng fetolelana fetolana fetolago fetogela fetoge Fetlekela fetleke fetišetšwe fetišetše Fetilegot fetela fetego fete ferla Felola felelwa fegilwego fegilwe fedišwe fediše fedilego Febereware Feb fe FDIST FC FAXSE Farsi Faroese FAR fapenego fapantšhe Fapantšhago Fapantsha fapanegole Fanele fanago FamilyName Fale FACTDOUBLE FACT F9 F4 EXT Express EXPONDIST EXP exe EXACT EVEN European eupsa EUC-TW EUC-KR EUC-JP EUC-CN etlogaeleenyenyanego etla Etile Ethopic etetšego etelwago etellago Esekudo ERFC ERF Equador EPSI eppm epict epgm epbm eos2met EOMONTH EOF Enyaka envelp Entšine enkriptilwego engine3d Enela Endif emp emišwe emišwa emelwa emela e-meilel emego EM elwa Else Ellipsoid eletšwe Elelmente Elektroniki El ekišwa eItiragalelago Eire egif Egepeta efoga EFFECTIVE editeng edirilwego EDATE DVD DVARP DVAR dumelelwego duma du Dtshwao Dthepe dtappintegrate-u-s dtappintegrate DSUM DSTDEVP DSTDEV Drive drawfunc Drachma DPRODUCT Dpeakanyo Dot Dom DOLLARFR DOLLARDE docvw docshell dochdl dlged DiyunitiTšeOtarilwego DiyunitiSetokong diyuniti di-XSLT diX ditwatši Ditumanoši ditšwetšopele Ditsopolwa Ditsopolo Ditshwaotshwao Ditshwao Ditshwaelo Ditšhupo-B Ditšhupo-A Ditšhupetšwana ditšhupetša Ditšhupane ditšhuma Ditšhuana ditshepediši Ditshenyegelo Ditshehlo Ditshate ditšhašo Ditsebi ditomatsebe Ditokologo Ditlošo Ditlošabodutu Ditllhaka ditlkahakgolo Ditlhokomelo Ditlhaolo ditlhalošo Ditlhakapele ditlhakantšhong ditlhakantšho Ditlhahli ditlhaedi Ditlha ditlankana Ditlamafatši Ditiragatšo ditiragalong ditikologong Ditifikeiti Dithuši dithupana Dithulusi Dikgetho Kakaretšo Dithulusi Dikgetho Inthanete Poso dithulaganyo dithotong dithiki ditheko dithapalalo Dithaka dithaele ditesimale Ditepisi ditekelelo Ditebo ditebišo Ditakaletšo Ditaetšo Ditaba Poso di-taba diswa Distiller di-slide dišere disepediši Disemere diseleng disegmente DISC disampole Dirula Dirubi Diroses dirlwego diriswe diriswa Dirišolla dirišetšwe dirišetša dirišanago Diripagare diretšwego Diresipe direng direlwa direkhotong diregilego direge diragetšego diragatše Diragape Diragaditšwego Dipulete dipuku Diprotšeke Diporiki dipopego dipolygon dipolakeng dipogelo Dipoeletšo diplug-in Di-pixel diphutheding diphuthana Diphumulo diphuhlamo diphošollo Diphokotšo Diphifatšo diphetšhe diphetse diphetogpdi diphesente Dipharologanyo diphapogo Diphae Dipetšhe dipeonakong dipatelwa Di-parameter Dipara dipalophatlo Dipalamonwana Dipakana dipaete diomfolopo dinyenyane dintsi Dintlheng DintlhatšaLenaneotheko DintlhatšagoOtara Dintlhakgaotšo dinomorong dinomorofatšo dinolofatši Dingwalwana dingwadisokgolo Dingwadfiso dingongoregong Dingbats dingangišano Dinepe Dinawa dimpshafatšo dimpsha Dimotšule Di-moniker dimodule Dimethafaele Dimela Dimatrikse Dimaraka dilomaganyi Dilokelwa dillaga Dilekanyo Dilatedišiši Dilaeborari Dilaboratori dikwano dikuranta dikoti Dikotara dikopanyo dikopano Dikontraka Dikonope Dikološsa dikolo dikliki Dikiriti Dikhutšofatšo Dikhutlwana Dikhutlotharo Dikhutlonne Dikhupu dikhunyelo dikhoutu Dikhouto Dikhoni Dikhomputa dikholomong dikheraetheria dikgopelo dikgopamo dikgomaretšwa dikgomaretši Dikgomagantšho Dikgokanyo dikgokanyio Dikgokanyikgolo dikgokaanyi dikgohlano DikgobatšeodiLegoGona Dikgethegilego dikgatonyana dikgatelelo dikgaotša Dikemelo dikatišo dikarolwa dikanale dikabo dikabelo DijoDife DiiriTšeRobetšwego Diiri Dihlophiši dihlomo DigramoMakhura Diforomo-A Difontemotheo Difolaga Difoka DIFIWADEVSEKGOBA DifilimitšaMiniatšhara difetleking difetleki difere Difepammele difekse difegelwana diexes di-engine di-ekhoišene Dieakhone didraeveng didraeve Didiriši Didikadikwe di-dijithale dibolumong Dibloko Di-bitmap DIBEKETŠANGWAGENG Di-Bar Dibaloni Dibaka diatla diatereseng Diarolo Diareka diarea Diapolete Diakhaonto Diaekhone dia dhi DGET DEVSQ Devanagari Deseke DESC DepositieLetetšwego DEGREES DEC2OCT DEC2HEX DEC2BIN ddikgetho DDEML DDB DCOUNTA DCOUNT dbui dbpilots dbhhelp dbgui dbf DatabaseEngine Darusalam Da currentdate Crrency crashrep covariance Costa COSH COS CORREL Coptic contnr Combo COMBINA COMBIN Colombia CMYK CLOB Clipboto Client Clark Cl chrdlg cho-on CHL CHITEST China Chile CHIINV CHIDIST Cherokee Chart Charcoal CHAR Ch CEILING CD-ROM Cc Carribean Can CALCULATEDFUNCTION C65 C6 C5 C4 byu butše bušeditšwe buše bulwago bulege bulega Buhid Budulela Brunei browser Brazil Braille Box Boviolet botwego Botswana botsothwa Botšišwago botšišwa botšišitšwe boto Botlaseng Botlalonyane botlalakgolo Bothekgo Bothatakakaretšo Bošupa bošoro Boserolwana Bosenyane Boselela Borwa-Bohlabela Borwa-Bodikela Boreletšana Boraša bopwa Boporaefete Bopomogo Bopomofo bopiwe bopiwago bophelong bopetšwe bopegago Boomerang bonwego Bonwago bontšitšwe Bontshitswe Bontšhi BontšhaHID Bontšhadiphethogo bonolwanaš bonalego bonago bonagatšwago bonagatšego bonagatše bonagalo bonagaditšwego bolokago Bolivia bolitirišo boletšwe boleta boleletšwego bolaodi Bokmål Bokhwibidu bokgobopuku bokgauswi Bokgabo bokafaseng Bokafase BOITSHEPO boitlamo boithomedi boithekgong boiteko BoingwadišobjaNagabjaSekepe boineelo boikokobetšo Boiketlo Bohwibidu Bohwefe Bohlano Bohlami bohlaba bogologolo BogolobjagoGatiša Boglo Bogela bofelong bofe Bofa boeletšwe boele Bodikelatšatši boago boaakang bo-5 bo-1 BLOB bjbj bjaY bja Lepatlelo Bjaloka bjalebjale Bipollela BINOMDIST BIN2OCT BIN2HEX BIN2DEC Biletša bilego BigInt BIG5-HKSCS Big5 biditšwe Bibliokragi bibliography Bhutan bewe bevel Bethile BETAINV BETADIST BESSELY BESSELK BESSELJ BESSELI Bengali Belize bekapo beiwago begilego beeletša beakanywago beakanyeng Beakanyalefsa beakanyago Bcc Batswadi batsenyaseatla batheetši baswa bastyp Basque bašomiši basicide Basadi BAS barerišani bareng Bareki Barasetlabelo bapilego Baphatlalatši Bapetše bapetšanago bapelana Bapatša Banna balega-fela balega-feela Balebeledi bale Balamago bala-fela BalaA Bala2 Bala1 bakilego bakile bakago BaJagoMerogo baj BAHTTEXT Baht Bahrain Bagwera baekanyolla BACKUPNAME Šireletša axis Axial awt avi AVERAGEA AVEDEV Australia AU Atresepuku atrese atlegilego atlegago atlega Atišago atereseng Aterere ATANH ATAN2 ATAN Assami ASP ASINH ASIN ASC Arotšwe arosine arolelanwago arole arogilego aroganye arogantšwe Argentina Arccotangent arccosine Arabia arabetše Aquawm AppType Apple's appl Aporele Apoleteng Apolete API Apha Apetšhara animations anegago Andale analysis AMORLINC AMORDEGRC AmogetšweKe amogelwago amogelega Amiga Amerika Amegilego Amantšha Alikorithimi algorithm Algerian Aleph akgokanyikgolo akareditšwe akareditršwego Akanywago AIFF Ah Agostose AG Aesoselese ADDRESS ADD ActiveSync ACOTH ACOT ACOSH ACOS ACCRINTM ACCRINT accel Abulela absolute ABS abpilot abelwe abelwa abele abelanwago abelanago abc Abaganya Aabaganya A5 A4 A3 A2 A0 3D 2D dict-ns-20070206.orig/nso/VERSION0000644000175000017500000000001110562150175014567 0ustar dokodoko20060120 dict-ns-20070206.orig/nso/ChangeLog0000644000175000017500000000033010562150175015275 0ustar dokodoko2006-01-23 Dwayne Bailey * myspell/ns_ZA.aff: convert to iso-8859-15 2006-01-20 Dwayne Bailey * Build: everything - build structure setup for Northern Sotho dict-ns-20070206.orig/nso/COPYING0000644000175000017500000006347610562150175014602 0ustar dokodoko GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! dict-ns-20070206.orig/nso/CREDITS0000644000175000017500000000016710562150175014553 0ustar dokodokoDwayne Bailey Creation of the Northern Sotho build framework Translators of OpenOffice.org dict-ns-20070206.orig/nso/Makefile0000644000175000017500000000121710562150175015170 0ustar dokodoko# this makefile is used to automate building of dictionaries # based on affix files etc... # if you need to adapt this Makefile for another language, # all you should have to do is change these variables. # if you need to change anything else then change it in Makefile.languages LANG=ns LANGNAME=Northern Sotho LANGNAMELOW=northern-sotho REGION=ZA REGIONNAME=South Africa # The input wordlists WORDLIST.IN=$(shell ls wordlists/wordlist.*.in) # Change these if your language is not defined in OpenOffice otherwise defaults # to the values you set in $LANG and $REGION #LANG_FAKE=it #REGION_FAKE=IT CHARSET=iso-8859-15 include ../utils/Makefile.language dict-ns-20070206.orig/utils/0000755000175000017500000000000010562150536014071 5ustar dokodokodict-ns-20070206.orig/utils/.svn/0000755000175000017500000000000010562150176014755 5ustar dokodokodict-ns-20070206.orig/utils/.svn/text-base/0000755000175000017500000000000010562150175016650 5ustar dokodokodict-ns-20070206.orig/utils/.svn/text-base/configure.svn-base0000444000175000017500000000476110562150175022277 0ustar dokodoko#!/bin/sh # Note: future version will have a syntax something like # ./configure [OPTIONS] # Where OPTIONS is any of: # --help # --codes CODE1 ... # --sizes SIZE1 ... # --jargons JARGON1 ... # --extras EXTRA1 ... # --vars VAR1=VAL1 ... # which is why I warn when --vars is not used before VAR1=VAL1 # Avoid depending upon Character Ranges. # Taken from autoconf 2.50 cr_az='abcdefghijklmnopqrstuvwxyz' cr_AZ='ABCDEFGHIJKLMNOPQRSTUVWXYZ' cr_09='0123456789' cr_alnum=$cr_az$cr_AZ$cr_09 # also taken form autoconf case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in *c*,-n*) ECHO_N= ECHO_C=' ' ECHO_T=' ' ;; *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; *) ECHO_N= ECHO_C='\c' ECHO_T= ;; esac mode=none for option do case $option in --vars) mode=vars ;; *=*) if test $mode != vars; then echo "Warning: future versions will require --vars before variables are set" mode=vars fi # Taken from autoconf 2.50 envvar=`expr "x$option" : 'x\([^=]*\)='` optarg=`expr "x$option" : 'x[^=]*=\(.*\)'` # Reject names that are not valid shell variable names. expr "x$envvar" : ".*[^_$cr_alnum]" >/dev/null && { echo "$as_me: error: invalid variable name: $envvar" >&2 { (exit 1); exit 1; }; } #echo $envvar $optarg optarg=`echo "$optarg" | sed "s/'/'\\\\\\\\''/g"` eval "$envvar='$optarg'" export $envvar ;; --help) echo "Usage: ./configure [--help | --vars VAR1=VAL1 ...]" echo " Note: Variables may also be set in the environment brefore running config" echo " Useful vars: ASPELL ASPELL_PARMS WORD_LIST_COMPRESS DESTDIR" exit 0 ;; *) echo "Error: unrecognized option $option"; exit 1 ;; esac done #echo $ASPELL if test x = "x$ASPELL" then ASPELL=aspell; fi if test x = "x$WORD_LIST_COMPRESS" then WORD_LIST_COMPRESS=word-list-compress; fi #echo $ASPELL echo $ECHO_N "Finding Dictionary file location ... $ECHO_C" dictdir=`$ASPELL dump config dict-dir` echo $dictdir echo $ECHO_N "Finding Data file location ... $ECHO_C" datadir=`$ASPELL dump config data-dir` echo $datadir echo "ASPELL = `which $ASPELL`" > Makefile echo "ASPELL_FLAGS = $ASPELL_FLAGS" >> Makefile echo "WORD_LIST_COMPRESS = `which $WORD_LIST_COMPRESS`" >> Makefile echo "DESTDIR = $DESTDIR" >> Makefile echo "dictdir = $dictdir" >> Makefile echo "datadir = $datadir" >> Makefile echo >> Makefile cat Makefile.pre >> Makefile dict-ns-20070206.orig/utils/.svn/text-base/README.myspell-mozilla-xpi.svn-base0000444000175000017500000000044110562150175025171 0ustar dokodokoTo build a MySpell spellchacker packed as an XPI for Mozilla we need an install.js file. install.js.in - is a generic template file used by the spellchecker framework. This file was obtained from the British English spellchecker: http://downloads.mozdev.org/dictionaries/spell-en-GB.xpi dict-ns-20070206.orig/utils/.svn/text-base/install.js.in.svn-base0000444000175000017500000000172510562150175023001 0ustar dokodoko// Spell checking dictionary for Mozilla Thunderbird // Script written by rockstiff. Dictionary from openoffice.org const APP_DISPLAY_NAME = "{LANGNAME} ({REGIONNAME}) dictionary"; const APP_NAME = "spell-{LANG}-{REGION}"; const APP_PACKAGE = "dictionaries.mozdev.org/spell-{LANG}-{REGION}"; const APP_VERSION = "{VERSION}"; var err = initInstall(APP_NAME, APP_PACKAGE, APP_VERSION); if (err==SUCCESS) { // Copy files to Components/myspell var myspell_folder = getFolder("Components", "myspell"); addFile(APP_NAME, "{LANG}-{REGION}.dic", myspell_folder, ""); addFile(APP_NAME, "{LANG}-{REGION}.aff", myspell_folder, ""); addFile(APP_NAME, "README-{LANG}-{REGION}.txt", myspell_folder, ""); err = performInstall(); if(err == SUCCESS || err == 999) { alert(APP_DISPLAY_NAME+" (v "+APP_VERSION+") has been succesfully installed.\n"); } else { alert("Installation failed. Error:" + err); cancelInstall(err); } } else { cancelInstall(err); } dict-ns-20070206.orig/utils/.svn/text-base/munch.c.svn-base0000444000175000017500000005112010562150175021640 0ustar dokodoko/* Munch a word list and generate a smaller root word list with affixes*/ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "munch.h" int main(int argc, char** argv) { int i, j, k, n; int rl, p , nwl; int al; FILE * wrdlst; FILE * afflst; char *nword, *wf, *af; char as[(MAX_PREFIXES + MAX_SUFFIXES)]; char * ap; struct hentry * ep; struct hentry * ep1; struct affent * pfxp; struct affent * sfxp; /* first parse the command line options */ /* arg1 - wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; parse_aff_file(afflst); fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } if (load_tables(wrdlst)) { fprintf(stderr,"Error building hash tables\n"); exit(1); } fclose(wrdlst); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { numroots = 0; aff_chk(ep->word,strlen(ep->word)); if (numroots) { /* now there might be a number of combinations */ /* of prefixes and suffixes that might match this */ /* word. So how to choose? As a first shot look */ /* for the shortest remaining root word to */ /* to maximize the combinatorial power */ /* but be careful, do not REQUIRE a specific combination */ /* of a prefix and a suffix to generate the word since */ /* that violates the rule that the root word with just */ /* the prefix or just the suffix must also exist in the */ /* wordlist as well */ /* in fact because of the cross product issue, this not a */ /* simple choice since some combinations of previous */ /* prefixes and new suffixes may not be valid. */ /* The only way to know is to simply try them all */ rl = 1000; p = -1; for (j = 0; j < numroots; j++){ /* first collect the root word info and build up */ /* the potential new affix string */ nword = (roots[j].hashent)->word; nwl = strlen(nword); *as = '\0'; al = 0; ap = as; if (roots[j].prefix) *ap++ = (roots[j].prefix)->achar; if (roots[j].suffix) *ap++ = (roots[j].suffix)->achar; if ((roots[j].hashent)->affstr) { strcpy(ap,(roots[j].hashent)->affstr); } else { *ap = '\0'; } al =strlen(as); /* now expand the potential affix string to generate */ /* all legal words and make sure they all exist in the */ /* word list */ numwords = 0; wlist[numwords].word = mystrdup(nword); wlist[numwords].pallow = 0; numwords++; n = 0; if (al) expand_rootword(nword,nwl,as,al); for (k=0; kkeep = 1; if (pfxp != NULL) add_affix_char(ep1,pfxp->achar); if (sfxp != NULL) add_affix_char(ep1,sfxp->achar); } else { ep->keep = 1; } } else { ep->keep = 1; } } } /* now output only the words to keep along with affixes info */ /* first count how many words that is */ k = 0; for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) k++; } } fprintf(stdout,"%d\n",k); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) { if (ep->affstr != NULL) { fprintf(stdout,"%s/%s\n",ep->word,ep->affstr); } else { fprintf(stdout,"%s\n",ep->word); } } } } return 0; } void parse_aff_file(FILE * afflst) { int i, j; int numents = 0; char achar = '\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; i = 0; ff = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { fgets(line,MAX_LN_LEN,afflst); mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d\n",numpfx,ptable[numpfx].num); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d\n",numsfx,stable[numsfx].num); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* search for a prefix */ void pfx_chk (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strncmp(aent->appnd, word, aent->appndl) == 0) && tlen + aent->stripl >= aent->numconds) { if (aent->stripl) strcpy (tword, aent->strip); strcpy((tword + aent->stripl), (word + aent->appndl)); /* now go through the conds and make sure they all match */ cp = (unsigned char *) tword; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { tlen += aent->stripl; if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = aent; roots[numroots].suffix = NULL; numroots++; } } } } } } void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag) { struct affent * aent; int tlen; int cond; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { if ((cpflag & XPRODUCT) != 0 && (aent->xpflg & XPRODUCT) == 0) continue; tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strcmp(aent->appnd, (word + tlen)) == 0) && tlen + aent->stripl >= aent->numconds) { strcpy (tword, word); cp = (unsigned char *) (tword + tlen); if (aent->stripl) { strcpy ((char *)cp, aent->strip); tlen += aent->stripl; cp = (unsigned char *)(tword + tlen); } else *cp = '\0'; for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = pfxent; roots[numroots].suffix = aent; numroots++; } } } } } } void aff_chk (const char * word, int len) { int i; int j; int nh=0; char * nword; int nwl; if (len < 4) return; for (i=0; i < numpfx; i++) { pfx_chk(word, len, ptable[i].aep, ptable[i].num); } nh = numroots; if (nh > 0) { for (j=0;jxpflg & XPRODUCT) { nword = mystrdup((roots[j].hashent)->word); nwl = strlen(nword); for (i=0; i < numsfx; i++) { suf_chk(nword,nwl,stable[i].aep, stable[i].num, roots[j].prefix, XPRODUCT); } free(nword); } } } for (i=0; i < numsfx; i++) { suf_chk(word, len, stable[i].aep, stable[i].num, NULL, 0); } } /* lookup a root word in the hashtable */ struct hentry * lookup(const char *word) { struct hentry * dp; dp = &tableptr[hash(word)]; if (dp->word == NULL) return NULL; for ( ; dp != NULL; dp = dp->next) { if (strcmp(word,dp->word) == 0) return dp; } return NULL; } /* add a word to the hash table */ int add_word(char * word) { int i; struct hentry * dp; struct hentry * hp = (struct hentry *) malloc (sizeof(struct hentry)); hp->word = word; hp->affstr = NULL; hp->keep = 0; hp->next = NULL; i = hash(word); dp = &tableptr[i]; if (dp->word == NULL) { *dp = *hp; free(hp); } else { while (dp->next != NULL) dp=dp->next; dp->next = hp; } return 0; } /* load a word list and build a hash table on the fly */ int load_tables(FILE * wdlst) { char * ap; char ts[MAX_LN_LEN]; /* first read the first line of file to get hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wdlst)) return 2; mychomp(ts); tablesize = atoi(ts); tablesize = tablesize + 5; if ((tablesize %2) == 0) tablesize++; /* allocate the hash table */ tableptr = (struct hentry *) calloc(tablesize, sizeof(struct hentry)); if (! tableptr) return 3; /* loop thorugh all words on much list and add to hash * table and store away word and affix strings in tmpfile */ while (fgets(ts,MAX_LN_LEN-1,wdlst)) { mychomp(ts); ap = mystrdup(ts); add_word(ap); } return 0; } /* the hash function is a simple load and rotate * algorithm borrowed */ int hash(const char * word) { int i; long hv = 0; for (i=0; i < 4 && *word != 0; i++) hv = (hv << 8) | (*word++); while (*word != 0) { ROTATE(hv,ROTATE_LEN); hv ^= (*word++); } return (unsigned long) hv % tablesize; } void add_affix_char(struct hentry * ep, char ac) { int al; int i; char * tmp; if (ep->affstr == NULL) { ep->affstr = (char *) malloc(2*sizeof(char)); *(ep->affstr) = ac; *((ep->affstr)+1) = '\0'; return; } al = strlen(ep->affstr); for (i=0; i< al; i++) if (ac == (ep->affstr)[i]) return; tmp = calloc((al+2),sizeof(char)); memcpy(tmp,ep->affstr,(al+1)); *(tmp+al) = ac; *(tmp+al+1)='\0'; free(ep->affstr); ep->affstr = tmp; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if (k > 0) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/.svn/text-base/README.svn-base0000444000175000017500000001036710562150175021252 0ustar dokodokoThis directory contains code from myspell relevant to processing dictionaries (currently just the munch and unmunch utilities). The code was taken directly from http://lingucomponent.openoffice.org/MySpell-3.zip We have copied it here to make building dictionaries easier The README from myspell follows ; for more information see Makefile You can run munch or unmunch to get command line help -------------------------------------------------- MySpell is a simple spell checker that uses affix compression and is modelled after the spell checker ispell. MySpell was written to explore how affix compression can be implemented. The Main features of MySpell are: 1. written in C++ to make it easier to interface with Pspell, OpenOffice, AbiWord, etc 2. it is stateless, uses no static variables and should be completely reentrant with almost no ifdefs 3. it tries to be as compatible with ispell to the extent it can. It can read slightly modified versions of munched ispell dictionaries (and it comes with a munched english wordlist borrowed from Kevin Atkinson's excellent Aspell. 4. it uses a heavily modified aff file format that can be derived from ispell aff files but uses the iso-8859-X character sets only 5. it is simple with *lots* of comments that describes how the affixes are stored and tested for (based on the approach used by ispell). 6. it supports improved suggestions with replacement tables and ngram-scoring based mechanisms in addition to the main suggestion mechanisms 7. like ispell it has a BSD license (and no advertising clause) But ... it has *no* support for adding words to a personal dictionary, *no* support for converting between various text encodings, and *no* command line interface (it is purely meant to be a library). It can not (in any way) replace all of the functionality of ispell or aspell/pspell. It is meant as a learning tool for understanding affix compression and for being used by front ends like OpenOffice, Abiword, etc. MySpell has been tested under Linux and Solaris and has the world's simplest Makefile and no configure support. It does come with a simple example program that spell checks some words and returns suggestions. To build a static library and an example program under Linux simply type: tar -zxvf myspell.tar.gz cd myspell2 make To run the example program: ./example ./en_US.aff ./en_US.dic checkme.lst Please play around with it and let me know what you think. Developer Credits: Special credit and thanks go to ispell's creator Geoff Kuenning. Ispell affix compression code was used as the basis for the affix code used in MySpell. Specifically Geoff's use of a conds[] array that makes it easy to check if the conditions required for a particular affix are present was very ingenious! Kudos to Geoff. Very nicely done. BTW: ispell is available under a BSD style license from Geoff Kuennings ispell website: http://www.cs.ucla.edu/ficus-members/geoff/ispell.html The Original MySpell code was written by Kevin Hendricks and released under a BSD license. An almost complete rewrite of MySpell for use by the Mozilla project has been developed by David Einstein (Deinst@world.std.com). David and I are now working on parallel development tracks to help our respective projects (Mozilla and OpenOffice.org and we will maintain full affix file and dictionary file compatibility and work on merging our versions of MySpell back into a single tree. David has been a significant help in improving MySpell. La'szlo' Ne'meth who is the author of the Hungarian dictionary and who developed and contributed the code to support compound words in MySpell and fixed numerous problems with the encoding case conversion tables. He also introduced the idea and is the author of the code to support replacement tables which greatly improved suggestions. Davide Prina , Giuseppe Modugno , Gianluca Turconi all from the it_IT OpenOffice.org team for a detailed code review of MySpell and fixes for bugs, leaks, and speedup improvements. Special Thanks to all others who have either contributed ideas or testing for MySpell Thanks, Kevin Hendricks kevin.hendricks@sympatico.ca dict-ns-20070206.orig/utils/.svn/text-base/unmunch.c.svn-base0000444000175000017500000003021110562150175022201 0ustar dokodoko/* Un-munch a root word list with affix tags * to recreate the original word list */ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "unmunch.h" int main(int argc, char** argv) { int i; int al, wl; FILE * wrdlst; FILE * afflst; char *wf, *af; char * ap; char ts[MAX_LN_LEN]; /* first parse the command line options */ /* arg1 - munched wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; parse_aff_file(afflst); fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } /* skip over the hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wrdlst)) return 2; mychomp(ts); while (fgets(ts,MAX_LN_LEN-1,wrdlst)) { mychomp(ts); /* split each line into word and affix char strings */ ap = strchr(ts,'/'); if (ap) { *ap = '\0'; ap++; al = strlen(ap); } else { al = 0; ap = NULL; } wl = strlen(ts); numwords = 0; wlist[numwords].word = mystrdup(ts); wlist[numwords].pallow = 0; numwords++; if (al) expand_rootword(ts,wl,ap,al); for (i=0; i < numwords; i++) { fprintf(stdout,"%s\n",wlist[i].word); free(wlist[i].word); wlist[i].word = NULL; wlist[i].pallow = 0; } } fclose(wrdlst); return 0; } void parse_aff_file(FILE * afflst) { int i, j; int numents=0; char achar='\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; ff = 0; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { fgets(line,MAX_LN_LEN,afflst); mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d flag %c\n",numpfx,ptable[numpfx].num,ptr->achar); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d flag %c\n",numsfx,stable[numsfx].num,ptr->achar); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if (k > 0) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/.svn/text-base/Makefile.language.svn-base0000444000175000017500000001543510562150175023615 0ustar dokodoko# this makefile is used to automate building of dictionaries # based on affix files etc... # if you need to adapt this Makefile for another language, # all you should have to do is change these variables. # if you need to change anything else, please submit it back # to the project so other people can benefit # The version will automatically be read in from the VERSION file VERSION=$(shell cat VERSION) VERSION_ASPELL=$(shell cat ../VERSION.aspell) # Only set these if the user has not overridden them in the language Makefile LANG_FAKE?=$(LANG) REGION_FAKE?=$(REGION) .PHONY: all clean clean-myspell clean-ispell clean-aspell clean-autocorr ispell myspell aspell count check wordlist autocorr TARGETS_MYSPELL=myspell/wordlist.$(CHARSET) myspell/pack-$(LANG)-$(REGION)-$(VERSION).zip myspell/$(LANG)_$(REGION).zip myspell/$(LANG)_$(REGION).dic myspell/spell.txt myspell/VERSION_$(LANG)_$(REGION).txt myspell/install.js myspell/spell-$(LANG)-$(REGION).xpi myspell/$(LANG)-$(REGION).dic myspell/$(LANG)-$(REGION).aff myspell/README-$(LANG)-$(REGION).txt TARGETS_ISPELL=ispell/$(LANGNAMELOW).hash ispell/$(LANGNAMELOW)-ispell-$(VERSION).tar.bz2 ispell/wordlist.$(CHARSET) ispell/wordlist.$(CHARSET).cnt ispell/wordlist.$(CHARSET).stat TARGET_ASPELL=aspell/wordlist.$(CHARSET) aspell/$(LANG).rws aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION).tar.bz2 aspell/proc aspell/configure aspell/$(LANG).cwl aspell/info aspell/Makefile aspell/Makefile.pre aspell/$(LANG).* aspell/*.alias aspell/COPYING aspell/README aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION) TARGET_AUTOCORR=acor/acor_$(LANG)-$(REGION).dat* TARGET_WORDLISTS=wordlists/wordlist.$(CHARSET) $(WORDLIST.CHARSET) all: myspell aspell wordlist acor clean: clean-myspell clean-ispell clean-aspell clean-wordlists clean-acor # Statistics count: wordlists/wordlist.$(CHARSET) $(WORDLIST.IN) @echo "Comments removed" @for f in $^; do \ echo -n "$$f "; \ egrep -v "^#" $$f | sort --unique | wc -l; \ done @echo @echo "Comments and words with whitespace removed" @for f in $^; do \ echo -n "$$f "; \ egrep -v "(^#| )" $$f | sort --unique | wc -l; \ done @echo @echo "Comments removed words with whitespace split" @for f in $^; do \ echo -n "$$f "; \ egrep -v "^#" $$f | tr " " "\n" | sort --unique | wc -l; \ done # Checks check: wordlists/wordlist.$(CHARSET) @echo First line is existing TRY sequence. Second line is new TRY sequence. @egrep "^TRY" myspell/$(LANG)_$(REGION).aff | sed "s/TRY //g" @LC_ALL=en_US.utf8 LANG=en_US.utf8 LANGUAGE=en_US.utf8 ../../src/wordlist/letter-frequency.py -i $^ -len_US # General WORDLIST.CHARSET=$(patsubst %.in, %.$(CHARSET), $(WORDLIST.IN)) %.$(CHARSET): %.in iconv -f utf-8 -t $(CHARSET) < $< >$@ wordlists/wordlist.$(CHARSET): $(WORDLIST.CHARSET) cat $^ | egrep -v "^#|^$$" | sort --unique > $@ wordlists/wordlist-$(LANG)-$(VERSION).zip: $(WORDLIST.IN) wordlists/wordlist.$(CHARSET) zip -j $@ $^ wordlist: wordlists/wordlist-$(LANG)-$(VERSION).zip clean-wordlists: rm -rf $(TARGET_WORDLISTS) # MySpell rules clean-myspell: rm -f $(TARGETS_MYSPELL) # make myspell will make the required zip files myspell: myspell/myspell-$(LANG)_$(REGION)-$(VERSION).zip myspell/myspell-pack-$(LANG)-$(REGION)-$(VERSION).zip myspell/spell-$(LANG)-$(REGION)-$(VERSION).xpi # this is a package that is usable for offline installation myspell/myspell-pack-$(LANG)-$(REGION)-$(VERSION).zip: myspell/myspell-$(LANG)_$(REGION)-$(VERSION).zip myspell/spell.txt zip -j $@ $^ # we autogenerate the index file... myspell/spell.txt: echo '$(LANG_FAKE),$(REGION_FAKE),$(LANG_FAKE)_$(REGION_FAKE),$(LANGNAME) ($(REGIONNAME)),myspell-$(LANG)_$(REGION)-$(VERSION).zip' >$@ # this is the standard myspell package myspell/myspell-$(LANG)_$(REGION)-$(VERSION).zip: myspell/$(LANG)_$(REGION).dic myspell/$(LANG)_$(REGION).aff myspell/README_$(LANG)_$(REGION).txt myspell/VERSION_$(LANG)_$(REGION).txt zip -j $@ $^ # make sure the VERSION file name doesn't conflict with other packages myspell/VERSION_$(LANG)_$(REGION).txt: VERSION cp -p $^ $@ # myspell/ispell don't like the header, or words with spaces in them myspell/wordlist.$(CHARSET): wordlists/wordlist.$(CHARSET) egrep -v '(^#| )' <$< >$@ # this does the work of converting a wordlist into a myspell dictionary # it can take a while # the munch utility is located under the dict/utils project myspell/$(LANG)_$(REGION).dic: myspell/wordlist.$(CHARSET) myspell/$(LANG)_$(REGION).aff ../utils/munch ../utils/munch myspell/wordlist.$(CHARSET) myspell/$(LANG)_$(REGION).aff >$@ # The following are for building a Mozilla XPI of the spellchecker # Customise the install.js myspell/install.js: ../utils/install.js.in sed "s/{LANG}/$(LANG)/; s/{REGION}/$(REGION)/; s/{LANGNAME}/$(LANGNAME)/; s/{REGIONNAME}/$(REGIONNAME)/; s/{VERSION}/$(VERSION)/" < $< > $@ myspell/README-$(LANG)-$(REGION).txt: myspell/README_$(LANG)_$(REGION).txt cp $^ $@ myspell/$(LANG)-$(REGION).dic: myspell/$(LANG)_$(REGION).dic cp $^ $@ myspell/$(LANG)-$(REGION).aff: myspell/$(LANG)_$(REGION).aff cp $^ $@ myspell/spell-$(LANG)-$(REGION)-$(VERSION).xpi: myspell/$(LANG)-$(REGION).aff myspell/$(LANG)-$(REGION).dic myspell/README-$(LANG)-$(REGION).txt myspell/install.js zip -j $@ $^ # Ispell Rules clean-ispell: rm -f $(TARGETS_ISPELL) ispell/$(LANGNAMELOW).hash: ispell/wordlist.$(CHARSET) ispell/$(LANGNAMELOW).aff buildhash $^ $@ ispell/$(LANGNAMELOW)-ispell-$(VERSION).tar.bz2: ispell/$(LANGNAMELOW).hash ispell/$(LANGNAMELOW).aff ispell/README tar cvjf $@ $^ ispell: ispell/$(LANGNAMELOW)-ispell-$(VERSION).tar.bz2 ispell/wordlist.$(CHARSET): wordlists/wordlist.$(CHARSET) egrep -v '(^#| )' <$< >$@ # Aspell Rules aspell: aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION).tar.bz2 clean-aspell: rm -rf $(TARGET_ASPELL) aspell/$(LANG).cwl: aspell/wordlist.$(CHARSET) (export LC_COLLATE=C; cat $< | sort -u | word-list-compress compress > $@) aspell/proc: ../utils/proc cp -p $< $@ aspell/configure: ../utils/configure cp -p $< $@ aspell/wordlist.$(CHARSET): wordlists/wordlist.$(CHARSET) cat $< | egrep -v '(^#| |\.|-$$|[0-9]|/|=$$)' | LC_COLLATE=C sort --unique >$@ aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION).tar.bz2: aspell/$(LANG).cwl aspell/configure aspell/Makefile.pre aspell/Copyright cd aspell; ./configure; make dist && make distcheck && rm -rf aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION) aspell/info: aspell/info.in ../VERSION.aspell VERSION sed "s/{VERSION}/$(VERSION_ASPELL)\-$(VERSION)/" < $< > $@ aspell/Makefile.pre: aspell/proc aspell/info (cd aspell; export LC_COLLATE=C; ./proc create) # Autocorrect rules # Naming format for OpenOffice.org 2 acor/acor_$(LANG)-$(REGION).dat: acor/DocumentList.csv acor/SentenceExceptList.csv acor/WordExceptList.csv (cd acor; ../../utils/csv2acor.py $(@F)) acor: acor/acor_$(LANG)-$(REGION).dat autocorrect: acor clean-acor: rm -rf $(TARGET_AUTOCORR) dict-ns-20070206.orig/utils/.svn/text-base/munch.h.svn-base0000444000175000017500000000461610562150175021655 0ustar dokodoko/* munch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_ROOTS 20 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; /* data structure to store results of lookups */ struct matches { struct hentry * hashent; /* hash table entry */ struct affent * prefix; /* Prefix used, or NULL */ struct affent * suffix; /* Suffix used, or NULL */ }; int numroots; /* number of root words found */ struct matches roots[MAX_ROOTS]; /* list of root words found */ /* hashing stuff */ struct hentry { char * word; char * affstr; struct hentry * next; int keep; }; int tablesize; struct hentry * tableptr; /* unmunch stuff */ int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ void parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int load_tables(FILE * wrdlst); int hash(const char *); int add_word(char *); struct hentry * lookup(const char *); void aff_chk (const char * word, int len); void pfx_chk (const char * word, int len, struct affent* ep, int num); void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag); void add_affix_char(struct hentry * hent, char ac); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/.svn/text-base/proc.svn-base0000444000175000017500000027234010562150175021261 0ustar dokodoko#!/usr/bin/perl ################################################################ # # Aspell Word List Package proc script # Copyright 2001,2002,2004 under the GNU Lesser General Public License (LGPL) # use Data::Dumper; use strict; use warnings; no warnings qw(uninitialized); no locale; my $VERSION = "0.50.4"; my $action = 'create'; my $check_mode = 'safe'; foreach my $arg (@ARGV) { $arg =~ s/^-*//; if ($arg eq 'check' || $arg eq 'create') { $action=$arg; } elsif ($arg eq 'unsafe') { $check_mode = 'unsafe'; } } ################################################################ # # helper functions # sub true ( ) {1} sub false ( ) {0} sub error ( $ ) { die \ $_[0] } my ($line_length,$error_count,$multi_errors); sub line_length() {75} sub error_message ($;$) { my $error; my $parms = $_[1]; my $warn = defined $parms->{warn} ? $parms->{warn} : false; $error .= $warn ? "Warning" : "Error"; $error .= " line $parms->{lineno}" if defined $parms->{lineno}; $error .= ": $_[0]\n"; my $line; $_ = $error; my $print_line = sub {print STDERR "$line\n" unless $line =~ /^\s*$/}; while (s/(\s*?)(\S+|\n)//) { my ($a,$b) = ($1,$2); my $len = length($line) + length($a) + length($b); if (($line !~ /^\s*$/ && $len > line_length) || $b eq "\n") { &$print_line; $a = ""; $b = "" if $b eq "\n"; $line = " "; } $line .= $a; $line .= $b; } &$print_line; if (!$warn) { $error_count++; $multi_errors++ if defined $multi_errors; } } sub handle_error (;$) { return unless $@; if (ref $@) { error_message $ {$@}, {lineno=> $_[0]}; $@ = undef; } else { die $@; } } sub memberof ( $ $ ) { foreach (@{$_[1]}) {return true if $_[0] eq $_;} return false; } sub indented_list ( @ ) { return join '', map {" $_\n"} @_; } ################################################################ # # insr initialization # my ($key,$val,$info,$insr,@authors,%dicts,%copying); my $lang = "[a-z]{2}"; my $version; sub lower() {["[a-z]+", "must consist of only lowercase ASCII characters"]} sub upper() {["[A-Z]+", "must consist of only uppercase ASCII characters"]} sub alpha() {["[A-Za-z]+", "must consist of only alpha ASCII characters"]} sub alphanum() {["[A-Za-z0-9-]+", "must consist of only alphanumeric ASCII characters or '-'"]} sub ascii() {["[\x20-\x7E]+", "must consist of only ASCII characters"]} sub any() {[".+","ERROR"]} sub generic() {"is not in the proper format"} sub dict() {return ["$lang(_[A-Z]{2}|)(|-[a-z0-9-]+)(-[0-9]{2}|)", generic]} sub split_dict ( $ ) {my $dict = dict->[0]; my @data = $_[0] =~ /^$dict$/; foreach (@data) {next unless $_; $_ = substr $_, 1} return @data} sub form_dict ( @ ) {my $name = $lang; $name .= "_$_[0]" if $_[0]; $name .= "-$_[1]" if $_[1]; $name .= "-$_[2]" if $_[2]; return $name} sub README(); sub make_alias( $ $ $ ); my $line; my %aliases_from; my %aliases_to; my %global_info; my %global_insr = (default_fill_order => [qw (name_ascii name_native strip_accents)], author => { singular => false, name => {check=>any}, email => {required=>false, check=>[".+ at .+",generic]}, maintainer => {required=>false, oneof=>['true', 'false'], default=>'false'}, pre => sub {}, post => sub { push @authors, $info; } }, copyright => {oneof => ["LGPL", "GPL", "FDL", "LGPL/GPL", # FSF Licenses "Artistic", # Perl Artistic Licence "Copyrighted", # Copyright message must remain "Open Source", # Meets OSI defination "Public Domain", # ie none "Other", "Unknown"] }, version => { check => ['\d[a-z\d\.-]+', generic], code => sub {$version="$val"}, store => true, }, date => {required=>false, check=>['\d\d\d\d-\d\d-\d\d', 'YYYY-MM-DD']}, url => {required=>false}, source_url => {required=>false}, source_version => {required=>false}, name_english => {check=>["[A-Z][a-z]+( [A-Z][a-z]+)*",generic]}, name_ascii => {default => "=name_english"}, name_native => {default => "=name_ascii", check=>any}, lang => {check => ["[a-z]{2,3}", "must consist of two or three lowercase ASCII characters"], code => sub {$lang = $val}, store => true }, readme_file => {required=>false, check=> upper, normal=>"README", generate => sub {README}}, copying_file => {required=>false, check=> upper, normal=>"COPYING", generate => sub {$copying{$info->{copyright}}}}, copyright_file => {required=>false, check=> upper, normal=>"Copyright"}, charset => { oneof => [qw(iso8859-1 iso8859-2 iso8859-3 iso8859-4 iso8859-5 iso8859-6 iso8859-7 iso8859-8 iso8859-9 iso8859-10 iso8859-14 iso8859-15 koi8-f koi8-r koi8-u viscii)] }, special => {required => false}, soundslike => {oneof => ['generic','phonet','none']}, keyboard => {required => false}, run_together => {required => false}, run_together_limit => {required => false}, run_together_min => {required => false}, run_together_mid => {required => false}, strip_accents => {default => 'false', oneof => ['true','false']}, alias => {check => any, code => sub { error "The \"lang\" entry must be defined before any global aliases." unless exists $global_info{lang}; my @d = split /\s+/, $val; foreach (@d[1..$#d]) { my $awli = s/:awli$// ? true : false; error ("The alias $_ already exits in the \"$aliases_to{$_}\" " ."entry.") if exists $aliases_to{$_}; $aliases_to{$_} = $d[0]; $_ = {name => $_, awli => $awli}; } push @{$aliases_from{$d[0]}}, @d[1..$#d]; } }, dict => { default_fill_order => ['awli'], singular => false, name => {check=>\&dict}, awli => {default=>'true', oneof=>['true','false']}, strip_accents => { oneof => ["true", "false"], code => sub {push @{$info->{insr}}, "strip-accents $val";} }, add => { check=>\&dict, code => sub { my ($inf, $v) = @_ ? @_ : ($info, $val); push @{$inf->{insr}}, "add $v"; push @{$inf->{dicts}}, {name => $v, add => \$inf->{insr}->[-1]}; } }, alias => { check=>any, code => sub { error "The name entry must be defined before any aliases or defined" unless exists $info->{name}; my $awli = $val =~ s/:awli$//; &{$insr->{post}}( make_alias $val, $info->{name}, $awli ); } }, pre => sub { my ($inf) = @_ ? @_ : ($info); $inf->{insr} = []; $inf->{dicts} = []; error "The \"lang\" entry must be defined before any dicts." unless exists $global_info{lang}; }, post => sub { my ($inf) = @_ ? @_ : ($info); error "Must provide at least one word list for \"$info->{name}\" dict entry." if (@{$inf->{dicts}} == 0); error "The dict or alias \"$info->{name}\" is already defined." if exists $dicts{$inf->{name}}; $dicts{$inf->{name}} = $inf; return $inf; } } ); sub doc_entries() {qw (readme_file copying_file copyright_file)} ################################################################ # # Add default values to insr # my @defaults = (["singular", true], ["check", ascii], ["required", true]); sub add_defaults ( $ ) { my $v = $_[0]; foreach my $d (@defaults) { $v->{$d->[0]} = $d->[1] unless exists $v->{$d->[0]}; } $v->{required} = false if exists $v->{code} || !$v->{singular}; $v->{store} = true unless exists $v->{store} || exists $v->{code}; $v->{store} = false unless exists $v->{store}; } foreach my $v (values %global_insr) { next unless ref $v eq 'HASH'; add_defaults $v; if (!$v->{singular}) { foreach my $vv (values %$v) { next unless ref $vv eq 'HASH'; add_defaults $vv } } } ################################################################ # # Read in info file # open IN, "info" or die "Unable to open info file\n"; sub handle_key(); sub begin_multi(); sub possibly_end_multi(); sub add_defaults_and_check_mandatory(); my ($key_insr,$multi_val,$multi_line,$multi_message); $info = \%global_info; $insr = \%global_insr; $line = 0; while () { ++$line; chop; s/\#.*$//; s/\s*$//; next if $_ eq ''; eval { my ($lsp,$col); ($lsp, $key, $col, $val) = /^(\s*)([\w-]*)\s*(:?)\s*(.*)$/ or error "Syntax Error."; $key =~ tr/-/_/; if ($col eq ':' && $lsp ne '') { error_message "This line should not be indented. Assuming its not." , {lineno => $line}; $lsp = ''; } if ($lsp eq '') { possibly_end_multi; $key_insr = $insr->{$key} or error "Unknown Key: $key"; error "Expecting value after $key" if $key_insr->{singular} && ($col ne '' || $val eq ''); error "Expecting \":\" after $key" if !$key_insr->{singular} && $col ne ':'; if ($key_insr->{singular}) { handle_key; } else { begin_multi; } } else { error "This line is indented yet I can not find a line of the form " ."\":\" before it" if !defined $multi_val; $key_insr = $insr->{$key} or error "Unknown Key \"$key\"$multi_message."; error "Expecting value after $key$multi_message." if $col ne '' || $val eq ''; handle_key; } }; handle_error $line; } possibly_end_multi; close IN; die "There were $error_count errors with the info file, aborting.\n" if $error_count > 0; sub handle_key() { my $check = $key_insr->{check}; $check = &$check if ref $check eq 'CODE'; error "The value for $key $check->[1]$multi_message." if $val !~ /^$check->[0]$/; error "The value for $key is not one of: ".join(', ',@{$key_insr->{oneof}}) if exists $key_insr->{oneof} && !memberof($val, $key_insr->{oneof}); if ($key_insr->{store}) { error "A value for $key already defined$multi_message." if exists $info->{$key}; $info->{$key} = $val; } if (exists $key_insr->{code}) { &{$key_insr->{code}}; } } sub begin_multi() { $info = {}; $insr = $key_insr; $multi_val = $key; $multi_line = $line; $multi_errors = 0; $multi_message = " for the group \"$multi_val\" which starts at line $multi_line"; &{$insr->{pre}}; } sub possibly_end_multi() { return unless defined $multi_val; if ($multi_errors == 0) { add_defaults_and_check_mandatory; } if ($multi_errors == 0) { eval { &{$insr->{post}}; }; handle_error $multi_line; } $info = \%global_info; $insr = \%global_insr; $multi_val = undef; $multi_line = undef; $multi_errors = undef; $multi_message = ''; } ################################################################ # # Add defaults and check for mandatory fields # add_defaults_and_check_mandatory; sub add_defaults_and_check_mandatory() { my ($key, $val); # add defaults foreach my $key (@{$insr->{default_fill_order}}) { next if exists $info->{$key}; my $def = $insr->{$key}->{default}; if ($def =~ /^\=(.+)$/) { $info->{$key} = $info->{$1}; } else { $info->{$key} = $def; } } # check mandatory fields while (my ($key,$val) = each %$insr) { next unless ref $val eq 'HASH'; next unless $val->{required}; next if exists $info->{$key}; error_message "The required field $key is missing$multi_message."; } } $info = \%global_info; $insr = \%global_insr; error_message "You must provide at least one author." if (@authors == 0); my ($date, %date); if (exists $info->{date}) { $date = $info->{date}; ($date{year}, $date{month}, $date{day}) = $info->{date} =~ /(....)-(..)-(..)/ or die; } else { (undef,undef,undef,$date{day},$date{month},$date{year}) = localtime(time); $date{year} += 1900; $date = sprintf "%04d-%02d-%02d",$date{year},$date{month}+1,$date{day}; } ################################################################ # # Finish processing # my (%word_lists); my (%already_warned); sub make_alias ( $ $ $ ) { my ($from, $to, $awli) = @_; my $inf = {}; my $insr = $global_insr{dict}; &{$insr->{pre}}($inf); $inf->{name} = $from; $inf->{awli} = $awli ? 'true' : 'false'; &{$insr->{add}{code}}($inf, $to); return $inf; } # Traverse performs a depth first circle looking for cycles and information # included twice # Parms # 1st (array reference) The list of all nodes # 2nd (sub ( $ )) A function which returnes all the children of a given node sub traverse ( $ $ ); traverse [keys %aliases_from], sub { my $r = $aliases_from{$_[0]}; return () unless defined $r; return map {$_->{name}} @$r; }; my @toproc = keys %dicts; while (my $key = shift @toproc) { my $val = $dicts{$key}; $val->{ext} = $val->{awli} eq 'true' ? 'multi' : 'alias'; my @d = split_dict $key; next unless @d; $d[0] = $lang . ($d[0] ? '_' : ''). $d[0]; my $get_aliases = sub { my @a; @a = @{$aliases_from{$_[0]}} if exists $aliases_from{$_[0]}; return ({name=>$_[0], awli=>$val->{awli}}, @a); }; foreach my $l0 (&$get_aliases($d[0])) { foreach my $l1 (&$get_aliases($d[1])) { foreach my $l2 (&$get_aliases($d[2])) { my $dict = $l0->{name}; $dict .= '-'.$l1->{name} if $l1->{name}; $dict .= '-'.$l2->{name} if $l2->{name}; next if exists $dicts{$dict}; my $awli = $l0->{awli} && $l1->{awli} && $l2->{awli}; $dicts{$dict} = make_alias $dict, $key, $awli; $dicts{$dict}->{auto} = true; push @toproc, $dict; } } } next unless $val->{awli}; # If the dictionaries have a size associated with it than find # the size closest to the default size and make an awli alias for # that dictionary without the size in its name @d = split_dict $key; my $l = pop @d; my $n = form_dict @d; if ($l) { if (exists $dicts{$n} && ! exists $dicts{$n}{auto}) { if (!$already_warned{$n}) { my $error; $error .= "Since the awli-dict \"$key\" exists "; $error .= "the dict $n should also have a size."; error_message $error; $already_warned{$n} = true; } } else { # create a special alias my $rank = $l - 60; if ($rank <= 0) { $rank = - $rank; $rank <<= 1; $rank += 1; } else { $rank <<= 1; } push @toproc,$n unless exists $dicts{$n}; my $old_rank = $dicts{$n}->{rank}; if (! defined $old_rank || $rank < $old_rank) { my $inf = make_alias $n, $key, true; $inf->{rank} = $rank; $inf->{auto} = true; $dicts{$n} = $inf; } } } } foreach my $key (sort keys %dicts) { # sorting it guarantees that the more general dictionaries are # processed first my $val = $dicts{$key}; if ($val->{awli} eq 'true') { my @d = split_dict $key; pop @d; # ignore the size part as it is already handled above my $l = pop @d; my $n = form_dict @d; while (@d) { $l = pop @d; $n = form_dict @d; next unless $l; next if exists $dicts{$n}{rank}; next if exists $already_warned{$n}; my $error; if (!exists $dicts{$n} || $dicts{$n}{awli} eq 'false') { $error .= "The more specific awli-dict \"$key\" exists yet "; if (!exists $dicts{$n}) { $error .= "\"$n\" does not." } elsif ($dicts{$n}->{awli} eq 'false') { $error .= "the \"$n\" dict has the awli entry set to false." } } error_message $error if defined $error; $already_warned{$n} = true; } } foreach my $n (@{$val->{dicts}}) { if ($n->{name} eq $key && @{$val->{insr}} != 1) { my $error; $error .= "The $key dictionary can not add a word list "; $error .= "of the same name unless it is the only entry."; error_message $error; } else { if ($n->{name} eq $key || !exists $dicts{$n->{name}}) { $n->{type} = 'rws'; push @{$word_lists{$n->{name}}}, $key; } else { $n->{type} = 'multi'; #$n->{link} = $dicts{$n->{name}}; } $ {$n->{add}} .= ".$n->{type}"; } $val->{is_alias} = (@{$val->{insr}} == 1 && $val->{dicts}[0]{type} eq 'multi'); } unshift @{$val->{insr}}, "strip-accents true" if $global_info{strip_accents} eq 'true' && $val->{insr}->[0] !~ /^strip-accents /; } sub find_equivalent_to { my $val = $dicts{$_[0]}; return $val->{equivalent_to} if exists $val->{equivalent_to}; if (@{$val->{insr}} == 1 && $val->{dicts}[0]{type} eq 'multi') { $val->{equivalent_to} = &find_equivalent_to($val->{dicts}[0]{name}); push @{$val->{equivalent_to}}, $_[0]; } else { $val->{equivalent_to} = []; } return $val->{equivalent_to}; } foreach my $key (sort keys %dicts) { &find_equivalent_to($key); } traverse [map {"$_->{name}.$_->{ext}"} values %dicts], sub { my ($id) = @_; my ($name,$type) = $id =~ /^(.+)\.(.+)$/; return () unless $type eq 'multi'; return map {"$_->{name}.$_->{type}"} @{$dicts{$name}->{dicts}}; }; sub try_read ( $ ) { my $res = open IN, "$_[0]"; close IN; error_message ("Unable to read the file $_[0]") unless $res; return $res; } my $word_list_compress_working = system("word-list-compress 2> /dev/null") != -1 ? true : false; error_message("Unable to execute word-list-compress. I will not be able " ."to check the integrity of the *.cwl files.") unless $word_list_compress_working; foreach my $wl (keys %word_lists) { try_read "$wl.cwl" or next; next unless $word_list_compress_working; if ($check_mode ne 'unsafe') { open IN, "word-list-compress d < $wl.cwl|" or die; my $prev = ''; while () { if ($prev gt $_) { error_message ("The file $wl.cwl is not in the proper format. " ."Did you remember to set LC_COLLATE to C before sorting " ."and compressing with \"word-list-compress c\"."); last; } elsif ($prev eq $_) { error_message ("The file $wl.cwl contains duplicates. " ."Sort with \"sort -u\" to remove them."); last; } $prev = $_; } } } if ($info->{soundslike} eq 'phonet') { try_read "${lang}_phonet.dat"; } foreach my $key (doc_entries) { my $file; if (exists $info->{$key}) { $file = $info->{$key}; } elsif (!exists $insr->{$key}->{generate}) { $file = $insr->{$key}->{normal}; } else { next; } try_read $file; } close IN; die "$error_count Error(s), aborting\n" if $error_count != 0; exit 0 if $action eq 'check'; sub traverse ( $ $ ) { my ($nodes, $get_children) = @_; my %processed; my $t; $t = sub { my ($id,$visited) = @_; my %paths = ($id => [$id]); return \%paths if exists $visited->{$id}; #print STDERR " $id\n"; $visited->{$id} = true; if ($processed{$id}) { foreach (@{$processed{$id}->{visited}}) { $visited->{$_} = true; } return $processed{$id}->{paths}; } foreach my $val (&$get_children( $id ) ) { my $child_paths = &$t( $val, $visited ); while (my ($k,$v) = each %$child_paths) { if ($k eq $id) { error_message "Ciculer dependence found: ".join(" -> ", $id, @$v); } elsif (exists $paths{$k}) { error_message ("$v->[-1] is included twice by $id via the following paths:\n" ." ".join(" -> ", $id, @$v)."\n" ." ".join(" -> ", @{$paths{$k}}) ,{warn => true} ); } else { $paths{$k} = [$id, @$v]; } } } $processed{$id} = {visited => [keys %$visited], paths => \%paths}; return \%paths; }; foreach my $k (@$nodes) { #print STDERR "$k:\n"; &$t( $k,{} ); } } ################################################################ # # Create files # my (%files, $make); $files{extra} = ['configure', 'info', 'Makefile.pre']; push @{$files{data}}, "$lang.dat"; push @{$files{data}}, "${lang}_phonet.dat" if $info->{soundslike} eq 'phonet'; $info->{name} = $lang; $info->{soundslike} = $lang if $info->{soundslike} eq 'phonet'; open OUT, ">$lang.dat"; print OUT "# Generated with Aspell Dicts \"proc\" script version $VERSION\n"; foreach my $key (qw(name charset special soundslike keyboard run_together run_together_limit run_together_min run_together_mid)) { next unless exists $info->{$key}; my $akey = $key; $akey =~ tr/_/-/; print OUT "$akey $info->{$key}\n"; } close OUT; foreach my $key (doc_entries) { my $specific = $info->{$key}; my $normal = $insr->{$key}{normal}; if (defined $specific && $specific ne $normal) { system "cp $specific $normal" or die; push @{$files{doc}}, $specific, $normal; } elsif (defined $specific) { push @{$files{doc}}, $normal; } elsif (exists $insr->{$key}{generate}) { my $data = &{$insr->{$key}{generate}}; next unless defined $data; open OUT, ">$normal"; print OUT $data; close OUT; push @{$files{doc}}, $normal; } else { push @{$files{doc}}, $normal; } } foreach my $key (sort keys %dicts) { my $val = $dicts{$key}; open OUT, ">$val->{name}.$val->{ext}\n"; print OUT "# Generated with Aspell Dicts \"proc\" script version $VERSION\n"; foreach (@{$val->{insr}}) { print OUT "$_\n"; } close OUT; push @{$files{multi}}, "$val->{name}.$val->{ext}"; } foreach my $key (sort keys %word_lists) { $make .= "$key.rws: $key.cwl\n\n"; push @{$files{cwl}}, "$key.cwl"; push @{$files{rws}}, "$key.rws"; } $make .= <<"---"; .SUFFIXES: .cwl .rws .cwl.rws: \${WORD_LIST_COMPRESS} d < \$< | \${ASPELL} \${ASPELL_FLAGS} --lang=$lang create master ./\$@ --- open OUT, ">Makefile.pre"; print OUT <<"---"; # Generated with Aspell Dicts "proc" script version $VERSION lang = $lang version = $version --- print OUT "\n"; foreach (sort keys %files) { print OUT "${_}_files = ", join(' ', @{$files{$_}}), "\n"; } print OUT "\n"; print OUT << '---'; distdir=aspell-${lang}-${version} all: ${rws_files} ${data_files} install: all mkdir -p ${DESTDIR}${dictdir}/ cp ${rws_files} ${multi_files} ${DESTDIR}${dictdir}/ cd ${DESTDIR}${dictdir}/ && chmod 644 ${rws_files} ${multi_files} mkdir -p ${DESTDIR}${datadir}/ cp ${data_files} ${DESTDIR}${datadir}/ cd ${DESTDIR}${datadir}/ && chmod 644 ${data_files} clean: rm -f ${rws_files} distclean: clean rm -f Makefile maintainer-clean: distclean rm -f ${multi_files} Makefile.pre uninstall: -cd ${DESTDIR}${dictdir}/ && rm ${rws_files} ${multi_files} ${link_files} -cd ${DESTDIR}${datadir}/ && rm ${data_files} dist: perl proc ./configure @make dist-nogen dist-nogen: -rm -r ${distdir}.tar.bz2 ${distdir} mkdir ${distdir} cp -p ${extra_files} ${cwl_files} ${multi_files} ${doc_files} ${data_files} ${distdir}/ -cp -pr doc/ ${distdir}/ tar cf ${distdir}.tar ${distdir}/ bzip2 -9 ${distdir}.tar rm -r ${distdir}/ distcheck: tar xfj ${distdir}.tar.bz2 cd ${distdir} && ./configure && make rel: mv ${distdir}.tar.bz2 ../rel --- print OUT $make; close OUT; sub README() { my $maintainer_list; my $author_list; foreach (@authors) { my $which = $_->{maintainer} eq 'true' ? \$maintainer_list : \$author_list; $$which .= " $_->{name}"; $$which .= " ($_->{email})" if exists $_->{email}; $$which .= "\n"; } my $author_info; $author_info = "Maintained By:\n$maintainer_list" if $maintainer_list; $author_info = "Original Word List By:\n$author_list" if $author_list; chop $author_info; my $dict_list; foreach my $key (sort keys %dicts) { my $val = $dicts{$key}; next if $val->{is_alias}; $dict_list .= " $key"; if (@{$val->{equivalent_to}}) { $dict_list .= ' ('; my $len = length($key) + 4; my $indent = $len; foreach (sort @{$val->{equivalent_to}}) { if ($len + length($_) > 70 && $len != $indent) { $dict_list .= "\n"; $dict_list .= ' 'x$indent; $len = $indent; } $dict_list .= "$_ "; $len += length($_) + 1; } chop $dict_list; $dict_list .= ')'; } $dict_list .= "\n"; } chop $dict_list; my $extra_info; $extra_info .= "Wordlist URL: $info->{url}\n" if exists $info->{url}; $extra_info .= "Source Verson: $info->{source_version}\n" if exists $info->{source_version}; $extra_info .= "Source URL: $info->{source_url}\n" if exists $info->{source_url}; return <<"---" GNU Aspell $info->{name_english} Word List Package Version $version $date by Kevin Atkinson (kevina\@gnu.org) $author_info Copyright Terms: $info->{copyright} (see the file Copyright for the exact terms) $extra_info This is the Aspell word list for $info->{name_english}. If Aspell is installed and aspell and word-list-compress are all in the path first do a: ./configure Which should output something like: Finding Dictionary file location ... /usr/local/lib/aspell Finding Data file location ... /usr/local/share/aspell if it did not something likely went wrong. After that build the package with: make and then install it with make install If any of the above mentioned programs are not in your path than the variables, ASPELL and/or WORD_LIST_COMPRESS need to be set to the commands (with path) to run the utilities. These variables may be set in the environment before configure is run or specified at the command line using the following syntax ./configure --vars VAR1=VAL1 ... Other useful variables configure recognizes are ASPELL_PARMS, and DESTDIR. To clean up after the build: make clean To uninstall the files: make uninstall After the word lists are installed you can use the main one ($lang) by setting the LANG environmental variable to $lang or running Aspell with --lang=$lang. You may also chose the dictionary directly with the -d or --master option of Aspell. You can chose from any of the following dictionaries: $dict_list Whereas the names in parentheses are alternate names for the dictionary preceding the parentheses. If you have any problem with installing or using the word lists please let me (Kevin Atkinson) know. If you have problems with the actual word lists please contact one of the Word lists authors as I do not maintain the actual Word Lists. Any additional documentation that came with the original word list can be found in the doc/ directory. --- } INIT { %copying = (GPL => <<'---', GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) 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 this service 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 make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. 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. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the 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 a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE 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. 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 convey 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 2 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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision 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, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This 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 Library General Public License instead of this License. --- LGPL => <<'---', GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! --- FDL => <<'---', GNU Free Documentation License Version 1.1, March 2000 Copyright (C) 2000 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. 0. PREAMBLE The purpose of this License is to make a manual, textbook, or other written document "free" in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, this License preserves for the author and publisher a way to get credit for their work, while not being considered responsible for modifications made by others. This License is a kind of "copyleft", which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; it can be used for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. 1. APPLICABILITY AND DEFINITIONS This License applies to any manual or other work that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. The "Document", below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as "you". A "Modified Version" of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language. A "Secondary Section" is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (For example, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any mathematics.) The relationship could be a matter of historical connection with the subject or with related matters, or of legal, commercial, philosophical, ethical or political position regarding them. The "Invariant Sections" are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. The "Cover Texts" are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. A "Transparent" copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, whose contents can be viewed and edited directly and straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing editor, and that is suitable for input to text formatters or for automatic translation to a variety of formats suitable for input to text formatters. A copy made in an otherwise Transparent file format whose markup has been designed to thwart or discourage subsequent modification by readers is not Transparent. A copy that is not "Transparent" is called "Opaque". Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML designed for human modification. Opaque formats include PostScript, PDF, proprietary formats that can be read and edited only by proprietary word processors, SGML or XML for which the DTD and/or processing tools are not generally available, and the machine-generated HTML produced by some word processors for output purposes only. The "Title Page" means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, "Title Page" means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text. 2. VERBATIM COPYING You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other conditions whatsoever to those of this License. You may not use technical measures to obstruct or control the reading or further copying of the copies you make or distribute. However, you may accept compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3. You may also lend copies, under the same conditions stated above, and you may publicly display copies. 3. COPYING IN QUANTITY If you publish printed copies of the Document numbering more than 100, and the Document's license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also clearly and legibly identify you as the publisher of these copies. The front cover must present the full title with all words of the title equally prominent and visible. You may add other material on the covers in addition. Copying with changes limited to the covers, as long as they preserve the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects. If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages. If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a publicly-accessible computer-network location containing a complete Transparent copy of the Document, free of added material, which the general network-using public has access to download anonymously at no charge using public-standard network protocols. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one year after the last time you distribute an Opaque copy (directly or through your agents or retailers) of that edition to the public. It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document. 4. MODIFICATIONS You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and modification of the Modified Version to whoever possesses a copy of it. In addition, you must do these things in the Modified Version: A. Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission. B. List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the Document (all of its principal authors, if it has less than five). C. State on the Title page the name of the publisher of the Modified Version, as the publisher. D. Preserve all the copyright notices of the Document. E. Add an appropriate copyright notice for your modifications adjacent to the other copyright notices. F. Include, immediately after the copyright notices, a license notice giving the public permission to use the Modified Version under the terms of this License, in the form shown in the Addendum below. G. Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Document's license notice. H. Include an unaltered copy of this License. I. Preserve the section entitled "History", and its title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title Page. If there is no section entitled "History" in the Document, create one stating the title, year, authors, and publisher of the Document as given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence. J. Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the "History" section. You may omit a network location for a work that was published at least four years before the Document itself, or if the original publisher of the version it refers to gives permission. K. In any section entitled "Acknowledgements" or "Dedications", preserve the section's title, and preserve in the section all the substance and tone of each of the contributor acknowledgements and/or dedications given therein. L. Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles. M. Delete any section entitled "Endorsements". Such a section may not be included in the Modified Version. N. Do not retitle any existing section as "Endorsements" or to conflict in title with any Invariant Section. If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles. You may add a section entitled "Endorsements", provided it contains nothing but endorsements of your Modified Version by various parties--for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard. You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one. The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. 5. COMBINING DOCUMENTS You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodified, and list them all as Invariant Sections of your combined work in its license notice. The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section if known, or else a unique number. Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work. In the combination, you must combine any sections entitled "History" in the various original documents, forming one section entitled "History"; likewise combine any sections entitled "Acknowledgements", and any sections entitled "Dedications". You must delete all sections entitled "Endorsements." 6. COLLECTIONS OF DOCUMENTS You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects. You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. 7. AGGREGATION WITH INDEPENDENT WORKS A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, does not as a whole count as a Modified Version of the Document, provided no compilation copyright is claimed for the compilation. Such a compilation is called an "aggregate", and this License does not apply to the other self-contained works thus compiled with the Document, on account of their being thus compiled, if they are not themselves derivative works of the Document. If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one quarter of the entire aggregate, the Document's Cover Texts may be placed on covers that surround only the Document within the aggregate. Otherwise they must appear on covers around the whole aggregate. 8. TRANSLATION Translation is considered a kind of modification, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include translations of some or all Invariant Sections in addition to the original versions of these Invariant Sections. You may include a translation of this License provided that you also include the original English version of this License. In case of a disagreement between the translation and the original English version of this License, the original English version will prevail. 9. TERMINATION You may not copy, modify, sublicense, or distribute the Document except as expressly provided for under this License. Any other attempt to copy, modify, sublicense or distribute the Document is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 10. FUTURE REVISIONS OF THIS LICENSE The Free Software Foundation may publish new, revised versions of the GNU Free Documentation 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. See http://www.gnu.org/copyleft/. Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License "or any later version" applies to it, you have the option of following the terms and conditions either of that specified version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation. ADDENDUM: How to use this License for your documents To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page: Copyright (c) YEAR YOUR NAME. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. A copy of the license is included in the section entitled "GNU Free Documentation License". If you have no Invariant Sections, write "with no Invariant Sections" instead of saying which ones are invariant. If you have no Front-Cover Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being LIST"; likewise for Back-Cover Texts. If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software. --- Artistic => <<'---', The Clarified Artistic License Preamble The intent of this document is to state the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package, while giving the users of the package the right to use and distribute the Package in a more-or-less customary fashion, plus the right to make reasonable modifications. Definitions: "Package" refers to the collection of files distributed by the Copyright Holder, and derivatives of that collection of files created through textual modification. "Standard Version" refers to such a Package if it has not been modified, or has been modified in accordance with the wishes of the Copyright Holder as specified below. "Copyright Holder" is whoever is named in the copyright or copyrights for the package. "You" is you, if you're thinking about copying or distributing this Package. "Distribution fee" is a fee you charge for providing a copy of this Package to another party. "Freely Available" means that no fee is charged for the right to use the item, though there may be fees involved in handling the item. It also means that recipients of the item may redistribute it under the same conditions they received it. 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain, or those made Freely Available, or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major network archive site allowing unrestricted access to them, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. e) permit and encourge anyone who receives a copy of the modified Package permission to make your modifications Freely Available in some specific way. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) give non-standard executables non-standard names, and clearly document the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. e) offer the machine-readable source of the Package, with your modifications, by mail order. 5. You may charge a distribution fee for any distribution of this Package. If you offer support for this Package, you may charge any fee you choose for that support. You may not charge a license fee for the right to use this Package itself. You may distribute this Package in aggregate with other (possibly commercial and possibly nonfree) programs as part of a larger (possibly commercial and possibly nonfree) software distribution, and charge license fees for other parts of that software distribution, provided that you do not advertise this Package as a product of your own. If the Package includes an interpreter, You may embed this Package's interpreter within an executable of yours (by linking); this shall be construed as a mere form of aggregation, provided that the complete Standard Version of the interpreter is so embedded. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whoever generated them, and may be sold commercially, and may be aggregated with this Package. If such scripts or library files are aggregated with this Package via the so-called "undump" or "unexec" methods of producing a binary executable image, then distribution of such an image shall neither be construed as a distribution of this Package nor shall it fall under the restrictions of Paragraphs 3 and 4, provided that you do not represent such an executable image as a Standard Version of this Package. 7. C subroutines (or comparably compiled subroutines in other languages) supplied by you and linked into this Package in order to emulate subroutines and variables of the language defined by this Package shall not be considered part of this Package, but are the equivalent of input as in Paragraph 6, provided these subroutines do not change the language in any way that would cause it to fail the regression tests for the language. 8. Aggregation of the Standard Version of the Package with a commercial distribution is always permitted provided that the use of this Package is embedded; that is, when no overt attempt is made to make this Package's interfaces visible to the end user of the commercial distribution. Such use shall not be construed as a distribution of this Package. 9. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 10. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End --- ); } dict-ns-20070206.orig/utils/.svn/text-base/unmunch.h.svn-base0000444000175000017500000000267610562150175022224 0ustar dokodoko/* unmunch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ void parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/.svn/text-base/hunmunch.c.svn-base0000444000175000017500000005127510562150175022366 0ustar dokodoko/* Munch a word list and generate a smaller root word list with affixes*/ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "hunmunch.h" int main(int argc, char** argv) { int i, j, k, n; int rl, p , nwl; int al; FILE * wrdlst; FILE * afflst; char *nword, *wf, *af; char as[(MAX_PREFIXES + MAX_SUFFIXES)]; char * ap; struct hentry * ep; struct hentry * ep1; struct affent * pfxp; struct affent * sfxp; /* first parse the command line options */ /* arg1 - wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; if (parse_aff_file(afflst)) { fprintf(stderr,"Error - in affix file loading\n"); exit(1); } fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } if (load_tables(wrdlst)) { fprintf(stderr,"Error building hash tables\n"); exit(1); } fclose(wrdlst); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { numroots = 0; aff_chk(ep->word,strlen(ep->word)); if (numroots) { /* now there might be a number of combinations */ /* of prefixes and suffixes that might match this */ /* word. So how to choose? As a first shot look */ /* for the shortest remaining root word to */ /* to maximize the combinatorial power */ /* but be careful, do not REQUIRE a specific combination */ /* of a prefix and a suffix to generate the word since */ /* that violates the rule that the root word with just */ /* the prefix or just the suffix must also exist in the */ /* wordlist as well */ /* in fact because of the cross product issue, this not a */ /* simple choice since some combinations of previous */ /* prefixes and new suffixes may not be valid. */ /* The only way to know is to simply try them all */ rl = 1000; p = -1; for (j = 0; j < numroots; j++){ /* first collect the root word info and build up */ /* the potential new affix string */ nword = (roots[j].hashent)->word; nwl = strlen(nword); *as = '\0'; al = 0; ap = as; if (roots[j].prefix) *ap++ = (roots[j].prefix)->achar; if (roots[j].suffix) *ap++ = (roots[j].suffix)->achar; if ((roots[j].hashent)->affstr) { strcpy(ap,(roots[j].hashent)->affstr); } else { *ap = '\0'; } al =strlen(as); /* now expand the potential affix string to generate */ /* all legal words and make sure they all exist in the */ /* word list */ numwords = 0; wlist[numwords].word = mystrdup(nword); wlist[numwords].pallow = 0; numwords++; n = 0; if (al) expand_rootword(nword,nwl,as,al); for (k=0; kkeep = 1; if (pfxp != NULL) add_affix_char(ep1,pfxp->achar); if (sfxp != NULL) add_affix_char(ep1,sfxp->achar); } else { ep->keep = 1; } } else { ep->keep = 1; } } } /* now output only the words to keep along with affixes info */ /* first count how many words that is */ k = 0; for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) k++; } } fprintf(stdout,"%d\n",k); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) { if (ep->affstr != NULL) { fprintf(stdout,"%s/%s\n",ep->word,ep->affstr); } else { fprintf(stdout,"%s\n",ep->word); } } } } return 0; } int parse_aff_file(FILE * afflst) { int i, j; int numents = 0; char achar = '\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; i = 0; ff = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { if (!fgets(line,MAX_LN_LEN,afflst)) return 1; mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d\n",numpfx,ptable[numpfx].num); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d\n",numsfx,stable[numsfx].num); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); return 0; } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* search for a prefix */ void pfx_chk (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strncmp(aent->appnd, word, aent->appndl) == 0) && tlen + aent->stripl >= aent->numconds) { if (aent->stripl) strcpy (tword, aent->strip); strcpy((tword + aent->stripl), (word + aent->appndl)); /* now go through the conds and make sure they all match */ cp = (unsigned char *) tword; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { tlen += aent->stripl; if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = aent; roots[numroots].suffix = NULL; numroots++; } } } } } } void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag) { struct affent * aent; int tlen; int cond; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { if ((cpflag & XPRODUCT) != 0 && (aent->xpflg & XPRODUCT) == 0) continue; tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strcmp(aent->appnd, (word + tlen)) == 0) && tlen + aent->stripl >= aent->numconds) { strcpy (tword, word); cp = (unsigned char *) (tword + tlen); if (aent->stripl) { strcpy ((char *)cp, aent->strip); tlen += aent->stripl; cp = (unsigned char *)(tword + tlen); } else *cp = '\0'; for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = pfxent; roots[numroots].suffix = aent; numroots++; } } } } } } void aff_chk (const char * word, int len) { int i; int j; int nh=0; char * nword; int nwl; if (len < 4) return; for (i=0; i < numpfx; i++) { pfx_chk(word, len, ptable[i].aep, ptable[i].num); } nh = numroots; if (nh > 0) { for (j=0;jxpflg & XPRODUCT) { nword = mystrdup((roots[j].hashent)->word); nwl = strlen(nword); for (i=0; i < numsfx; i++) { suf_chk(nword,nwl,stable[i].aep, stable[i].num, roots[j].prefix, XPRODUCT); } free(nword); } } } for (i=0; i < numsfx; i++) { suf_chk(word, len, stable[i].aep, stable[i].num, NULL, 0); } } /* lookup a root word in the hashtable */ struct hentry * lookup(const char *word) { struct hentry * dp; dp = &tableptr[hash(word)]; if (dp->word == NULL) return NULL; for ( ; dp != NULL; dp = dp->next) { if (strcmp(word,dp->word) == 0) return dp; } return NULL; } /* add a word to the hash table */ int add_word(char * word) { int i; struct hentry * dp; struct hentry * hp = (struct hentry *) malloc (sizeof(struct hentry)); hp->word = word; hp->affstr = NULL; hp->keep = 0; hp->next = NULL; i = hash(word); dp = &tableptr[i]; if (dp->word == NULL) { *dp = *hp; free(hp); } else { while (dp->next != NULL) dp=dp->next; dp->next = hp; } return 0; } /* load a word list and build a hash table on the fly */ int load_tables(FILE * wdlst) { char * ap; char ts[MAX_LN_LEN]; /* first read the first line of file to get hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wdlst)) return 2; mychomp(ts); tablesize = atoi(ts); tablesize = tablesize + 5; if ((tablesize %2) == 0) tablesize++; /* allocate the hash table */ tableptr = (struct hentry *) calloc(tablesize, sizeof(struct hentry)); if (! tableptr) return 3; /* loop thorugh all words on much list and add to hash * table and store away word and affix strings in tmpfile */ while (fgets(ts,MAX_LN_LEN-1,wdlst)) { mychomp(ts); ap = mystrdup(ts); add_word(ap); } return 0; } /* the hash function is a simple load and rotate * algorithm borrowed */ int hash(const char * word) { int i; long hv = 0; for (i=0; i < 4 && *word != 0; i++) hv = (hv << 8) | (*word++); while (*word != 0) { ROTATE(hv,ROTATE_LEN); hv ^= (*word++); } return (unsigned long) hv % tablesize; } void add_affix_char(struct hentry * ep, char ac) { int al; int i; char * tmp; if (ep->affstr == NULL) { ep->affstr = (char *) malloc(2*sizeof(char)); *(ep->affstr) = ac; *((ep->affstr)+1) = '\0'; return; } al = strlen(ep->affstr); for (i=0; i< al; i++) if (ac == (ep->affstr)[i]) return; tmp = calloc((al+2),sizeof(char)); memcpy(tmp,ep->affstr,(al+1)); *(tmp+al) = ac; *(tmp+al+1)='\0'; free(ep->affstr); ep->affstr = tmp; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if (k > 0) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/.svn/text-base/hununmunch.c.svn-base0000444000175000017500000003074110562150175022724 0ustar dokodoko/* Un-munch a root word list with affix tags * to recreate the original word list */ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "hununmunch.h" int main(int argc, char** argv) { int i; int al, wl; FILE * wrdlst; FILE * afflst; char *wf, *af; char * ap; char ts[MAX_LN_LEN]; /* first parse the command line options */ /* arg1 - munched wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; if (parse_aff_file(afflst)) { fprintf(stderr,"Error - in affix file loading\n"); exit(1); } fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } /* skip over the hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wrdlst)) return 2; mychomp(ts); while (fgets(ts,MAX_LN_LEN-1,wrdlst)) { mychomp(ts); /* split each line into word and affix char strings */ ap = strchr(ts,'/'); if (ap) { *ap = '\0'; ap++; al = strlen(ap); } else { al = 0; ap = NULL; } wl = strlen(ts); numwords = 0; wlist[numwords].word = mystrdup(ts); wlist[numwords].pallow = 0; numwords++; if (al) expand_rootword(ts,wl,ap,al); for (i=0; i < numwords; i++) { fprintf(stdout,"%s\n",wlist[i].word); free(wlist[i].word); wlist[i].word = NULL; wlist[i].pallow = 0; } } fclose(wrdlst); return 0; } int parse_aff_file(FILE * afflst) { int i, j; int numents=0; char achar='\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; ff = 0; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { if (!fgets(line,MAX_LN_LEN,afflst)) return 1; mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d flag %c\n",numpfx,ptable[numpfx].num,ptr->achar); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d flag %c\n",numsfx,stable[numsfx].num,ptr->achar); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); return 0; } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds) && ((aent->stripl == 0) || (strncmp(aent->strip, word, aent->stripl) == 0))) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds) && ((aent->stripl == 0) || (strcmp(aent->strip, word + len - aent->stripl - 1) == 0))) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if ((k > 0) && (*(s+k-1) == '\n')) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/.svn/text-base/csv2acor.py.svn-base0000444000175000017500000000676710562150175022477 0ustar dokodoko#!/usr/bin/env python # -*- coding: UTF-8 -*- # Copyright 2005, Sren Thing Pedersen stp@things.dk, Licensed under LGPL import os, sys, zipfile, zlib, csv SentenceExceptList = 'SentenceExceptList.csv' WordExceptList = 'WordExceptList.csv' DocumentList = 'DocumentList.csv' manifest = """ """ fileheader = """ """ filefooter = '' class calc(csv.Dialect): delimiter = ',' quotechar = '"' doublequote = False quoting = csv.QUOTE_ALL escapechar = '\\' skipinitialspace = True lineterminator = '\r\n' def zip_dir_into_file(dir, file): zfobj = zipfile.ZipFile(file, 'w', zipfile.ZIP_DEFLATED) for root, dirs, files in os.walk(dir): for thisfile in files: # print os.path.join(root,thisfile) zfobj.write(os.path.join(root, thisfile), os.path.join(root, thisfile).replace(dir, "")[1:]) zfobj.close() if len(sys.argv) != 2: print 'Usage: '+sys.argv[0]+' destinationfile' else: destinationfile = sys.argv[1] tempdir = destinationfile+'_tmp' if os.path.exists(SentenceExceptList) and os.path.exists(WordExceptList) and os.path.exists(DocumentList): if not (os.path.exists(tempdir)): os.mkdir(tempdir, 0777) if not (os.path.exists(tempdir+'/Meta-inf/')): os.mkdir(tempdir+'/Meta-inf/', 0777) manifestfile = open(os.path.join(tempdir+'/Meta-inf/', 'manifest.xml'), 'wb') manifestfile.write(manifest) manifestfile.close() mimetypefile = open(os.path.join(tempdir, 'mimetype'), 'wb') mimetypefile.write('') mimetypefile.close() DocumentListfile = open(os.path.join(tempdir, 'DocumentList.xml'), 'wb') DocumentListfile.write(fileheader+"\n") csvreader = csv.reader(file(DocumentList), calc) for row in csvreader: line = ' '+"\n"; DocumentListfile.write(line) DocumentListfile.write(filefooter+"\n") DocumentListfile.close() SentenceExceptListfile = open(os.path.join(tempdir, 'SentenceExceptList.xml'), 'wb') SentenceExceptListfile.write(fileheader+"\n") csvreader = csv.reader(file(SentenceExceptList), calc) for row in csvreader: line = ' '+"\n"; SentenceExceptListfile.write(line) SentenceExceptListfile.write(filefooter+"\n") SentenceExceptListfile.close() WordExceptListfile = open(os.path.join(tempdir, 'WordExceptList.xml'), 'wb') WordExceptListfile.write(fileheader+"\n") csvreader = csv.reader(file(WordExceptList), calc) for row in csvreader: line = ' '+"\n"; WordExceptListfile.write(line) WordExceptListfile.write(filefooter+"\n") WordExceptListfile.close() zip_dir_into_file(tempdir, destinationfile) else: print "SentenceExceptList.csv, WordExceptList.csv or DocumentList.csv missing!" dict-ns-20070206.orig/utils/.svn/text-base/hunmunch.h.svn-base0000444000175000017500000000461510562150175022367 0ustar dokodoko/* munch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_ROOTS 20 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; /* data structure to store results of lookups */ struct matches { struct hentry * hashent; /* hash table entry */ struct affent * prefix; /* Prefix used, or NULL */ struct affent * suffix; /* Suffix used, or NULL */ }; int numroots; /* number of root words found */ struct matches roots[MAX_ROOTS]; /* list of root words found */ /* hashing stuff */ struct hentry { char * word; char * affstr; struct hentry * next; int keep; }; int tablesize; struct hentry * tableptr; /* unmunch stuff */ int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ int parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int load_tables(FILE * wrdlst); int hash(const char *); int add_word(char *); struct hentry * lookup(const char *); void aff_chk (const char * word, int len); void pfx_chk (const char * word, int len, struct affent* ep, int num); void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag); void add_affix_char(struct hentry * hent, char ac); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/.svn/text-base/README.aspell.svn-base0000444000175000017500000000025410562150175022523 0ustar dokodokoAspell needs these files: proc & configure - ftp://ftp.gnu.org/gnu/aspell/dict/0gen/aspell-gen-0.50.4.tar.bz2 Generates the files needed for an aspell dictionary package dict-ns-20070206.orig/utils/.svn/text-base/Makefile.svn-base0000444000175000017500000000053410562150175022025 0ustar dokodoko# Makefile for munch and unmunch TARGETS=munch unmunch hunmunch hununmunch all: $(TARGETS) clean: rm -f $(TARGETS) munch: munch.c munch.h gcc -O2 -o $@ munch.c unmunch: unmunch.c unmunch.h gcc -O2 -o $@ unmunch.c hunmunch: hunmunch.c hunmunch.h gcc -O2 -o $@ hunmunch.c hununmunch: hununmunch.c hununmunch.h gcc -O2 -o $@ hununmunch.c dict-ns-20070206.orig/utils/.svn/text-base/.cvsignore.svn-base0000444000175000017500000000001610562150175022360 0ustar dokodokomunch unmunch dict-ns-20070206.orig/utils/.svn/text-base/hununmunch.h.svn-base0000444000175000017500000000267510562150175022736 0ustar dokodoko/* unmunch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ int parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/.svn/prop-base/0000755000175000017500000000000010562150175016644 5ustar dokodokodict-ns-20070206.orig/utils/.svn/prop-base/configure.svn-base0000444000175000017500000000015310562150175022262 0ustar dokodokoK 13 svn:eol-style V 6 native K 14 svn:executable V 1 * K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/README.myspell-mozilla-xpi.svn-base0000444000175000017500000000012110562150175025160 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/install.js.in.svn-base0000444000175000017500000000012110562150175022762 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/munch.c.svn-base0000444000175000017500000000012110562150175021627 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/README.svn-base0000444000175000017500000000012110562150175021231 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/unmunch.c.svn-base0000444000175000017500000000012110562150175022172 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/Makefile.language.svn-base0000444000175000017500000000012110562150175023573 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/munch.h.svn-base0000444000175000017500000000012110562150175021634 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/proc.svn-base0000444000175000017500000000015310562150175021244 0ustar dokodokoK 13 svn:eol-style V 6 native K 14 svn:executable V 1 * K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/unmunch.h.svn-base0000444000175000017500000000012110562150175022177 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/hunmunch.c.svn-base0000444000175000017500000000012110562150175022342 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/hununmunch.c.svn-base0000444000175000017500000000012110562150175022705 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/csv2acor.py.svn-base0000444000175000017500000000015310562150175022452 0ustar dokodokoK 13 svn:eol-style V 6 native K 14 svn:executable V 1 * K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/hunmunch.h.svn-base0000444000175000017500000000012110562150175022347 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/README.aspell.svn-base0000444000175000017500000000012110562150175022510 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/Makefile.svn-base0000444000175000017500000000012110562150175022011 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/.cvsignore.svn-base0000444000175000017500000000012110562150175022351 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/prop-base/hununmunch.h.svn-base0000444000175000017500000000012110562150175022712 0ustar dokodokoK 13 svn:eol-style V 6 native K 12 svn:keywords V 23 Author Date Id Revision END dict-ns-20070206.orig/utils/.svn/props/0000755000175000017500000000000010562150175016117 5ustar dokodokodict-ns-20070206.orig/utils/.svn/tmp/0000755000175000017500000000000010562150175015554 5ustar dokodokodict-ns-20070206.orig/utils/.svn/tmp/text-base/0000755000175000017500000000000010562150175017450 5ustar dokodokodict-ns-20070206.orig/utils/.svn/tmp/prop-base/0000755000175000017500000000000010562150175017444 5ustar dokodokodict-ns-20070206.orig/utils/.svn/tmp/props/0000755000175000017500000000000010562150175016717 5ustar dokodokodict-ns-20070206.orig/utils/.svn/entries0000444000175000017500000000533210562150175016351 0ustar dokodoko8 dir 9074 https://zaf.svn.sourceforge.net/svnroot/zaf/trunk/dict/utils https://zaf.svn.sourceforge.net/svnroot/zaf 2006-09-20T14:55:47.000000Z 8917 dwaynebailey has-props svn:special svn:externals svn:needs-lock 2ddcbd3e-7f1e-0410-b01d-e1bca9a1112e configure file 2007-02-06T19:01:17.000000Z 58f58a4c7af0df196dc3ecf7658967a1 2004-03-21T14:38:29.000000Z 6698 dwaynebailey has-props README.myspell-mozilla-xpi file 2007-02-06T19:01:17.000000Z 6cb16bf7c547a70a852e67c0f3994dfa 2004-05-12T21:07:22.000000Z 6798 dwaynebailey has-props install.js.in file 2007-02-06T19:01:17.000000Z d3a5c4dcdbf98f01f42180e23c756b6c 2004-05-12T21:07:22.000000Z 6798 dwaynebailey has-props munch.c file 2007-02-06T19:01:17.000000Z 43aadbbf05b71bc2e9c420e36d38a782 2003-05-21T18:13:09.000000Z 6090 davidfraser has-props README file 2007-02-06T19:01:17.000000Z 7ca101f6ac9f24b11201df18bfb5f64b 2003-12-09T14:46:47.000000Z 6612 davidfraser has-props unmunch.c file 2007-02-06T19:01:17.000000Z 3972c09237cf697cba8a7ed85740ca11 2003-05-21T18:13:09.000000Z 6090 davidfraser has-props Makefile.language file 2007-02-06T19:01:17.000000Z 92dfcaba3740351381bcd2e8d81162b9 2006-01-18T17:07:44.000000Z 8383 dwaynebailey has-props munch.h file 2007-02-06T19:01:17.000000Z 0106fc4590f29cbcd3dc976dff045d78 2003-05-21T18:13:09.000000Z 6090 davidfraser has-props unmunch.h file 2007-02-06T19:01:17.000000Z 037c5612de25f88a6bf1b409385582a6 2003-05-21T18:13:09.000000Z 6090 davidfraser has-props proc file 2007-02-06T19:01:17.000000Z 442f766556cedfbef293c69e522529fb 2004-05-15T22:31:57.000000Z 6812 dwaynebailey has-props hunmunch.c file 2007-02-06T19:01:17.000000Z 6e05159f785ebcf9385d65deef561ad1 2006-09-20T14:55:47.000000Z 8917 dwaynebailey has-props csv2acor.py file 2007-02-06T19:01:17.000000Z c5f13eaeaab208150d84e273a2152872 2006-01-17T17:34:23.000000Z 8365 dwaynebailey has-props hununmunch.c file 2007-02-06T19:01:17.000000Z 4509130caa1e672d03d8eb4531b72f68 2006-09-20T14:55:47.000000Z 8917 dwaynebailey has-props hunmunch.h file 2007-02-06T19:01:17.000000Z e3a1b78db237d55b59e8abde18215b2c 2006-09-20T14:55:47.000000Z 8917 dwaynebailey has-props README.aspell file 2007-02-06T19:01:17.000000Z e8104a8431d914514b74b8f67bb1062f 2004-05-15T22:31:57.000000Z 6812 dwaynebailey has-props Makefile file 2007-02-06T19:01:17.000000Z 4711df780d50e28b8af501b6a16ed38c 2006-09-20T14:55:47.000000Z 8917 dwaynebailey has-props .cvsignore file 2007-02-06T19:01:17.000000Z 3a356f318ac29548da53b587cf67758d 2006-01-18T13:57:18.000000Z 8379 dwaynebailey has-props hununmunch.h file 2007-02-06T19:01:17.000000Z 9482ef6b6ecf9fd26cae2a2fad341cd3 2006-09-20T14:55:47.000000Z 8917 dwaynebailey has-props dict-ns-20070206.orig/utils/.svn/format0000444000175000017500000000000210562150175016155 0ustar dokodoko8 dict-ns-20070206.orig/utils/.svn/dir-prop-base0000444000175000017500000000005010562150175017334 0ustar dokodokoK 10 svn:ignore V 14 munch unmunch END dict-ns-20070206.orig/utils/.svn/all-wcprops0000444000175000017500000000374210562150175017146 0ustar dokodokoK 25 svn:wc:ra_dav:version-url V 43 /svnroot/zaf/!svn/ver/8917/trunk/dict/utils END configure K 25 svn:wc:ra_dav:version-url V 53 /svnroot/zaf/!svn/ver/6698/trunk/dict/utils/configure END README.myspell-mozilla-xpi K 25 svn:wc:ra_dav:version-url V 70 /svnroot/zaf/!svn/ver/6798/trunk/dict/utils/README.myspell-mozilla-xpi END install.js.in K 25 svn:wc:ra_dav:version-url V 57 /svnroot/zaf/!svn/ver/6798/trunk/dict/utils/install.js.in END munch.c K 25 svn:wc:ra_dav:version-url V 51 /svnroot/zaf/!svn/ver/6090/trunk/dict/utils/munch.c END README K 25 svn:wc:ra_dav:version-url V 50 /svnroot/zaf/!svn/ver/6612/trunk/dict/utils/README END unmunch.c K 25 svn:wc:ra_dav:version-url V 53 /svnroot/zaf/!svn/ver/6090/trunk/dict/utils/unmunch.c END Makefile.language K 25 svn:wc:ra_dav:version-url V 61 /svnroot/zaf/!svn/ver/8383/trunk/dict/utils/Makefile.language END munch.h K 25 svn:wc:ra_dav:version-url V 51 /svnroot/zaf/!svn/ver/6090/trunk/dict/utils/munch.h END unmunch.h K 25 svn:wc:ra_dav:version-url V 53 /svnroot/zaf/!svn/ver/6090/trunk/dict/utils/unmunch.h END proc K 25 svn:wc:ra_dav:version-url V 48 /svnroot/zaf/!svn/ver/6812/trunk/dict/utils/proc END hunmunch.c K 25 svn:wc:ra_dav:version-url V 54 /svnroot/zaf/!svn/ver/8917/trunk/dict/utils/hunmunch.c END csv2acor.py K 25 svn:wc:ra_dav:version-url V 55 /svnroot/zaf/!svn/ver/8365/trunk/dict/utils/csv2acor.py END hununmunch.c K 25 svn:wc:ra_dav:version-url V 56 /svnroot/zaf/!svn/ver/8917/trunk/dict/utils/hununmunch.c END hunmunch.h K 25 svn:wc:ra_dav:version-url V 54 /svnroot/zaf/!svn/ver/8917/trunk/dict/utils/hunmunch.h END README.aspell K 25 svn:wc:ra_dav:version-url V 57 /svnroot/zaf/!svn/ver/6812/trunk/dict/utils/README.aspell END Makefile K 25 svn:wc:ra_dav:version-url V 52 /svnroot/zaf/!svn/ver/8917/trunk/dict/utils/Makefile END .cvsignore K 25 svn:wc:ra_dav:version-url V 54 /svnroot/zaf/!svn/ver/8379/trunk/dict/utils/.cvsignore END hununmunch.h K 25 svn:wc:ra_dav:version-url V 56 /svnroot/zaf/!svn/ver/8917/trunk/dict/utils/hununmunch.h END dict-ns-20070206.orig/utils/configure0000755000175000017500000000476110562150175016007 0ustar dokodoko#!/bin/sh # Note: future version will have a syntax something like # ./configure [OPTIONS] # Where OPTIONS is any of: # --help # --codes CODE1 ... # --sizes SIZE1 ... # --jargons JARGON1 ... # --extras EXTRA1 ... # --vars VAR1=VAL1 ... # which is why I warn when --vars is not used before VAR1=VAL1 # Avoid depending upon Character Ranges. # Taken from autoconf 2.50 cr_az='abcdefghijklmnopqrstuvwxyz' cr_AZ='ABCDEFGHIJKLMNOPQRSTUVWXYZ' cr_09='0123456789' cr_alnum=$cr_az$cr_AZ$cr_09 # also taken form autoconf case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in *c*,-n*) ECHO_N= ECHO_C=' ' ECHO_T=' ' ;; *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; *) ECHO_N= ECHO_C='\c' ECHO_T= ;; esac mode=none for option do case $option in --vars) mode=vars ;; *=*) if test $mode != vars; then echo "Warning: future versions will require --vars before variables are set" mode=vars fi # Taken from autoconf 2.50 envvar=`expr "x$option" : 'x\([^=]*\)='` optarg=`expr "x$option" : 'x[^=]*=\(.*\)'` # Reject names that are not valid shell variable names. expr "x$envvar" : ".*[^_$cr_alnum]" >/dev/null && { echo "$as_me: error: invalid variable name: $envvar" >&2 { (exit 1); exit 1; }; } #echo $envvar $optarg optarg=`echo "$optarg" | sed "s/'/'\\\\\\\\''/g"` eval "$envvar='$optarg'" export $envvar ;; --help) echo "Usage: ./configure [--help | --vars VAR1=VAL1 ...]" echo " Note: Variables may also be set in the environment brefore running config" echo " Useful vars: ASPELL ASPELL_PARMS WORD_LIST_COMPRESS DESTDIR" exit 0 ;; *) echo "Error: unrecognized option $option"; exit 1 ;; esac done #echo $ASPELL if test x = "x$ASPELL" then ASPELL=aspell; fi if test x = "x$WORD_LIST_COMPRESS" then WORD_LIST_COMPRESS=word-list-compress; fi #echo $ASPELL echo $ECHO_N "Finding Dictionary file location ... $ECHO_C" dictdir=`$ASPELL dump config dict-dir` echo $dictdir echo $ECHO_N "Finding Data file location ... $ECHO_C" datadir=`$ASPELL dump config data-dir` echo $datadir echo "ASPELL = `which $ASPELL`" > Makefile echo "ASPELL_FLAGS = $ASPELL_FLAGS" >> Makefile echo "WORD_LIST_COMPRESS = `which $WORD_LIST_COMPRESS`" >> Makefile echo "DESTDIR = $DESTDIR" >> Makefile echo "dictdir = $dictdir" >> Makefile echo "datadir = $datadir" >> Makefile echo >> Makefile cat Makefile.pre >> Makefile dict-ns-20070206.orig/utils/README.myspell-mozilla-xpi0000644000175000017500000000044110562150175020676 0ustar dokodokoTo build a MySpell spellchacker packed as an XPI for Mozilla we need an install.js file. install.js.in - is a generic template file used by the spellchecker framework. This file was obtained from the British English spellchecker: http://downloads.mozdev.org/dictionaries/spell-en-GB.xpi dict-ns-20070206.orig/utils/install.js.in0000644000175000017500000000172510562150175016506 0ustar dokodoko// Spell checking dictionary for Mozilla Thunderbird // Script written by rockstiff. Dictionary from openoffice.org const APP_DISPLAY_NAME = "{LANGNAME} ({REGIONNAME}) dictionary"; const APP_NAME = "spell-{LANG}-{REGION}"; const APP_PACKAGE = "dictionaries.mozdev.org/spell-{LANG}-{REGION}"; const APP_VERSION = "{VERSION}"; var err = initInstall(APP_NAME, APP_PACKAGE, APP_VERSION); if (err==SUCCESS) { // Copy files to Components/myspell var myspell_folder = getFolder("Components", "myspell"); addFile(APP_NAME, "{LANG}-{REGION}.dic", myspell_folder, ""); addFile(APP_NAME, "{LANG}-{REGION}.aff", myspell_folder, ""); addFile(APP_NAME, "README-{LANG}-{REGION}.txt", myspell_folder, ""); err = performInstall(); if(err == SUCCESS || err == 999) { alert(APP_DISPLAY_NAME+" (v "+APP_VERSION+") has been succesfully installed.\n"); } else { alert("Installation failed. Error:" + err); cancelInstall(err); } } else { cancelInstall(err); } dict-ns-20070206.orig/utils/munch.c0000644000175000017500000005112010562150175015345 0ustar dokodoko/* Munch a word list and generate a smaller root word list with affixes*/ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "munch.h" int main(int argc, char** argv) { int i, j, k, n; int rl, p , nwl; int al; FILE * wrdlst; FILE * afflst; char *nword, *wf, *af; char as[(MAX_PREFIXES + MAX_SUFFIXES)]; char * ap; struct hentry * ep; struct hentry * ep1; struct affent * pfxp; struct affent * sfxp; /* first parse the command line options */ /* arg1 - wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; parse_aff_file(afflst); fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } if (load_tables(wrdlst)) { fprintf(stderr,"Error building hash tables\n"); exit(1); } fclose(wrdlst); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { numroots = 0; aff_chk(ep->word,strlen(ep->word)); if (numroots) { /* now there might be a number of combinations */ /* of prefixes and suffixes that might match this */ /* word. So how to choose? As a first shot look */ /* for the shortest remaining root word to */ /* to maximize the combinatorial power */ /* but be careful, do not REQUIRE a specific combination */ /* of a prefix and a suffix to generate the word since */ /* that violates the rule that the root word with just */ /* the prefix or just the suffix must also exist in the */ /* wordlist as well */ /* in fact because of the cross product issue, this not a */ /* simple choice since some combinations of previous */ /* prefixes and new suffixes may not be valid. */ /* The only way to know is to simply try them all */ rl = 1000; p = -1; for (j = 0; j < numroots; j++){ /* first collect the root word info and build up */ /* the potential new affix string */ nword = (roots[j].hashent)->word; nwl = strlen(nword); *as = '\0'; al = 0; ap = as; if (roots[j].prefix) *ap++ = (roots[j].prefix)->achar; if (roots[j].suffix) *ap++ = (roots[j].suffix)->achar; if ((roots[j].hashent)->affstr) { strcpy(ap,(roots[j].hashent)->affstr); } else { *ap = '\0'; } al =strlen(as); /* now expand the potential affix string to generate */ /* all legal words and make sure they all exist in the */ /* word list */ numwords = 0; wlist[numwords].word = mystrdup(nword); wlist[numwords].pallow = 0; numwords++; n = 0; if (al) expand_rootword(nword,nwl,as,al); for (k=0; kkeep = 1; if (pfxp != NULL) add_affix_char(ep1,pfxp->achar); if (sfxp != NULL) add_affix_char(ep1,sfxp->achar); } else { ep->keep = 1; } } else { ep->keep = 1; } } } /* now output only the words to keep along with affixes info */ /* first count how many words that is */ k = 0; for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) k++; } } fprintf(stdout,"%d\n",k); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) { if (ep->affstr != NULL) { fprintf(stdout,"%s/%s\n",ep->word,ep->affstr); } else { fprintf(stdout,"%s\n",ep->word); } } } } return 0; } void parse_aff_file(FILE * afflst) { int i, j; int numents = 0; char achar = '\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; i = 0; ff = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { fgets(line,MAX_LN_LEN,afflst); mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d\n",numpfx,ptable[numpfx].num); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d\n",numsfx,stable[numsfx].num); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* search for a prefix */ void pfx_chk (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strncmp(aent->appnd, word, aent->appndl) == 0) && tlen + aent->stripl >= aent->numconds) { if (aent->stripl) strcpy (tword, aent->strip); strcpy((tword + aent->stripl), (word + aent->appndl)); /* now go through the conds and make sure they all match */ cp = (unsigned char *) tword; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { tlen += aent->stripl; if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = aent; roots[numroots].suffix = NULL; numroots++; } } } } } } void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag) { struct affent * aent; int tlen; int cond; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { if ((cpflag & XPRODUCT) != 0 && (aent->xpflg & XPRODUCT) == 0) continue; tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strcmp(aent->appnd, (word + tlen)) == 0) && tlen + aent->stripl >= aent->numconds) { strcpy (tword, word); cp = (unsigned char *) (tword + tlen); if (aent->stripl) { strcpy ((char *)cp, aent->strip); tlen += aent->stripl; cp = (unsigned char *)(tword + tlen); } else *cp = '\0'; for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = pfxent; roots[numroots].suffix = aent; numroots++; } } } } } } void aff_chk (const char * word, int len) { int i; int j; int nh=0; char * nword; int nwl; if (len < 4) return; for (i=0; i < numpfx; i++) { pfx_chk(word, len, ptable[i].aep, ptable[i].num); } nh = numroots; if (nh > 0) { for (j=0;jxpflg & XPRODUCT) { nword = mystrdup((roots[j].hashent)->word); nwl = strlen(nword); for (i=0; i < numsfx; i++) { suf_chk(nword,nwl,stable[i].aep, stable[i].num, roots[j].prefix, XPRODUCT); } free(nword); } } } for (i=0; i < numsfx; i++) { suf_chk(word, len, stable[i].aep, stable[i].num, NULL, 0); } } /* lookup a root word in the hashtable */ struct hentry * lookup(const char *word) { struct hentry * dp; dp = &tableptr[hash(word)]; if (dp->word == NULL) return NULL; for ( ; dp != NULL; dp = dp->next) { if (strcmp(word,dp->word) == 0) return dp; } return NULL; } /* add a word to the hash table */ int add_word(char * word) { int i; struct hentry * dp; struct hentry * hp = (struct hentry *) malloc (sizeof(struct hentry)); hp->word = word; hp->affstr = NULL; hp->keep = 0; hp->next = NULL; i = hash(word); dp = &tableptr[i]; if (dp->word == NULL) { *dp = *hp; free(hp); } else { while (dp->next != NULL) dp=dp->next; dp->next = hp; } return 0; } /* load a word list and build a hash table on the fly */ int load_tables(FILE * wdlst) { char * ap; char ts[MAX_LN_LEN]; /* first read the first line of file to get hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wdlst)) return 2; mychomp(ts); tablesize = atoi(ts); tablesize = tablesize + 5; if ((tablesize %2) == 0) tablesize++; /* allocate the hash table */ tableptr = (struct hentry *) calloc(tablesize, sizeof(struct hentry)); if (! tableptr) return 3; /* loop thorugh all words on much list and add to hash * table and store away word and affix strings in tmpfile */ while (fgets(ts,MAX_LN_LEN-1,wdlst)) { mychomp(ts); ap = mystrdup(ts); add_word(ap); } return 0; } /* the hash function is a simple load and rotate * algorithm borrowed */ int hash(const char * word) { int i; long hv = 0; for (i=0; i < 4 && *word != 0; i++) hv = (hv << 8) | (*word++); while (*word != 0) { ROTATE(hv,ROTATE_LEN); hv ^= (*word++); } return (unsigned long) hv % tablesize; } void add_affix_char(struct hentry * ep, char ac) { int al; int i; char * tmp; if (ep->affstr == NULL) { ep->affstr = (char *) malloc(2*sizeof(char)); *(ep->affstr) = ac; *((ep->affstr)+1) = '\0'; return; } al = strlen(ep->affstr); for (i=0; i< al; i++) if (ac == (ep->affstr)[i]) return; tmp = calloc((al+2),sizeof(char)); memcpy(tmp,ep->affstr,(al+1)); *(tmp+al) = ac; *(tmp+al+1)='\0'; free(ep->affstr); ep->affstr = tmp; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if (k > 0) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/README0000644000175000017500000001036710562150175014757 0ustar dokodokoThis directory contains code from myspell relevant to processing dictionaries (currently just the munch and unmunch utilities). The code was taken directly from http://lingucomponent.openoffice.org/MySpell-3.zip We have copied it here to make building dictionaries easier The README from myspell follows ; for more information see Makefile You can run munch or unmunch to get command line help -------------------------------------------------- MySpell is a simple spell checker that uses affix compression and is modelled after the spell checker ispell. MySpell was written to explore how affix compression can be implemented. The Main features of MySpell are: 1. written in C++ to make it easier to interface with Pspell, OpenOffice, AbiWord, etc 2. it is stateless, uses no static variables and should be completely reentrant with almost no ifdefs 3. it tries to be as compatible with ispell to the extent it can. It can read slightly modified versions of munched ispell dictionaries (and it comes with a munched english wordlist borrowed from Kevin Atkinson's excellent Aspell. 4. it uses a heavily modified aff file format that can be derived from ispell aff files but uses the iso-8859-X character sets only 5. it is simple with *lots* of comments that describes how the affixes are stored and tested for (based on the approach used by ispell). 6. it supports improved suggestions with replacement tables and ngram-scoring based mechanisms in addition to the main suggestion mechanisms 7. like ispell it has a BSD license (and no advertising clause) But ... it has *no* support for adding words to a personal dictionary, *no* support for converting between various text encodings, and *no* command line interface (it is purely meant to be a library). It can not (in any way) replace all of the functionality of ispell or aspell/pspell. It is meant as a learning tool for understanding affix compression and for being used by front ends like OpenOffice, Abiword, etc. MySpell has been tested under Linux and Solaris and has the world's simplest Makefile and no configure support. It does come with a simple example program that spell checks some words and returns suggestions. To build a static library and an example program under Linux simply type: tar -zxvf myspell.tar.gz cd myspell2 make To run the example program: ./example ./en_US.aff ./en_US.dic checkme.lst Please play around with it and let me know what you think. Developer Credits: Special credit and thanks go to ispell's creator Geoff Kuenning. Ispell affix compression code was used as the basis for the affix code used in MySpell. Specifically Geoff's use of a conds[] array that makes it easy to check if the conditions required for a particular affix are present was very ingenious! Kudos to Geoff. Very nicely done. BTW: ispell is available under a BSD style license from Geoff Kuennings ispell website: http://www.cs.ucla.edu/ficus-members/geoff/ispell.html The Original MySpell code was written by Kevin Hendricks and released under a BSD license. An almost complete rewrite of MySpell for use by the Mozilla project has been developed by David Einstein (Deinst@world.std.com). David and I are now working on parallel development tracks to help our respective projects (Mozilla and OpenOffice.org and we will maintain full affix file and dictionary file compatibility and work on merging our versions of MySpell back into a single tree. David has been a significant help in improving MySpell. La'szlo' Ne'meth who is the author of the Hungarian dictionary and who developed and contributed the code to support compound words in MySpell and fixed numerous problems with the encoding case conversion tables. He also introduced the idea and is the author of the code to support replacement tables which greatly improved suggestions. Davide Prina , Giuseppe Modugno , Gianluca Turconi all from the it_IT OpenOffice.org team for a detailed code review of MySpell and fixes for bugs, leaks, and speedup improvements. Special Thanks to all others who have either contributed ideas or testing for MySpell Thanks, Kevin Hendricks kevin.hendricks@sympatico.ca dict-ns-20070206.orig/utils/unmunch.c0000644000175000017500000003021110562150175015706 0ustar dokodoko/* Un-munch a root word list with affix tags * to recreate the original word list */ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "unmunch.h" int main(int argc, char** argv) { int i; int al, wl; FILE * wrdlst; FILE * afflst; char *wf, *af; char * ap; char ts[MAX_LN_LEN]; /* first parse the command line options */ /* arg1 - munched wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; parse_aff_file(afflst); fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } /* skip over the hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wrdlst)) return 2; mychomp(ts); while (fgets(ts,MAX_LN_LEN-1,wrdlst)) { mychomp(ts); /* split each line into word and affix char strings */ ap = strchr(ts,'/'); if (ap) { *ap = '\0'; ap++; al = strlen(ap); } else { al = 0; ap = NULL; } wl = strlen(ts); numwords = 0; wlist[numwords].word = mystrdup(ts); wlist[numwords].pallow = 0; numwords++; if (al) expand_rootword(ts,wl,ap,al); for (i=0; i < numwords; i++) { fprintf(stdout,"%s\n",wlist[i].word); free(wlist[i].word); wlist[i].word = NULL; wlist[i].pallow = 0; } } fclose(wrdlst); return 0; } void parse_aff_file(FILE * afflst) { int i, j; int numents=0; char achar='\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; ff = 0; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { fgets(line,MAX_LN_LEN,afflst); mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d flag %c\n",numpfx,ptable[numpfx].num,ptr->achar); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d flag %c\n",numsfx,stable[numsfx].num,ptr->achar); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if (k > 0) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/Makefile.language0000644000175000017500000001543510562150175017322 0ustar dokodoko# this makefile is used to automate building of dictionaries # based on affix files etc... # if you need to adapt this Makefile for another language, # all you should have to do is change these variables. # if you need to change anything else, please submit it back # to the project so other people can benefit # The version will automatically be read in from the VERSION file VERSION=$(shell cat VERSION) VERSION_ASPELL=$(shell cat ../VERSION.aspell) # Only set these if the user has not overridden them in the language Makefile LANG_FAKE?=$(LANG) REGION_FAKE?=$(REGION) .PHONY: all clean clean-myspell clean-ispell clean-aspell clean-autocorr ispell myspell aspell count check wordlist autocorr TARGETS_MYSPELL=myspell/wordlist.$(CHARSET) myspell/pack-$(LANG)-$(REGION)-$(VERSION).zip myspell/$(LANG)_$(REGION).zip myspell/$(LANG)_$(REGION).dic myspell/spell.txt myspell/VERSION_$(LANG)_$(REGION).txt myspell/install.js myspell/spell-$(LANG)-$(REGION).xpi myspell/$(LANG)-$(REGION).dic myspell/$(LANG)-$(REGION).aff myspell/README-$(LANG)-$(REGION).txt TARGETS_ISPELL=ispell/$(LANGNAMELOW).hash ispell/$(LANGNAMELOW)-ispell-$(VERSION).tar.bz2 ispell/wordlist.$(CHARSET) ispell/wordlist.$(CHARSET).cnt ispell/wordlist.$(CHARSET).stat TARGET_ASPELL=aspell/wordlist.$(CHARSET) aspell/$(LANG).rws aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION).tar.bz2 aspell/proc aspell/configure aspell/$(LANG).cwl aspell/info aspell/Makefile aspell/Makefile.pre aspell/$(LANG).* aspell/*.alias aspell/COPYING aspell/README aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION) TARGET_AUTOCORR=acor/acor_$(LANG)-$(REGION).dat* TARGET_WORDLISTS=wordlists/wordlist.$(CHARSET) $(WORDLIST.CHARSET) all: myspell aspell wordlist acor clean: clean-myspell clean-ispell clean-aspell clean-wordlists clean-acor # Statistics count: wordlists/wordlist.$(CHARSET) $(WORDLIST.IN) @echo "Comments removed" @for f in $^; do \ echo -n "$$f "; \ egrep -v "^#" $$f | sort --unique | wc -l; \ done @echo @echo "Comments and words with whitespace removed" @for f in $^; do \ echo -n "$$f "; \ egrep -v "(^#| )" $$f | sort --unique | wc -l; \ done @echo @echo "Comments removed words with whitespace split" @for f in $^; do \ echo -n "$$f "; \ egrep -v "^#" $$f | tr " " "\n" | sort --unique | wc -l; \ done # Checks check: wordlists/wordlist.$(CHARSET) @echo First line is existing TRY sequence. Second line is new TRY sequence. @egrep "^TRY" myspell/$(LANG)_$(REGION).aff | sed "s/TRY //g" @LC_ALL=en_US.utf8 LANG=en_US.utf8 LANGUAGE=en_US.utf8 ../../src/wordlist/letter-frequency.py -i $^ -len_US # General WORDLIST.CHARSET=$(patsubst %.in, %.$(CHARSET), $(WORDLIST.IN)) %.$(CHARSET): %.in iconv -f utf-8 -t $(CHARSET) < $< >$@ wordlists/wordlist.$(CHARSET): $(WORDLIST.CHARSET) cat $^ | egrep -v "^#|^$$" | sort --unique > $@ wordlists/wordlist-$(LANG)-$(VERSION).zip: $(WORDLIST.IN) wordlists/wordlist.$(CHARSET) zip -j $@ $^ wordlist: wordlists/wordlist-$(LANG)-$(VERSION).zip clean-wordlists: rm -rf $(TARGET_WORDLISTS) # MySpell rules clean-myspell: rm -f $(TARGETS_MYSPELL) # make myspell will make the required zip files myspell: myspell/myspell-$(LANG)_$(REGION)-$(VERSION).zip myspell/myspell-pack-$(LANG)-$(REGION)-$(VERSION).zip myspell/spell-$(LANG)-$(REGION)-$(VERSION).xpi # this is a package that is usable for offline installation myspell/myspell-pack-$(LANG)-$(REGION)-$(VERSION).zip: myspell/myspell-$(LANG)_$(REGION)-$(VERSION).zip myspell/spell.txt zip -j $@ $^ # we autogenerate the index file... myspell/spell.txt: echo '$(LANG_FAKE),$(REGION_FAKE),$(LANG_FAKE)_$(REGION_FAKE),$(LANGNAME) ($(REGIONNAME)),myspell-$(LANG)_$(REGION)-$(VERSION).zip' >$@ # this is the standard myspell package myspell/myspell-$(LANG)_$(REGION)-$(VERSION).zip: myspell/$(LANG)_$(REGION).dic myspell/$(LANG)_$(REGION).aff myspell/README_$(LANG)_$(REGION).txt myspell/VERSION_$(LANG)_$(REGION).txt zip -j $@ $^ # make sure the VERSION file name doesn't conflict with other packages myspell/VERSION_$(LANG)_$(REGION).txt: VERSION cp -p $^ $@ # myspell/ispell don't like the header, or words with spaces in them myspell/wordlist.$(CHARSET): wordlists/wordlist.$(CHARSET) egrep -v '(^#| )' <$< >$@ # this does the work of converting a wordlist into a myspell dictionary # it can take a while # the munch utility is located under the dict/utils project myspell/$(LANG)_$(REGION).dic: myspell/wordlist.$(CHARSET) myspell/$(LANG)_$(REGION).aff ../utils/munch ../utils/munch myspell/wordlist.$(CHARSET) myspell/$(LANG)_$(REGION).aff >$@ # The following are for building a Mozilla XPI of the spellchecker # Customise the install.js myspell/install.js: ../utils/install.js.in sed "s/{LANG}/$(LANG)/; s/{REGION}/$(REGION)/; s/{LANGNAME}/$(LANGNAME)/; s/{REGIONNAME}/$(REGIONNAME)/; s/{VERSION}/$(VERSION)/" < $< > $@ myspell/README-$(LANG)-$(REGION).txt: myspell/README_$(LANG)_$(REGION).txt cp $^ $@ myspell/$(LANG)-$(REGION).dic: myspell/$(LANG)_$(REGION).dic cp $^ $@ myspell/$(LANG)-$(REGION).aff: myspell/$(LANG)_$(REGION).aff cp $^ $@ myspell/spell-$(LANG)-$(REGION)-$(VERSION).xpi: myspell/$(LANG)-$(REGION).aff myspell/$(LANG)-$(REGION).dic myspell/README-$(LANG)-$(REGION).txt myspell/install.js zip -j $@ $^ # Ispell Rules clean-ispell: rm -f $(TARGETS_ISPELL) ispell/$(LANGNAMELOW).hash: ispell/wordlist.$(CHARSET) ispell/$(LANGNAMELOW).aff buildhash $^ $@ ispell/$(LANGNAMELOW)-ispell-$(VERSION).tar.bz2: ispell/$(LANGNAMELOW).hash ispell/$(LANGNAMELOW).aff ispell/README tar cvjf $@ $^ ispell: ispell/$(LANGNAMELOW)-ispell-$(VERSION).tar.bz2 ispell/wordlist.$(CHARSET): wordlists/wordlist.$(CHARSET) egrep -v '(^#| )' <$< >$@ # Aspell Rules aspell: aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION).tar.bz2 clean-aspell: rm -rf $(TARGET_ASPELL) aspell/$(LANG).cwl: aspell/wordlist.$(CHARSET) (export LC_COLLATE=C; cat $< | sort -u | word-list-compress compress > $@) aspell/proc: ../utils/proc cp -p $< $@ aspell/configure: ../utils/configure cp -p $< $@ aspell/wordlist.$(CHARSET): wordlists/wordlist.$(CHARSET) cat $< | egrep -v '(^#| |\.|-$$|[0-9]|/|=$$)' | LC_COLLATE=C sort --unique >$@ aspell/aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION).tar.bz2: aspell/$(LANG).cwl aspell/configure aspell/Makefile.pre aspell/Copyright cd aspell; ./configure; make dist && make distcheck && rm -rf aspell-$(LANG)-$(VERSION_ASPELL)-$(VERSION) aspell/info: aspell/info.in ../VERSION.aspell VERSION sed "s/{VERSION}/$(VERSION_ASPELL)\-$(VERSION)/" < $< > $@ aspell/Makefile.pre: aspell/proc aspell/info (cd aspell; export LC_COLLATE=C; ./proc create) # Autocorrect rules # Naming format for OpenOffice.org 2 acor/acor_$(LANG)-$(REGION).dat: acor/DocumentList.csv acor/SentenceExceptList.csv acor/WordExceptList.csv (cd acor; ../../utils/csv2acor.py $(@F)) acor: acor/acor_$(LANG)-$(REGION).dat autocorrect: acor clean-acor: rm -rf $(TARGET_AUTOCORR) dict-ns-20070206.orig/utils/munch.h0000644000175000017500000000461610562150175015362 0ustar dokodoko/* munch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_ROOTS 20 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; /* data structure to store results of lookups */ struct matches { struct hentry * hashent; /* hash table entry */ struct affent * prefix; /* Prefix used, or NULL */ struct affent * suffix; /* Suffix used, or NULL */ }; int numroots; /* number of root words found */ struct matches roots[MAX_ROOTS]; /* list of root words found */ /* hashing stuff */ struct hentry { char * word; char * affstr; struct hentry * next; int keep; }; int tablesize; struct hentry * tableptr; /* unmunch stuff */ int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ void parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int load_tables(FILE * wrdlst); int hash(const char *); int add_word(char *); struct hentry * lookup(const char *); void aff_chk (const char * word, int len); void pfx_chk (const char * word, int len, struct affent* ep, int num); void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag); void add_affix_char(struct hentry * hent, char ac); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/proc0000755000175000017500000027234010562150175014771 0ustar dokodoko#!/usr/bin/perl ################################################################ # # Aspell Word List Package proc script # Copyright 2001,2002,2004 under the GNU Lesser General Public License (LGPL) # use Data::Dumper; use strict; use warnings; no warnings qw(uninitialized); no locale; my $VERSION = "0.50.4"; my $action = 'create'; my $check_mode = 'safe'; foreach my $arg (@ARGV) { $arg =~ s/^-*//; if ($arg eq 'check' || $arg eq 'create') { $action=$arg; } elsif ($arg eq 'unsafe') { $check_mode = 'unsafe'; } } ################################################################ # # helper functions # sub true ( ) {1} sub false ( ) {0} sub error ( $ ) { die \ $_[0] } my ($line_length,$error_count,$multi_errors); sub line_length() {75} sub error_message ($;$) { my $error; my $parms = $_[1]; my $warn = defined $parms->{warn} ? $parms->{warn} : false; $error .= $warn ? "Warning" : "Error"; $error .= " line $parms->{lineno}" if defined $parms->{lineno}; $error .= ": $_[0]\n"; my $line; $_ = $error; my $print_line = sub {print STDERR "$line\n" unless $line =~ /^\s*$/}; while (s/(\s*?)(\S+|\n)//) { my ($a,$b) = ($1,$2); my $len = length($line) + length($a) + length($b); if (($line !~ /^\s*$/ && $len > line_length) || $b eq "\n") { &$print_line; $a = ""; $b = "" if $b eq "\n"; $line = " "; } $line .= $a; $line .= $b; } &$print_line; if (!$warn) { $error_count++; $multi_errors++ if defined $multi_errors; } } sub handle_error (;$) { return unless $@; if (ref $@) { error_message $ {$@}, {lineno=> $_[0]}; $@ = undef; } else { die $@; } } sub memberof ( $ $ ) { foreach (@{$_[1]}) {return true if $_[0] eq $_;} return false; } sub indented_list ( @ ) { return join '', map {" $_\n"} @_; } ################################################################ # # insr initialization # my ($key,$val,$info,$insr,@authors,%dicts,%copying); my $lang = "[a-z]{2}"; my $version; sub lower() {["[a-z]+", "must consist of only lowercase ASCII characters"]} sub upper() {["[A-Z]+", "must consist of only uppercase ASCII characters"]} sub alpha() {["[A-Za-z]+", "must consist of only alpha ASCII characters"]} sub alphanum() {["[A-Za-z0-9-]+", "must consist of only alphanumeric ASCII characters or '-'"]} sub ascii() {["[\x20-\x7E]+", "must consist of only ASCII characters"]} sub any() {[".+","ERROR"]} sub generic() {"is not in the proper format"} sub dict() {return ["$lang(_[A-Z]{2}|)(|-[a-z0-9-]+)(-[0-9]{2}|)", generic]} sub split_dict ( $ ) {my $dict = dict->[0]; my @data = $_[0] =~ /^$dict$/; foreach (@data) {next unless $_; $_ = substr $_, 1} return @data} sub form_dict ( @ ) {my $name = $lang; $name .= "_$_[0]" if $_[0]; $name .= "-$_[1]" if $_[1]; $name .= "-$_[2]" if $_[2]; return $name} sub README(); sub make_alias( $ $ $ ); my $line; my %aliases_from; my %aliases_to; my %global_info; my %global_insr = (default_fill_order => [qw (name_ascii name_native strip_accents)], author => { singular => false, name => {check=>any}, email => {required=>false, check=>[".+ at .+",generic]}, maintainer => {required=>false, oneof=>['true', 'false'], default=>'false'}, pre => sub {}, post => sub { push @authors, $info; } }, copyright => {oneof => ["LGPL", "GPL", "FDL", "LGPL/GPL", # FSF Licenses "Artistic", # Perl Artistic Licence "Copyrighted", # Copyright message must remain "Open Source", # Meets OSI defination "Public Domain", # ie none "Other", "Unknown"] }, version => { check => ['\d[a-z\d\.-]+', generic], code => sub {$version="$val"}, store => true, }, date => {required=>false, check=>['\d\d\d\d-\d\d-\d\d', 'YYYY-MM-DD']}, url => {required=>false}, source_url => {required=>false}, source_version => {required=>false}, name_english => {check=>["[A-Z][a-z]+( [A-Z][a-z]+)*",generic]}, name_ascii => {default => "=name_english"}, name_native => {default => "=name_ascii", check=>any}, lang => {check => ["[a-z]{2,3}", "must consist of two or three lowercase ASCII characters"], code => sub {$lang = $val}, store => true }, readme_file => {required=>false, check=> upper, normal=>"README", generate => sub {README}}, copying_file => {required=>false, check=> upper, normal=>"COPYING", generate => sub {$copying{$info->{copyright}}}}, copyright_file => {required=>false, check=> upper, normal=>"Copyright"}, charset => { oneof => [qw(iso8859-1 iso8859-2 iso8859-3 iso8859-4 iso8859-5 iso8859-6 iso8859-7 iso8859-8 iso8859-9 iso8859-10 iso8859-14 iso8859-15 koi8-f koi8-r koi8-u viscii)] }, special => {required => false}, soundslike => {oneof => ['generic','phonet','none']}, keyboard => {required => false}, run_together => {required => false}, run_together_limit => {required => false}, run_together_min => {required => false}, run_together_mid => {required => false}, strip_accents => {default => 'false', oneof => ['true','false']}, alias => {check => any, code => sub { error "The \"lang\" entry must be defined before any global aliases." unless exists $global_info{lang}; my @d = split /\s+/, $val; foreach (@d[1..$#d]) { my $awli = s/:awli$// ? true : false; error ("The alias $_ already exits in the \"$aliases_to{$_}\" " ."entry.") if exists $aliases_to{$_}; $aliases_to{$_} = $d[0]; $_ = {name => $_, awli => $awli}; } push @{$aliases_from{$d[0]}}, @d[1..$#d]; } }, dict => { default_fill_order => ['awli'], singular => false, name => {check=>\&dict}, awli => {default=>'true', oneof=>['true','false']}, strip_accents => { oneof => ["true", "false"], code => sub {push @{$info->{insr}}, "strip-accents $val";} }, add => { check=>\&dict, code => sub { my ($inf, $v) = @_ ? @_ : ($info, $val); push @{$inf->{insr}}, "add $v"; push @{$inf->{dicts}}, {name => $v, add => \$inf->{insr}->[-1]}; } }, alias => { check=>any, code => sub { error "The name entry must be defined before any aliases or defined" unless exists $info->{name}; my $awli = $val =~ s/:awli$//; &{$insr->{post}}( make_alias $val, $info->{name}, $awli ); } }, pre => sub { my ($inf) = @_ ? @_ : ($info); $inf->{insr} = []; $inf->{dicts} = []; error "The \"lang\" entry must be defined before any dicts." unless exists $global_info{lang}; }, post => sub { my ($inf) = @_ ? @_ : ($info); error "Must provide at least one word list for \"$info->{name}\" dict entry." if (@{$inf->{dicts}} == 0); error "The dict or alias \"$info->{name}\" is already defined." if exists $dicts{$inf->{name}}; $dicts{$inf->{name}} = $inf; return $inf; } } ); sub doc_entries() {qw (readme_file copying_file copyright_file)} ################################################################ # # Add default values to insr # my @defaults = (["singular", true], ["check", ascii], ["required", true]); sub add_defaults ( $ ) { my $v = $_[0]; foreach my $d (@defaults) { $v->{$d->[0]} = $d->[1] unless exists $v->{$d->[0]}; } $v->{required} = false if exists $v->{code} || !$v->{singular}; $v->{store} = true unless exists $v->{store} || exists $v->{code}; $v->{store} = false unless exists $v->{store}; } foreach my $v (values %global_insr) { next unless ref $v eq 'HASH'; add_defaults $v; if (!$v->{singular}) { foreach my $vv (values %$v) { next unless ref $vv eq 'HASH'; add_defaults $vv } } } ################################################################ # # Read in info file # open IN, "info" or die "Unable to open info file\n"; sub handle_key(); sub begin_multi(); sub possibly_end_multi(); sub add_defaults_and_check_mandatory(); my ($key_insr,$multi_val,$multi_line,$multi_message); $info = \%global_info; $insr = \%global_insr; $line = 0; while () { ++$line; chop; s/\#.*$//; s/\s*$//; next if $_ eq ''; eval { my ($lsp,$col); ($lsp, $key, $col, $val) = /^(\s*)([\w-]*)\s*(:?)\s*(.*)$/ or error "Syntax Error."; $key =~ tr/-/_/; if ($col eq ':' && $lsp ne '') { error_message "This line should not be indented. Assuming its not." , {lineno => $line}; $lsp = ''; } if ($lsp eq '') { possibly_end_multi; $key_insr = $insr->{$key} or error "Unknown Key: $key"; error "Expecting value after $key" if $key_insr->{singular} && ($col ne '' || $val eq ''); error "Expecting \":\" after $key" if !$key_insr->{singular} && $col ne ':'; if ($key_insr->{singular}) { handle_key; } else { begin_multi; } } else { error "This line is indented yet I can not find a line of the form " ."\":\" before it" if !defined $multi_val; $key_insr = $insr->{$key} or error "Unknown Key \"$key\"$multi_message."; error "Expecting value after $key$multi_message." if $col ne '' || $val eq ''; handle_key; } }; handle_error $line; } possibly_end_multi; close IN; die "There were $error_count errors with the info file, aborting.\n" if $error_count > 0; sub handle_key() { my $check = $key_insr->{check}; $check = &$check if ref $check eq 'CODE'; error "The value for $key $check->[1]$multi_message." if $val !~ /^$check->[0]$/; error "The value for $key is not one of: ".join(', ',@{$key_insr->{oneof}}) if exists $key_insr->{oneof} && !memberof($val, $key_insr->{oneof}); if ($key_insr->{store}) { error "A value for $key already defined$multi_message." if exists $info->{$key}; $info->{$key} = $val; } if (exists $key_insr->{code}) { &{$key_insr->{code}}; } } sub begin_multi() { $info = {}; $insr = $key_insr; $multi_val = $key; $multi_line = $line; $multi_errors = 0; $multi_message = " for the group \"$multi_val\" which starts at line $multi_line"; &{$insr->{pre}}; } sub possibly_end_multi() { return unless defined $multi_val; if ($multi_errors == 0) { add_defaults_and_check_mandatory; } if ($multi_errors == 0) { eval { &{$insr->{post}}; }; handle_error $multi_line; } $info = \%global_info; $insr = \%global_insr; $multi_val = undef; $multi_line = undef; $multi_errors = undef; $multi_message = ''; } ################################################################ # # Add defaults and check for mandatory fields # add_defaults_and_check_mandatory; sub add_defaults_and_check_mandatory() { my ($key, $val); # add defaults foreach my $key (@{$insr->{default_fill_order}}) { next if exists $info->{$key}; my $def = $insr->{$key}->{default}; if ($def =~ /^\=(.+)$/) { $info->{$key} = $info->{$1}; } else { $info->{$key} = $def; } } # check mandatory fields while (my ($key,$val) = each %$insr) { next unless ref $val eq 'HASH'; next unless $val->{required}; next if exists $info->{$key}; error_message "The required field $key is missing$multi_message."; } } $info = \%global_info; $insr = \%global_insr; error_message "You must provide at least one author." if (@authors == 0); my ($date, %date); if (exists $info->{date}) { $date = $info->{date}; ($date{year}, $date{month}, $date{day}) = $info->{date} =~ /(....)-(..)-(..)/ or die; } else { (undef,undef,undef,$date{day},$date{month},$date{year}) = localtime(time); $date{year} += 1900; $date = sprintf "%04d-%02d-%02d",$date{year},$date{month}+1,$date{day}; } ################################################################ # # Finish processing # my (%word_lists); my (%already_warned); sub make_alias ( $ $ $ ) { my ($from, $to, $awli) = @_; my $inf = {}; my $insr = $global_insr{dict}; &{$insr->{pre}}($inf); $inf->{name} = $from; $inf->{awli} = $awli ? 'true' : 'false'; &{$insr->{add}{code}}($inf, $to); return $inf; } # Traverse performs a depth first circle looking for cycles and information # included twice # Parms # 1st (array reference) The list of all nodes # 2nd (sub ( $ )) A function which returnes all the children of a given node sub traverse ( $ $ ); traverse [keys %aliases_from], sub { my $r = $aliases_from{$_[0]}; return () unless defined $r; return map {$_->{name}} @$r; }; my @toproc = keys %dicts; while (my $key = shift @toproc) { my $val = $dicts{$key}; $val->{ext} = $val->{awli} eq 'true' ? 'multi' : 'alias'; my @d = split_dict $key; next unless @d; $d[0] = $lang . ($d[0] ? '_' : ''). $d[0]; my $get_aliases = sub { my @a; @a = @{$aliases_from{$_[0]}} if exists $aliases_from{$_[0]}; return ({name=>$_[0], awli=>$val->{awli}}, @a); }; foreach my $l0 (&$get_aliases($d[0])) { foreach my $l1 (&$get_aliases($d[1])) { foreach my $l2 (&$get_aliases($d[2])) { my $dict = $l0->{name}; $dict .= '-'.$l1->{name} if $l1->{name}; $dict .= '-'.$l2->{name} if $l2->{name}; next if exists $dicts{$dict}; my $awli = $l0->{awli} && $l1->{awli} && $l2->{awli}; $dicts{$dict} = make_alias $dict, $key, $awli; $dicts{$dict}->{auto} = true; push @toproc, $dict; } } } next unless $val->{awli}; # If the dictionaries have a size associated with it than find # the size closest to the default size and make an awli alias for # that dictionary without the size in its name @d = split_dict $key; my $l = pop @d; my $n = form_dict @d; if ($l) { if (exists $dicts{$n} && ! exists $dicts{$n}{auto}) { if (!$already_warned{$n}) { my $error; $error .= "Since the awli-dict \"$key\" exists "; $error .= "the dict $n should also have a size."; error_message $error; $already_warned{$n} = true; } } else { # create a special alias my $rank = $l - 60; if ($rank <= 0) { $rank = - $rank; $rank <<= 1; $rank += 1; } else { $rank <<= 1; } push @toproc,$n unless exists $dicts{$n}; my $old_rank = $dicts{$n}->{rank}; if (! defined $old_rank || $rank < $old_rank) { my $inf = make_alias $n, $key, true; $inf->{rank} = $rank; $inf->{auto} = true; $dicts{$n} = $inf; } } } } foreach my $key (sort keys %dicts) { # sorting it guarantees that the more general dictionaries are # processed first my $val = $dicts{$key}; if ($val->{awli} eq 'true') { my @d = split_dict $key; pop @d; # ignore the size part as it is already handled above my $l = pop @d; my $n = form_dict @d; while (@d) { $l = pop @d; $n = form_dict @d; next unless $l; next if exists $dicts{$n}{rank}; next if exists $already_warned{$n}; my $error; if (!exists $dicts{$n} || $dicts{$n}{awli} eq 'false') { $error .= "The more specific awli-dict \"$key\" exists yet "; if (!exists $dicts{$n}) { $error .= "\"$n\" does not." } elsif ($dicts{$n}->{awli} eq 'false') { $error .= "the \"$n\" dict has the awli entry set to false." } } error_message $error if defined $error; $already_warned{$n} = true; } } foreach my $n (@{$val->{dicts}}) { if ($n->{name} eq $key && @{$val->{insr}} != 1) { my $error; $error .= "The $key dictionary can not add a word list "; $error .= "of the same name unless it is the only entry."; error_message $error; } else { if ($n->{name} eq $key || !exists $dicts{$n->{name}}) { $n->{type} = 'rws'; push @{$word_lists{$n->{name}}}, $key; } else { $n->{type} = 'multi'; #$n->{link} = $dicts{$n->{name}}; } $ {$n->{add}} .= ".$n->{type}"; } $val->{is_alias} = (@{$val->{insr}} == 1 && $val->{dicts}[0]{type} eq 'multi'); } unshift @{$val->{insr}}, "strip-accents true" if $global_info{strip_accents} eq 'true' && $val->{insr}->[0] !~ /^strip-accents /; } sub find_equivalent_to { my $val = $dicts{$_[0]}; return $val->{equivalent_to} if exists $val->{equivalent_to}; if (@{$val->{insr}} == 1 && $val->{dicts}[0]{type} eq 'multi') { $val->{equivalent_to} = &find_equivalent_to($val->{dicts}[0]{name}); push @{$val->{equivalent_to}}, $_[0]; } else { $val->{equivalent_to} = []; } return $val->{equivalent_to}; } foreach my $key (sort keys %dicts) { &find_equivalent_to($key); } traverse [map {"$_->{name}.$_->{ext}"} values %dicts], sub { my ($id) = @_; my ($name,$type) = $id =~ /^(.+)\.(.+)$/; return () unless $type eq 'multi'; return map {"$_->{name}.$_->{type}"} @{$dicts{$name}->{dicts}}; }; sub try_read ( $ ) { my $res = open IN, "$_[0]"; close IN; error_message ("Unable to read the file $_[0]") unless $res; return $res; } my $word_list_compress_working = system("word-list-compress 2> /dev/null") != -1 ? true : false; error_message("Unable to execute word-list-compress. I will not be able " ."to check the integrity of the *.cwl files.") unless $word_list_compress_working; foreach my $wl (keys %word_lists) { try_read "$wl.cwl" or next; next unless $word_list_compress_working; if ($check_mode ne 'unsafe') { open IN, "word-list-compress d < $wl.cwl|" or die; my $prev = ''; while () { if ($prev gt $_) { error_message ("The file $wl.cwl is not in the proper format. " ."Did you remember to set LC_COLLATE to C before sorting " ."and compressing with \"word-list-compress c\"."); last; } elsif ($prev eq $_) { error_message ("The file $wl.cwl contains duplicates. " ."Sort with \"sort -u\" to remove them."); last; } $prev = $_; } } } if ($info->{soundslike} eq 'phonet') { try_read "${lang}_phonet.dat"; } foreach my $key (doc_entries) { my $file; if (exists $info->{$key}) { $file = $info->{$key}; } elsif (!exists $insr->{$key}->{generate}) { $file = $insr->{$key}->{normal}; } else { next; } try_read $file; } close IN; die "$error_count Error(s), aborting\n" if $error_count != 0; exit 0 if $action eq 'check'; sub traverse ( $ $ ) { my ($nodes, $get_children) = @_; my %processed; my $t; $t = sub { my ($id,$visited) = @_; my %paths = ($id => [$id]); return \%paths if exists $visited->{$id}; #print STDERR " $id\n"; $visited->{$id} = true; if ($processed{$id}) { foreach (@{$processed{$id}->{visited}}) { $visited->{$_} = true; } return $processed{$id}->{paths}; } foreach my $val (&$get_children( $id ) ) { my $child_paths = &$t( $val, $visited ); while (my ($k,$v) = each %$child_paths) { if ($k eq $id) { error_message "Ciculer dependence found: ".join(" -> ", $id, @$v); } elsif (exists $paths{$k}) { error_message ("$v->[-1] is included twice by $id via the following paths:\n" ." ".join(" -> ", $id, @$v)."\n" ." ".join(" -> ", @{$paths{$k}}) ,{warn => true} ); } else { $paths{$k} = [$id, @$v]; } } } $processed{$id} = {visited => [keys %$visited], paths => \%paths}; return \%paths; }; foreach my $k (@$nodes) { #print STDERR "$k:\n"; &$t( $k,{} ); } } ################################################################ # # Create files # my (%files, $make); $files{extra} = ['configure', 'info', 'Makefile.pre']; push @{$files{data}}, "$lang.dat"; push @{$files{data}}, "${lang}_phonet.dat" if $info->{soundslike} eq 'phonet'; $info->{name} = $lang; $info->{soundslike} = $lang if $info->{soundslike} eq 'phonet'; open OUT, ">$lang.dat"; print OUT "# Generated with Aspell Dicts \"proc\" script version $VERSION\n"; foreach my $key (qw(name charset special soundslike keyboard run_together run_together_limit run_together_min run_together_mid)) { next unless exists $info->{$key}; my $akey = $key; $akey =~ tr/_/-/; print OUT "$akey $info->{$key}\n"; } close OUT; foreach my $key (doc_entries) { my $specific = $info->{$key}; my $normal = $insr->{$key}{normal}; if (defined $specific && $specific ne $normal) { system "cp $specific $normal" or die; push @{$files{doc}}, $specific, $normal; } elsif (defined $specific) { push @{$files{doc}}, $normal; } elsif (exists $insr->{$key}{generate}) { my $data = &{$insr->{$key}{generate}}; next unless defined $data; open OUT, ">$normal"; print OUT $data; close OUT; push @{$files{doc}}, $normal; } else { push @{$files{doc}}, $normal; } } foreach my $key (sort keys %dicts) { my $val = $dicts{$key}; open OUT, ">$val->{name}.$val->{ext}\n"; print OUT "# Generated with Aspell Dicts \"proc\" script version $VERSION\n"; foreach (@{$val->{insr}}) { print OUT "$_\n"; } close OUT; push @{$files{multi}}, "$val->{name}.$val->{ext}"; } foreach my $key (sort keys %word_lists) { $make .= "$key.rws: $key.cwl\n\n"; push @{$files{cwl}}, "$key.cwl"; push @{$files{rws}}, "$key.rws"; } $make .= <<"---"; .SUFFIXES: .cwl .rws .cwl.rws: \${WORD_LIST_COMPRESS} d < \$< | \${ASPELL} \${ASPELL_FLAGS} --lang=$lang create master ./\$@ --- open OUT, ">Makefile.pre"; print OUT <<"---"; # Generated with Aspell Dicts "proc" script version $VERSION lang = $lang version = $version --- print OUT "\n"; foreach (sort keys %files) { print OUT "${_}_files = ", join(' ', @{$files{$_}}), "\n"; } print OUT "\n"; print OUT << '---'; distdir=aspell-${lang}-${version} all: ${rws_files} ${data_files} install: all mkdir -p ${DESTDIR}${dictdir}/ cp ${rws_files} ${multi_files} ${DESTDIR}${dictdir}/ cd ${DESTDIR}${dictdir}/ && chmod 644 ${rws_files} ${multi_files} mkdir -p ${DESTDIR}${datadir}/ cp ${data_files} ${DESTDIR}${datadir}/ cd ${DESTDIR}${datadir}/ && chmod 644 ${data_files} clean: rm -f ${rws_files} distclean: clean rm -f Makefile maintainer-clean: distclean rm -f ${multi_files} Makefile.pre uninstall: -cd ${DESTDIR}${dictdir}/ && rm ${rws_files} ${multi_files} ${link_files} -cd ${DESTDIR}${datadir}/ && rm ${data_files} dist: perl proc ./configure @make dist-nogen dist-nogen: -rm -r ${distdir}.tar.bz2 ${distdir} mkdir ${distdir} cp -p ${extra_files} ${cwl_files} ${multi_files} ${doc_files} ${data_files} ${distdir}/ -cp -pr doc/ ${distdir}/ tar cf ${distdir}.tar ${distdir}/ bzip2 -9 ${distdir}.tar rm -r ${distdir}/ distcheck: tar xfj ${distdir}.tar.bz2 cd ${distdir} && ./configure && make rel: mv ${distdir}.tar.bz2 ../rel --- print OUT $make; close OUT; sub README() { my $maintainer_list; my $author_list; foreach (@authors) { my $which = $_->{maintainer} eq 'true' ? \$maintainer_list : \$author_list; $$which .= " $_->{name}"; $$which .= " ($_->{email})" if exists $_->{email}; $$which .= "\n"; } my $author_info; $author_info = "Maintained By:\n$maintainer_list" if $maintainer_list; $author_info = "Original Word List By:\n$author_list" if $author_list; chop $author_info; my $dict_list; foreach my $key (sort keys %dicts) { my $val = $dicts{$key}; next if $val->{is_alias}; $dict_list .= " $key"; if (@{$val->{equivalent_to}}) { $dict_list .= ' ('; my $len = length($key) + 4; my $indent = $len; foreach (sort @{$val->{equivalent_to}}) { if ($len + length($_) > 70 && $len != $indent) { $dict_list .= "\n"; $dict_list .= ' 'x$indent; $len = $indent; } $dict_list .= "$_ "; $len += length($_) + 1; } chop $dict_list; $dict_list .= ')'; } $dict_list .= "\n"; } chop $dict_list; my $extra_info; $extra_info .= "Wordlist URL: $info->{url}\n" if exists $info->{url}; $extra_info .= "Source Verson: $info->{source_version}\n" if exists $info->{source_version}; $extra_info .= "Source URL: $info->{source_url}\n" if exists $info->{source_url}; return <<"---" GNU Aspell $info->{name_english} Word List Package Version $version $date by Kevin Atkinson (kevina\@gnu.org) $author_info Copyright Terms: $info->{copyright} (see the file Copyright for the exact terms) $extra_info This is the Aspell word list for $info->{name_english}. If Aspell is installed and aspell and word-list-compress are all in the path first do a: ./configure Which should output something like: Finding Dictionary file location ... /usr/local/lib/aspell Finding Data file location ... /usr/local/share/aspell if it did not something likely went wrong. After that build the package with: make and then install it with make install If any of the above mentioned programs are not in your path than the variables, ASPELL and/or WORD_LIST_COMPRESS need to be set to the commands (with path) to run the utilities. These variables may be set in the environment before configure is run or specified at the command line using the following syntax ./configure --vars VAR1=VAL1 ... Other useful variables configure recognizes are ASPELL_PARMS, and DESTDIR. To clean up after the build: make clean To uninstall the files: make uninstall After the word lists are installed you can use the main one ($lang) by setting the LANG environmental variable to $lang or running Aspell with --lang=$lang. You may also chose the dictionary directly with the -d or --master option of Aspell. You can chose from any of the following dictionaries: $dict_list Whereas the names in parentheses are alternate names for the dictionary preceding the parentheses. If you have any problem with installing or using the word lists please let me (Kevin Atkinson) know. If you have problems with the actual word lists please contact one of the Word lists authors as I do not maintain the actual Word Lists. Any additional documentation that came with the original word list can be found in the doc/ directory. --- } INIT { %copying = (GPL => <<'---', GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) 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 this service 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 make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. 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. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the 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 a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE 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. 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 convey 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 2 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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision 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, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This 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 Library General Public License instead of this License. --- LGPL => <<'---', GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), 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 distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! --- FDL => <<'---', GNU Free Documentation License Version 1.1, March 2000 Copyright (C) 2000 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. 0. PREAMBLE The purpose of this License is to make a manual, textbook, or other written document "free" in the sense of freedom: to assure everyone the effective freedom to copy and redistribute it, with or without modifying it, either commercially or noncommercially. Secondarily, this License preserves for the author and publisher a way to get credit for their work, while not being considered responsible for modifications made by others. This License is a kind of "copyleft", which means that derivative works of the document must themselves be free in the same sense. It complements the GNU General Public License, which is a copyleft license designed for free software. We have designed this License in order to use it for manuals for free software, because free software needs free documentation: a free program should come with manuals providing the same freedoms that the software does. But this License is not limited to software manuals; it can be used for any textual work, regardless of subject matter or whether it is published as a printed book. We recommend this License principally for works whose purpose is instruction or reference. 1. APPLICABILITY AND DEFINITIONS This License applies to any manual or other work that contains a notice placed by the copyright holder saying it can be distributed under the terms of this License. The "Document", below, refers to any such manual or work. Any member of the public is a licensee, and is addressed as "you". A "Modified Version" of the Document means any work containing the Document or a portion of it, either copied verbatim, or with modifications and/or translated into another language. A "Secondary Section" is a named appendix or a front-matter section of the Document that deals exclusively with the relationship of the publishers or authors of the Document to the Document's overall subject (or to related matters) and contains nothing that could fall directly within that overall subject. (For example, if the Document is in part a textbook of mathematics, a Secondary Section may not explain any mathematics.) The relationship could be a matter of historical connection with the subject or with related matters, or of legal, commercial, philosophical, ethical or political position regarding them. The "Invariant Sections" are certain Secondary Sections whose titles are designated, as being those of Invariant Sections, in the notice that says that the Document is released under this License. The "Cover Texts" are certain short passages of text that are listed, as Front-Cover Texts or Back-Cover Texts, in the notice that says that the Document is released under this License. A "Transparent" copy of the Document means a machine-readable copy, represented in a format whose specification is available to the general public, whose contents can be viewed and edited directly and straightforwardly with generic text editors or (for images composed of pixels) generic paint programs or (for drawings) some widely available drawing editor, and that is suitable for input to text formatters or for automatic translation to a variety of formats suitable for input to text formatters. A copy made in an otherwise Transparent file format whose markup has been designed to thwart or discourage subsequent modification by readers is not Transparent. A copy that is not "Transparent" is called "Opaque". Examples of suitable formats for Transparent copies include plain ASCII without markup, Texinfo input format, LaTeX input format, SGML or XML using a publicly available DTD, and standard-conforming simple HTML designed for human modification. Opaque formats include PostScript, PDF, proprietary formats that can be read and edited only by proprietary word processors, SGML or XML for which the DTD and/or processing tools are not generally available, and the machine-generated HTML produced by some word processors for output purposes only. The "Title Page" means, for a printed book, the title page itself, plus such following pages as are needed to hold, legibly, the material this License requires to appear in the title page. For works in formats which do not have any title page as such, "Title Page" means the text near the most prominent appearance of the work's title, preceding the beginning of the body of the text. 2. VERBATIM COPYING You may copy and distribute the Document in any medium, either commercially or noncommercially, provided that this License, the copyright notices, and the license notice saying this License applies to the Document are reproduced in all copies, and that you add no other conditions whatsoever to those of this License. You may not use technical measures to obstruct or control the reading or further copying of the copies you make or distribute. However, you may accept compensation in exchange for copies. If you distribute a large enough number of copies you must also follow the conditions in section 3. You may also lend copies, under the same conditions stated above, and you may publicly display copies. 3. COPYING IN QUANTITY If you publish printed copies of the Document numbering more than 100, and the Document's license notice requires Cover Texts, you must enclose the copies in covers that carry, clearly and legibly, all these Cover Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on the back cover. Both covers must also clearly and legibly identify you as the publisher of these copies. The front cover must present the full title with all words of the title equally prominent and visible. You may add other material on the covers in addition. Copying with changes limited to the covers, as long as they preserve the title of the Document and satisfy these conditions, can be treated as verbatim copying in other respects. If the required texts for either cover are too voluminous to fit legibly, you should put the first ones listed (as many as fit reasonably) on the actual cover, and continue the rest onto adjacent pages. If you publish or distribute Opaque copies of the Document numbering more than 100, you must either include a machine-readable Transparent copy along with each Opaque copy, or state in or with each Opaque copy a publicly-accessible computer-network location containing a complete Transparent copy of the Document, free of added material, which the general network-using public has access to download anonymously at no charge using public-standard network protocols. If you use the latter option, you must take reasonably prudent steps, when you begin distribution of Opaque copies in quantity, to ensure that this Transparent copy will remain thus accessible at the stated location until at least one year after the last time you distribute an Opaque copy (directly or through your agents or retailers) of that edition to the public. It is requested, but not required, that you contact the authors of the Document well before redistributing any large number of copies, to give them a chance to provide you with an updated version of the Document. 4. MODIFICATIONS You may copy and distribute a Modified Version of the Document under the conditions of sections 2 and 3 above, provided that you release the Modified Version under precisely this License, with the Modified Version filling the role of the Document, thus licensing distribution and modification of the Modified Version to whoever possesses a copy of it. In addition, you must do these things in the Modified Version: A. Use in the Title Page (and on the covers, if any) a title distinct from that of the Document, and from those of previous versions (which should, if there were any, be listed in the History section of the Document). You may use the same title as a previous version if the original publisher of that version gives permission. B. List on the Title Page, as authors, one or more persons or entities responsible for authorship of the modifications in the Modified Version, together with at least five of the principal authors of the Document (all of its principal authors, if it has less than five). C. State on the Title page the name of the publisher of the Modified Version, as the publisher. D. Preserve all the copyright notices of the Document. E. Add an appropriate copyright notice for your modifications adjacent to the other copyright notices. F. Include, immediately after the copyright notices, a license notice giving the public permission to use the Modified Version under the terms of this License, in the form shown in the Addendum below. G. Preserve in that license notice the full lists of Invariant Sections and required Cover Texts given in the Document's license notice. H. Include an unaltered copy of this License. I. Preserve the section entitled "History", and its title, and add to it an item stating at least the title, year, new authors, and publisher of the Modified Version as given on the Title Page. If there is no section entitled "History" in the Document, create one stating the title, year, authors, and publisher of the Document as given on its Title Page, then add an item describing the Modified Version as stated in the previous sentence. J. Preserve the network location, if any, given in the Document for public access to a Transparent copy of the Document, and likewise the network locations given in the Document for previous versions it was based on. These may be placed in the "History" section. You may omit a network location for a work that was published at least four years before the Document itself, or if the original publisher of the version it refers to gives permission. K. In any section entitled "Acknowledgements" or "Dedications", preserve the section's title, and preserve in the section all the substance and tone of each of the contributor acknowledgements and/or dedications given therein. L. Preserve all the Invariant Sections of the Document, unaltered in their text and in their titles. Section numbers or the equivalent are not considered part of the section titles. M. Delete any section entitled "Endorsements". Such a section may not be included in the Modified Version. N. Do not retitle any existing section as "Endorsements" or to conflict in title with any Invariant Section. If the Modified Version includes new front-matter sections or appendices that qualify as Secondary Sections and contain no material copied from the Document, you may at your option designate some or all of these sections as invariant. To do this, add their titles to the list of Invariant Sections in the Modified Version's license notice. These titles must be distinct from any other section titles. You may add a section entitled "Endorsements", provided it contains nothing but endorsements of your Modified Version by various parties--for example, statements of peer review or that the text has been approved by an organization as the authoritative definition of a standard. You may add a passage of up to five words as a Front-Cover Text, and a passage of up to 25 words as a Back-Cover Text, to the end of the list of Cover Texts in the Modified Version. Only one passage of Front-Cover Text and one of Back-Cover Text may be added by (or through arrangements made by) any one entity. If the Document already includes a cover text for the same cover, previously added by you or by arrangement made by the same entity you are acting on behalf of, you may not add another; but you may replace the old one, on explicit permission from the previous publisher that added the old one. The author(s) and publisher(s) of the Document do not by this License give permission to use their names for publicity for or to assert or imply endorsement of any Modified Version. 5. COMBINING DOCUMENTS You may combine the Document with other documents released under this License, under the terms defined in section 4 above for modified versions, provided that you include in the combination all of the Invariant Sections of all of the original documents, unmodified, and list them all as Invariant Sections of your combined work in its license notice. The combined work need only contain one copy of this License, and multiple identical Invariant Sections may be replaced with a single copy. If there are multiple Invariant Sections with the same name but different contents, make the title of each such section unique by adding at the end of it, in parentheses, the name of the original author or publisher of that section if known, or else a unique number. Make the same adjustment to the section titles in the list of Invariant Sections in the license notice of the combined work. In the combination, you must combine any sections entitled "History" in the various original documents, forming one section entitled "History"; likewise combine any sections entitled "Acknowledgements", and any sections entitled "Dedications". You must delete all sections entitled "Endorsements." 6. COLLECTIONS OF DOCUMENTS You may make a collection consisting of the Document and other documents released under this License, and replace the individual copies of this License in the various documents with a single copy that is included in the collection, provided that you follow the rules of this License for verbatim copying of each of the documents in all other respects. You may extract a single document from such a collection, and distribute it individually under this License, provided you insert a copy of this License into the extracted document, and follow this License in all other respects regarding verbatim copying of that document. 7. AGGREGATION WITH INDEPENDENT WORKS A compilation of the Document or its derivatives with other separate and independent documents or works, in or on a volume of a storage or distribution medium, does not as a whole count as a Modified Version of the Document, provided no compilation copyright is claimed for the compilation. Such a compilation is called an "aggregate", and this License does not apply to the other self-contained works thus compiled with the Document, on account of their being thus compiled, if they are not themselves derivative works of the Document. If the Cover Text requirement of section 3 is applicable to these copies of the Document, then if the Document is less than one quarter of the entire aggregate, the Document's Cover Texts may be placed on covers that surround only the Document within the aggregate. Otherwise they must appear on covers around the whole aggregate. 8. TRANSLATION Translation is considered a kind of modification, so you may distribute translations of the Document under the terms of section 4. Replacing Invariant Sections with translations requires special permission from their copyright holders, but you may include translations of some or all Invariant Sections in addition to the original versions of these Invariant Sections. You may include a translation of this License provided that you also include the original English version of this License. In case of a disagreement between the translation and the original English version of this License, the original English version will prevail. 9. TERMINATION You may not copy, modify, sublicense, or distribute the Document except as expressly provided for under this License. Any other attempt to copy, modify, sublicense or distribute the Document is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 10. FUTURE REVISIONS OF THIS LICENSE The Free Software Foundation may publish new, revised versions of the GNU Free Documentation 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. See http://www.gnu.org/copyleft/. Each version of the License is given a distinguishing version number. If the Document specifies that a particular numbered version of this License "or any later version" applies to it, you have the option of following the terms and conditions either of that specified version or of any later version that has been published (not as a draft) by the Free Software Foundation. If the Document does not specify a version number of this License, you may choose any version ever published (not as a draft) by the Free Software Foundation. ADDENDUM: How to use this License for your documents To use this License in a document you have written, include a copy of the License in the document and put the following copyright and license notices just after the title page: Copyright (c) YEAR YOUR NAME. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with the Invariant Sections being LIST THEIR TITLES, with the Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. A copy of the license is included in the section entitled "GNU Free Documentation License". If you have no Invariant Sections, write "with no Invariant Sections" instead of saying which ones are invariant. If you have no Front-Cover Texts, write "no Front-Cover Texts" instead of "Front-Cover Texts being LIST"; likewise for Back-Cover Texts. If your document contains nontrivial examples of program code, we recommend releasing these examples in parallel under your choice of free software license, such as the GNU General Public License, to permit their use in free software. --- Artistic => <<'---', The Clarified Artistic License Preamble The intent of this document is to state the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package, while giving the users of the package the right to use and distribute the Package in a more-or-less customary fashion, plus the right to make reasonable modifications. Definitions: "Package" refers to the collection of files distributed by the Copyright Holder, and derivatives of that collection of files created through textual modification. "Standard Version" refers to such a Package if it has not been modified, or has been modified in accordance with the wishes of the Copyright Holder as specified below. "Copyright Holder" is whoever is named in the copyright or copyrights for the package. "You" is you, if you're thinking about copying or distributing this Package. "Distribution fee" is a fee you charge for providing a copy of this Package to another party. "Freely Available" means that no fee is charged for the right to use the item, though there may be fees involved in handling the item. It also means that recipients of the item may redistribute it under the same conditions they received it. 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain, or those made Freely Available, or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major network archive site allowing unrestricted access to them, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. e) permit and encourge anyone who receives a copy of the modified Package permission to make your modifications Freely Available in some specific way. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) give non-standard executables non-standard names, and clearly document the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. e) offer the machine-readable source of the Package, with your modifications, by mail order. 5. You may charge a distribution fee for any distribution of this Package. If you offer support for this Package, you may charge any fee you choose for that support. You may not charge a license fee for the right to use this Package itself. You may distribute this Package in aggregate with other (possibly commercial and possibly nonfree) programs as part of a larger (possibly commercial and possibly nonfree) software distribution, and charge license fees for other parts of that software distribution, provided that you do not advertise this Package as a product of your own. If the Package includes an interpreter, You may embed this Package's interpreter within an executable of yours (by linking); this shall be construed as a mere form of aggregation, provided that the complete Standard Version of the interpreter is so embedded. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whoever generated them, and may be sold commercially, and may be aggregated with this Package. If such scripts or library files are aggregated with this Package via the so-called "undump" or "unexec" methods of producing a binary executable image, then distribution of such an image shall neither be construed as a distribution of this Package nor shall it fall under the restrictions of Paragraphs 3 and 4, provided that you do not represent such an executable image as a Standard Version of this Package. 7. C subroutines (or comparably compiled subroutines in other languages) supplied by you and linked into this Package in order to emulate subroutines and variables of the language defined by this Package shall not be considered part of this Package, but are the equivalent of input as in Paragraph 6, provided these subroutines do not change the language in any way that would cause it to fail the regression tests for the language. 8. Aggregation of the Standard Version of the Package with a commercial distribution is always permitted provided that the use of this Package is embedded; that is, when no overt attempt is made to make this Package's interfaces visible to the end user of the commercial distribution. Such use shall not be construed as a distribution of this Package. 9. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 10. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End --- ); } dict-ns-20070206.orig/utils/unmunch.h0000644000175000017500000000267610562150175015731 0ustar dokodoko/* unmunch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ void parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/hunmunch.c0000644000175000017500000005127510562150175016073 0ustar dokodoko/* Munch a word list and generate a smaller root word list with affixes*/ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "hunmunch.h" int main(int argc, char** argv) { int i, j, k, n; int rl, p , nwl; int al; FILE * wrdlst; FILE * afflst; char *nword, *wf, *af; char as[(MAX_PREFIXES + MAX_SUFFIXES)]; char * ap; struct hentry * ep; struct hentry * ep1; struct affent * pfxp; struct affent * sfxp; /* first parse the command line options */ /* arg1 - wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"munch word_list_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; if (parse_aff_file(afflst)) { fprintf(stderr,"Error - in affix file loading\n"); exit(1); } fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } if (load_tables(wrdlst)) { fprintf(stderr,"Error building hash tables\n"); exit(1); } fclose(wrdlst); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { numroots = 0; aff_chk(ep->word,strlen(ep->word)); if (numroots) { /* now there might be a number of combinations */ /* of prefixes and suffixes that might match this */ /* word. So how to choose? As a first shot look */ /* for the shortest remaining root word to */ /* to maximize the combinatorial power */ /* but be careful, do not REQUIRE a specific combination */ /* of a prefix and a suffix to generate the word since */ /* that violates the rule that the root word with just */ /* the prefix or just the suffix must also exist in the */ /* wordlist as well */ /* in fact because of the cross product issue, this not a */ /* simple choice since some combinations of previous */ /* prefixes and new suffixes may not be valid. */ /* The only way to know is to simply try them all */ rl = 1000; p = -1; for (j = 0; j < numroots; j++){ /* first collect the root word info and build up */ /* the potential new affix string */ nword = (roots[j].hashent)->word; nwl = strlen(nword); *as = '\0'; al = 0; ap = as; if (roots[j].prefix) *ap++ = (roots[j].prefix)->achar; if (roots[j].suffix) *ap++ = (roots[j].suffix)->achar; if ((roots[j].hashent)->affstr) { strcpy(ap,(roots[j].hashent)->affstr); } else { *ap = '\0'; } al =strlen(as); /* now expand the potential affix string to generate */ /* all legal words and make sure they all exist in the */ /* word list */ numwords = 0; wlist[numwords].word = mystrdup(nword); wlist[numwords].pallow = 0; numwords++; n = 0; if (al) expand_rootword(nword,nwl,as,al); for (k=0; kkeep = 1; if (pfxp != NULL) add_affix_char(ep1,pfxp->achar); if (sfxp != NULL) add_affix_char(ep1,sfxp->achar); } else { ep->keep = 1; } } else { ep->keep = 1; } } } /* now output only the words to keep along with affixes info */ /* first count how many words that is */ k = 0; for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) k++; } } fprintf(stdout,"%d\n",k); for (i=0; i< tablesize; i++) { ep = &tableptr[i]; if (ep->word == NULL) continue; for ( ; ep != NULL; ep = ep->next) { if (ep->keep > 0) { if (ep->affstr != NULL) { fprintf(stdout,"%s/%s\n",ep->word,ep->affstr); } else { fprintf(stdout,"%s\n",ep->word); } } } } return 0; } int parse_aff_file(FILE * afflst) { int i, j; int numents = 0; char achar = '\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; i = 0; ff = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { if (!fgets(line,MAX_LN_LEN,afflst)) return 1; mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d\n",numpfx,ptable[numpfx].num); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d\n",numsfx,stable[numsfx].num); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); return 0; } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* search for a prefix */ void pfx_chk (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strncmp(aent->appnd, word, aent->appndl) == 0) && tlen + aent->stripl >= aent->numconds) { if (aent->stripl) strcpy (tword, aent->strip); strcpy((tword + aent->stripl), (word + aent->appndl)); /* now go through the conds and make sure they all match */ cp = (unsigned char *) tword; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { tlen += aent->stripl; if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = aent; roots[numroots].suffix = NULL; numroots++; } } } } } } void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag) { struct affent * aent; int tlen; int cond; struct hentry * hent; unsigned char * cp; int i; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { if ((cpflag & XPRODUCT) != 0 && (aent->xpflg & XPRODUCT) == 0) continue; tlen = len - aent->appndl; if (tlen > 0 && (aent->appndl == 0 || strcmp(aent->appnd, (word + tlen)) == 0) && tlen + aent->stripl >= aent->numconds) { strcpy (tword, word); cp = (unsigned char *) (tword + tlen); if (aent->stripl) { strcpy ((char *)cp, aent->strip); tlen += aent->stripl; cp = (unsigned char *)(tword + tlen); } else *cp = '\0'; for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { if ((hent = lookup(tword)) != NULL) { if (numroots < MAX_ROOTS) { roots[numroots].hashent = hent; roots[numroots].prefix = pfxent; roots[numroots].suffix = aent; numroots++; } } } } } } void aff_chk (const char * word, int len) { int i; int j; int nh=0; char * nword; int nwl; if (len < 4) return; for (i=0; i < numpfx; i++) { pfx_chk(word, len, ptable[i].aep, ptable[i].num); } nh = numroots; if (nh > 0) { for (j=0;jxpflg & XPRODUCT) { nword = mystrdup((roots[j].hashent)->word); nwl = strlen(nword); for (i=0; i < numsfx; i++) { suf_chk(nword,nwl,stable[i].aep, stable[i].num, roots[j].prefix, XPRODUCT); } free(nword); } } } for (i=0; i < numsfx; i++) { suf_chk(word, len, stable[i].aep, stable[i].num, NULL, 0); } } /* lookup a root word in the hashtable */ struct hentry * lookup(const char *word) { struct hentry * dp; dp = &tableptr[hash(word)]; if (dp->word == NULL) return NULL; for ( ; dp != NULL; dp = dp->next) { if (strcmp(word,dp->word) == 0) return dp; } return NULL; } /* add a word to the hash table */ int add_word(char * word) { int i; struct hentry * dp; struct hentry * hp = (struct hentry *) malloc (sizeof(struct hentry)); hp->word = word; hp->affstr = NULL; hp->keep = 0; hp->next = NULL; i = hash(word); dp = &tableptr[i]; if (dp->word == NULL) { *dp = *hp; free(hp); } else { while (dp->next != NULL) dp=dp->next; dp->next = hp; } return 0; } /* load a word list and build a hash table on the fly */ int load_tables(FILE * wdlst) { char * ap; char ts[MAX_LN_LEN]; /* first read the first line of file to get hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wdlst)) return 2; mychomp(ts); tablesize = atoi(ts); tablesize = tablesize + 5; if ((tablesize %2) == 0) tablesize++; /* allocate the hash table */ tableptr = (struct hentry *) calloc(tablesize, sizeof(struct hentry)); if (! tableptr) return 3; /* loop thorugh all words on much list and add to hash * table and store away word and affix strings in tmpfile */ while (fgets(ts,MAX_LN_LEN-1,wdlst)) { mychomp(ts); ap = mystrdup(ts); add_word(ap); } return 0; } /* the hash function is a simple load and rotate * algorithm borrowed */ int hash(const char * word) { int i; long hv = 0; for (i=0; i < 4 && *word != 0; i++) hv = (hv << 8) | (*word++); while (*word != 0) { ROTATE(hv,ROTATE_LEN); hv ^= (*word++); } return (unsigned long) hv % tablesize; } void add_affix_char(struct hentry * ep, char ac) { int al; int i; char * tmp; if (ep->affstr == NULL) { ep->affstr = (char *) malloc(2*sizeof(char)); *(ep->affstr) = ac; *((ep->affstr)+1) = '\0'; return; } al = strlen(ep->affstr); for (i=0; i< al; i++) if (ac == (ep->affstr)[i]) return; tmp = calloc((al+2),sizeof(char)); memcpy(tmp,ep->affstr,(al+1)); *(tmp+al) = ac; *(tmp+al+1)='\0'; free(ep->affstr); ep->affstr = tmp; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds)) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if (k > 0) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/hununmunch.c0000644000175000017500000003074110562150175016431 0ustar dokodoko/* Un-munch a root word list with affix tags * to recreate the original word list */ #include #include #include #include #include #include #include #include #ifdef __linux__ #include #include #endif #include #include "hununmunch.h" int main(int argc, char** argv) { int i; int al, wl; FILE * wrdlst; FILE * afflst; char *wf, *af; char * ap; char ts[MAX_LN_LEN]; /* first parse the command line options */ /* arg1 - munched wordlist, arg2 - affix file */ if (argv[1]) { wf = mystrdup(argv[1]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } if (argv[2]) { af = mystrdup(argv[2]); } else { fprintf(stderr,"correct syntax is:\n"); fprintf(stderr,"unmunch dic_file affix_file\n"); exit(1); } /* open the affix file */ afflst = fopen(af,"r"); if (!afflst) { fprintf(stderr,"Error - could not open affix description file\n"); exit(1); } /* step one is to parse the affix file building up the internal affix data structures */ numpfx = 0; numsfx = 0; if (parse_aff_file(afflst)) { fprintf(stderr,"Error - in affix file loading\n"); exit(1); } fclose(afflst); fprintf(stderr,"parsed in %d prefixes and %d suffixes\n",numpfx,numsfx); /* affix file is now parsed so create hash table of wordlist on the fly */ /* open the wordlist */ wrdlst = fopen(wf,"r"); if (!wrdlst) { fprintf(stderr,"Error - could not open word list file\n"); exit(1); } /* skip over the hash table size */ if (! fgets(ts, MAX_LN_LEN-1,wrdlst)) return 2; mychomp(ts); while (fgets(ts,MAX_LN_LEN-1,wrdlst)) { mychomp(ts); /* split each line into word and affix char strings */ ap = strchr(ts,'/'); if (ap) { *ap = '\0'; ap++; al = strlen(ap); } else { al = 0; ap = NULL; } wl = strlen(ts); numwords = 0; wlist[numwords].word = mystrdup(ts); wlist[numwords].pallow = 0; numwords++; if (al) expand_rootword(ts,wl,ap,al); for (i=0; i < numwords; i++) { fprintf(stdout,"%s\n",wlist[i].word); free(wlist[i].word); wlist[i].word = NULL; wlist[i].pallow = 0; } } fclose(wrdlst); return 0; } int parse_aff_file(FILE * afflst) { int i, j; int numents=0; char achar='\0'; short ff=0; char ft; struct affent * ptr= NULL; struct affent * nptr= NULL; char * line = malloc(MAX_LN_LEN); while (fgets(line,MAX_LN_LEN,afflst)) { mychomp(line); ft = ' '; fprintf(stderr,"parsing line: %s\n",line); if (strncmp(line,"PFX",3) == 0) ft = 'P'; if (strncmp(line,"SFX",3) == 0) ft = 'S'; if (ft != ' ') { char * tp = line; char * piece; ff = 0; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: break; case 1: { achar = *piece; break; } case 2: { if (*piece == 'Y') ff = XPRODUCT; break; } case 3: { numents = atoi(piece); ptr = malloc(numents * sizeof(struct affent)); ptr->achar = achar; ptr->xpflg = ff; fprintf(stderr,"parsing %c entries %d\n",achar,numents); break; } default: break; } i++; } free(piece); } /* now parse all of the sub entries*/ nptr = ptr; for (j=0; j < numents; j++) { if (!fgets(line,MAX_LN_LEN,afflst)) return 1; mychomp(line); tp = line; i = 0; while ((piece=mystrsep(&tp,' '))) { if (*piece != '\0') { switch(i) { case 0: { if (nptr != ptr) { nptr->achar = ptr->achar; nptr->xpflg = ptr->xpflg; } break; } case 1: break; case 2: { nptr->strip = mystrdup(piece); nptr->stripl = strlen(nptr->strip); if (strcmp(nptr->strip,"0") == 0) { free(nptr->strip); nptr->strip=mystrdup(""); nptr->stripl = 0; } break; } case 3: { nptr->appnd = mystrdup(piece); nptr->appndl = strlen(nptr->appnd); if (strcmp(nptr->appnd,"0") == 0) { free(nptr->appnd); nptr->appnd=mystrdup(""); nptr->appndl = 0; } break; } case 4: { encodeit(nptr,piece);} fprintf(stderr, " affix: %s %d, strip: %s %d\n",nptr->appnd, nptr->appndl,nptr->strip,nptr->stripl); default: break; } i++; } free(piece); } nptr++; } if (ft == 'P') { ptable[numpfx].aep = ptr; ptable[numpfx].num = numents; fprintf(stderr,"ptable %d num is %d flag %c\n",numpfx,ptable[numpfx].num,ptr->achar); numpfx++; } else { stable[numsfx].aep = ptr; stable[numsfx].num = numents; fprintf(stderr,"stable %d num is %d flag %c\n",numsfx,stable[numsfx].num,ptr->achar); numsfx++; } ptr = NULL; nptr = NULL; numents = 0; achar='\0'; } } free(line); return 0; } void encodeit(struct affent * ptr, char * cs) { int nc; int neg; int grp; unsigned char c; int n; int ec; int nm; int i, j, k; unsigned char mbr[MAX_WD_LEN]; /* now clear the conditions array */ for (i=0;iconds[i] = (unsigned char) 0; /* now parse the string to create the conds array */ nc = strlen(cs); neg = 0; /* complement indicator */ grp = 0; /* group indicator */ n = 0; /* number of conditions */ ec = 0; /* end condition indicator */ nm = 0; /* number of member in group */ i = 0; if (strcmp(cs,".")==0) { ptr->numconds = 0; return; } while (i < nc) { c = *((unsigned char *)(cs + i)); if (c == '[') { grp = 1; c = 0; } if ((grp == 1) && (c == '^')) { neg = 1; c = 0; } if (c == ']') { ec = 1; c = 0; } if ((grp == 1) && (c != 0)) { *(mbr + nm) = c; nm++; c = 0; } if (c != 0) { ec = 1; } if (ec) { if (grp == 1) { if (neg == 0) { for (j=0;jconds[k] = ptr->conds[k] | (1 << n); } } else { for (j=0;jconds[j] = ptr->conds[j] | (1 << n); for (j=0;jconds[k] = ptr->conds[k] & ~(1 << n); } } neg = 0; grp = 0; nm = 0; } else { /* not a group so just set the proper bit for this char */ /* but first handle special case of . inside condition */ if (c == '.') { /* wild card character so set them all */ for (j=0;jconds[j] = ptr->conds[j] | (1 << n); } else { ptr->conds[(unsigned int) c] = ptr->conds[(unsigned int)c] | (1 << n); } } n++; ec = 0; } i++; } ptr->numconds = n; return; } /* add a prefix to word */ void pfx_add (const char * word, int len, struct affent* ep, int num) { struct affent * aent; int cond; int tlen; unsigned char * cp; int i; char * pp; char tword[MAX_WD_LEN]; for (aent = ep, i = num; i > 0; aent++, i--) { /* now make sure all conditions match */ if ((len > aent->stripl) && (len >= aent->numconds) && ((aent->stripl == 0) || (strncmp(aent->strip, word, aent->stripl) == 0))) { cp = (unsigned char *) word; for (cond = 0; cond < aent->numconds; cond++) { if ((aent->conds[*cp++] & (1 << cond)) == 0) break; } if (cond >= aent->numconds) { /* we have a match so add prefix */ tlen = 0; if (aent->appndl) { strcpy(tword,aent->appnd); tlen += aent->appndl; } pp = tword + tlen; strcpy(pp, (word + aent->stripl)); tlen = tlen + len - aent->stripl; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = 0; numwords++; } } } } } /* add a suffix to a word */ void suf_add (const char * word, int len, struct affent * ep, int num) { struct affent * aent; int tlen; int cond; unsigned char * cp; int i; char tword[MAX_WD_LEN]; char * pp; for (aent = ep, i = num; i > 0; aent++, i--) { /* if conditions hold on root word * then strip off strip string and add suffix */ if ((len > aent->stripl) && (len >= aent->numconds) && ((aent->stripl == 0) || (strcmp(aent->strip, word + len - aent->stripl - 1) == 0))) { cp = (unsigned char *) (word + len); for (cond = aent->numconds; --cond >= 0; ) { if ((aent->conds[*--cp] & (1 << cond)) == 0) break; } if (cond < 0) { /* we have a matching condition */ strcpy(tword,word); tlen = len; if (aent->stripl) { tlen -= aent->stripl; } pp = (tword + tlen); if (aent->appndl) { strcpy (pp, aent->appnd); tlen += aent->stripl; } else *pp = '\0'; if (numwords < MAX_WORDS) { wlist[numwords].word = mystrdup(tword); wlist[numwords].pallow = (aent->xpflg & XPRODUCT); numwords++; } } } } } int expand_rootword(const char * ts, int wl, const char * ap, int al) { int i; int j; int nh=0; int nwl; for (i=0; i < numsfx; i++) { if (strchr(ap,(stable[i].aep)->achar)) { suf_add(ts, wl, stable[i].aep, stable[i].num); } } nh = numwords; if (nh > 1) { for (j=1;jachar)) { if ((ptable[i].aep)->xpflg & XPRODUCT) { nwl = strlen(wlist[j].word); pfx_add(wlist[j].word, nwl, ptable[i].aep, ptable[i].num); } } } } } } for (i=0; i < numpfx; i++) { if (strchr(ap,(ptable[i].aep)->achar)) { pfx_add(ts, wl, ptable[i].aep, ptable[i].num); } } return 0; } /* strip strings into token based on single char delimiter * acts like strsep() but only uses a delim char and not * a delim string */ char * mystrsep(char ** stringp, const char delim) { char * rv = NULL; char * mp = *stringp; int n = strlen(mp); if (n > 0) { char * dp = (char *)memchr(mp,(int)((unsigned char)delim),n); if (dp) { int nc; *stringp = dp+1; nc = (int)((unsigned long)dp - (unsigned long)mp); rv = (char *) malloc(nc+1); memcpy(rv,mp,nc); *(rv+nc) = '\0'; return rv; } else { rv = (char *) malloc(n+1); memcpy(rv, mp, n); *(rv+n) = '\0'; *stringp = mp + n; return rv; } } return NULL; } char * mystrdup(const char * s) { char * d = NULL; if (s) { int sl = strlen(s); d = (char *) malloc(((sl+1) * sizeof(char))); if (d) memcpy(d,s,((sl+1)*sizeof(char))); } return d; } void mychomp(char * s) { int k = strlen(s); if ((k > 0) && (*(s+k-1) == '\n')) *(s+k-1) = '\0'; if ((k > 1) && (*(s+k-2) == '\r')) *(s+k-2) = '\0'; } dict-ns-20070206.orig/utils/csv2acor.py0000755000175000017500000000676710562150175016207 0ustar dokodoko#!/usr/bin/env python # -*- coding: UTF-8 -*- # Copyright 2005, Sren Thing Pedersen stp@things.dk, Licensed under LGPL import os, sys, zipfile, zlib, csv SentenceExceptList = 'SentenceExceptList.csv' WordExceptList = 'WordExceptList.csv' DocumentList = 'DocumentList.csv' manifest = """ """ fileheader = """ """ filefooter = '' class calc(csv.Dialect): delimiter = ',' quotechar = '"' doublequote = False quoting = csv.QUOTE_ALL escapechar = '\\' skipinitialspace = True lineterminator = '\r\n' def zip_dir_into_file(dir, file): zfobj = zipfile.ZipFile(file, 'w', zipfile.ZIP_DEFLATED) for root, dirs, files in os.walk(dir): for thisfile in files: # print os.path.join(root,thisfile) zfobj.write(os.path.join(root, thisfile), os.path.join(root, thisfile).replace(dir, "")[1:]) zfobj.close() if len(sys.argv) != 2: print 'Usage: '+sys.argv[0]+' destinationfile' else: destinationfile = sys.argv[1] tempdir = destinationfile+'_tmp' if os.path.exists(SentenceExceptList) and os.path.exists(WordExceptList) and os.path.exists(DocumentList): if not (os.path.exists(tempdir)): os.mkdir(tempdir, 0777) if not (os.path.exists(tempdir+'/Meta-inf/')): os.mkdir(tempdir+'/Meta-inf/', 0777) manifestfile = open(os.path.join(tempdir+'/Meta-inf/', 'manifest.xml'), 'wb') manifestfile.write(manifest) manifestfile.close() mimetypefile = open(os.path.join(tempdir, 'mimetype'), 'wb') mimetypefile.write('') mimetypefile.close() DocumentListfile = open(os.path.join(tempdir, 'DocumentList.xml'), 'wb') DocumentListfile.write(fileheader+"\n") csvreader = csv.reader(file(DocumentList), calc) for row in csvreader: line = ' '+"\n"; DocumentListfile.write(line) DocumentListfile.write(filefooter+"\n") DocumentListfile.close() SentenceExceptListfile = open(os.path.join(tempdir, 'SentenceExceptList.xml'), 'wb') SentenceExceptListfile.write(fileheader+"\n") csvreader = csv.reader(file(SentenceExceptList), calc) for row in csvreader: line = ' '+"\n"; SentenceExceptListfile.write(line) SentenceExceptListfile.write(filefooter+"\n") SentenceExceptListfile.close() WordExceptListfile = open(os.path.join(tempdir, 'WordExceptList.xml'), 'wb') WordExceptListfile.write(fileheader+"\n") csvreader = csv.reader(file(WordExceptList), calc) for row in csvreader: line = ' '+"\n"; WordExceptListfile.write(line) WordExceptListfile.write(filefooter+"\n") WordExceptListfile.close() zip_dir_into_file(tempdir, destinationfile) else: print "SentenceExceptList.csv, WordExceptList.csv or DocumentList.csv missing!" dict-ns-20070206.orig/utils/hunmunch.h0000644000175000017500000000461510562150175016074 0ustar dokodoko/* munch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_ROOTS 20 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; /* data structure to store results of lookups */ struct matches { struct hentry * hashent; /* hash table entry */ struct affent * prefix; /* Prefix used, or NULL */ struct affent * suffix; /* Suffix used, or NULL */ }; int numroots; /* number of root words found */ struct matches roots[MAX_ROOTS]; /* list of root words found */ /* hashing stuff */ struct hentry { char * word; char * affstr; struct hentry * next; int keep; }; int tablesize; struct hentry * tableptr; /* unmunch stuff */ int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ int parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int load_tables(FILE * wrdlst); int hash(const char *); int add_word(char *); struct hentry * lookup(const char *); void aff_chk (const char * word, int len); void pfx_chk (const char * word, int len, struct affent* ep, int num); void suf_chk (const char * word, int len, struct affent * ep, int num, struct affent * pfxent, int cpflag); void add_affix_char(struct hentry * hent, char ac); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/README.aspell0000644000175000017500000000025410562150175016230 0ustar dokodokoAspell needs these files: proc & configure - ftp://ftp.gnu.org/gnu/aspell/dict/0gen/aspell-gen-0.50.4.tar.bz2 Generates the files needed for an aspell dictionary package dict-ns-20070206.orig/utils/Makefile0000644000175000017500000000053410562150175015532 0ustar dokodoko# Makefile for munch and unmunch TARGETS=munch unmunch hunmunch hununmunch all: $(TARGETS) clean: rm -f $(TARGETS) munch: munch.c munch.h gcc -O2 -o $@ munch.c unmunch: unmunch.c unmunch.h gcc -O2 -o $@ unmunch.c hunmunch: hunmunch.c hunmunch.h gcc -O2 -o $@ hunmunch.c hununmunch: hununmunch.c hununmunch.h gcc -O2 -o $@ hununmunch.c dict-ns-20070206.orig/utils/.cvsignore0000644000175000017500000000001610562150175016065 0ustar dokodokomunch unmunch dict-ns-20070206.orig/utils/hununmunch.h0000644000175000017500000000267510562150175016443 0ustar dokodoko/* unmunch header file */ #define MAX_LN_LEN 200 #define MAX_WD_LEN 200 #define MAX_PREFIXES 256 #define MAX_SUFFIXES 256 #define MAX_WORDS 5000 #define ROTATE_LEN 5 #define ROTATE(v,q) \ (v) = ((v) << (q)) | (((v) >> (32 - q)) & ((1 << (q))-1)); #define SET_SIZE 256 #define XPRODUCT (1 << 0) /* the affix table entry */ struct affent { char * appnd; char * strip; short appndl; short stripl; char achar; char xpflg; short numconds; char conds[SET_SIZE]; }; struct affixptr { struct affent * aep; int num; }; /* the prefix and suffix table */ int numpfx; /* Number of prefixes in table */ int numsfx; /* Number of suffixes in table */ /* the prefix table */ struct affixptr ptable[MAX_PREFIXES]; /* the suffix table */ struct affixptr stable[MAX_SUFFIXES]; int numwords; /* number of words found */ struct dwords { char * word; int pallow; }; struct dwords wlist[MAX_WORDS]; /* list words found */ /* the routines */ int parse_aff_file(FILE* afflst); void encodeit(struct affent * ptr, char * cs); int expand_rootword(const char *, int, const char*, int); void pfx_add (const char * word, int len, struct affent* ep, int num); void suf_add (const char * word, int len, struct affent * ep, int num); char * mystrsep(char ** stringp, const char delim); char * mystrdup(const char * s); void mychomp(char * s); dict-ns-20070206.orig/utils/munch0000755000175000017500000004566010562150536015144 0ustar dokodokoELF0494 ("444''0<0((( Qtd/lib/ld-linux.so.2GNU    gSC<$D.!@aD(QKZoz(5t3dhg  __gmon_start__libc.so.6strcpystdoutfgetsmalloccallocfprintfmemchrstrncmpstrcmpfclosestderrfwriteexitfopenatoi_IO_stdin_used__libc_start_mainstrchrfreeGLIBC_2.1GLIBC_2.0ii ii ܰ@D      $(,UU!5%%h%h%h%h%h %h(%h0%h8p% h@`%hHP%hP@%hX0%h` % hh%$hp%(hx%,h1^PTRh`hQVhԆ;US[À*tX[ÐU=Ht 8ҡ8uHÐUtt $ÐL$qUWSQ|Bt0G$E؋Bu[DD$ D$D$$hDD$ D$ D$$|$$G$ED$E܉$8EЃ}t[DD$ D$D$$hDD$ D$ D$$|$DD$ D$.D$$$c^dEЉ$vEЉ$)d^ DD$ T$D$Ц $D$E؉$=Ẽ}u1DD$ D$&D$$$Ẻ$t1DD$ D$D$$$Ẻ$hEaE¡UEE>/hEH‹ET$$hEEE UUEԋEԹHEƅEEUUtUUP EEUUtUUP EEUU@t&UU@D$E$_EHE``Eԉ$݀`ń`@`E}t#EȉD$ D$EĉD$Eԉ$mEJEŀ$tEEŀ$REŀEńE`9E|`9EuE;E} EĉEEEEh9E}UUEUUEUUEE@ }tE@ D$E$}t1E@ D$E$E@  E@ E@E}EV9EEE=E¡UEEtE@ ~EE@E}uEV9E|@ED$D$;$EE¡UEEtogE@ ~TE@t+EPE @T$ D$D$? $E@D$D$F$E@E}uEV9Ed|Y[_]aUWVSEEfEEE$GEE$E DED$D$J$EEE\Eu}M(uEPEEE`Eu}M(uES} BEEEfEEuЉu}t}}t}t"EEuE $ > 4: ; I?  &I%%W2 ../sysdeps/i386/elfstart.S03!4=%" YZ!"\[# init.cT /build/buildd/glibc-2.3.6.ds1/build-tree/i386-libc/csucrti.ST !/!=Z!gg//Z!!!#!/=D3!/!=Z!|T /build/buildd/glibc-2.3.6.ds1/build-tree/i386-libc/csucrtn.S  !\!!!GNU C 4.1.2 20061115 (prerelease) (Debian 4.1.1-21)init.cshort int/build/buildd/glibc-2.3.6.ds1/build-tree/glibc-2.3.6/csulong long intunsigned charlong long unsigned intshort unsigned int_IO_stdin_used.symtab.strtab.shstrtab.interp.note.ABI-tag.hash.dynsym.dynstr.gnu.version.gnu.version_r.rel.dyn.rel.plt.init.text.fini.rodata.eh_frame.ctors.dtors.jcr.dynamic.got.got.plt.data.bss.comment.debug_aranges.debug_pubnames.debug_info.debug_abbrev.debug_line.debug_str#(( 1HH7 P?88Go*To$$0c TTl ll up   {00 DD&``&'0000ܰ00P001 @<1 <12xP3%u365v!6078'?!? F(H8$Tl   0 D `ܰ0@ ! (/:xT H8   ( />|ލ] g   ƛ Xn $b -C?`F$Y b4o`M   w  ``@Ddh0 QZ @$7S Gd O<[Ԇ  `} 0 D U  U(V<  0^5З =3NVUddá tc` |^g0 ;   abi-note.S../sysdeps/i386/elf/start.Sinit.cinitfini.c/build/buildd/glibc-2.3.6.ds1/build-tree/i386-libc/csu/crti.Scall_gmon_startcrtstuff.c__CTOR_LIST____DTOR_LIST____JCR_LIST__completed.5621p.5619__do_global_dtors_auxframe_dummy__CTOR_END____DTOR_END____FRAME_END____JCR_END____do_global_ctors_aux/build/buildd/glibc-2.3.6.ds1/build-tree/i386-libc/csu/crtn.Smunch.c_DYNAMIC__fini_array_end__fini_array_start__init_array_end_GLOBAL_OFFSET_TABLE___init_array_startparse_aff_filestrchr@@GLIBC_2.0pfx_chkadd_wordlookupmystrdupstrcmp@@GLIBC_2.0_fp_hwfprintf@@GLIBC_2.0mystrsep__dso_handle__libc_csu_finihashmemchr@@GLIBC_2.0_initmalloc@@GLIBC_2.0load_tablesstablenumwordsstdout@@GLIBC_2.0stderr@@GLIBC_2.0numsfxnumroots_startfgets@@GLIBC_2.0mychompwliststrncmp@@GLIBC_2.0__libc_csu_initpfx_add__bss_startmain__libc_start_main@@GLIBC_2.0aff_chkdata_start_finifclose@@GLIBC_2.1tableptradd_affix_charrootsexit@@GLIBC_2.0atoi@@GLIBC_2.0calloc@@GLIBC_2.0tablesize_edata__i686.get_pc_thunk.bxfree@@GLIBC_2.0_endsuf_chkfopen@@GLIBC_2.1ptable_IO_stdin_usedexpand_rootwordsuf_addnumpfxfwrite@@GLIBC_2.0__data_start_Jv_RegisterClassesencodeit__gmon_start__strcpy@@GLIBC_2.0dict-ns-20070206.orig/VERSION.aspell0000644000175000017500000000000510562150176015253 0ustar dokodoko0.50