dict-ve-20070206.orig/0000755000175000017500000000000010562171665012731 5ustar dokodokodict-ve-20070206.orig/ve/0000755000175000017500000000000010562173203013331 5ustar dokodokodict-ve-20070206.orig/ve/myspell/0000755000175000017500000000000010562173203015016 5ustar dokodokodict-ve-20070206.orig/ve/myspell/README_ve_ZA.txt0000644000175000017500000007420110562150175017607 0ustar dokodokoMySpell Venda 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 ============ Venda Wordlist -------------- The MySpell Venda dictionary is based on various the wordlist, either in the public domain or released under the LGPL. MySpell Affix File ------------------ Copyright (C) 2006 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 Venda Spellchecker is enabled. Tools -> Options -> Language Settings -> Writing Aids In the section marked 'Available language modules' select 'Edit...'. Under the languages drop-down select Venda 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 Venda 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'. Venda has a tick next to it to indicate that a spellchecker is installed. Set your default language to Venda. 3) Changing existing documents or paragraphs to Venda Some old document might be written in Venda 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 Venda. 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-ss' 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-ve-20070206.orig/ve/myspell/ve_ZA.aff0000644000175000017500000000157310562150175016511 0ustar dokodoko# ve_ZA.aff - Venda (ve) affix file for use in myspell # # Copyright (C) 2006 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 UTF-8 TRY aeoltinghmkswrpbdufyMcSjTBDLNPKRAvCEz-GIHOFWJV'xUYZqXQ dict-ve-20070206.orig/ve/wordlists/0000755000175000017500000000000010562173203015363 5ustar dokodokodict-ve-20070206.orig/ve/wordlists/wordlist.mozilla.in0000644000175000017500000010406610562150176021243 0ustar dokodokou ya ni kha nga na a ho i khou ha yo wa text tshi tsha dza mulaedza sa faela ḽa dtd vha kana bva musi zwi hei dzina itela hafhu nzudzanyo ngo seva zwa dzhenisa ṱhanziela dzi si meiḽi songo hu zwo khoudu vhukhakhi phasiwede milaedza humbelwa siaṱari ṱoḓa ḽi la vhuṱanzi ndi foḽuda ḽo properties bugu ine nahone dzo nangani longela Ḓiresi dzhenisani thanziela rumela no khwinifhadzo wo fhedzi kona mbalelano hone zwino thoma shumisa kundelwa yanu lwa tea arali mulanguli shumisani mafhungo nyito mutevhe saithi zwauri tevhelaho yaṇu tsumbanḓila tsireledzo o ngauri Ḽiṅwalwa tshifhinga murahu wanala tsho mushumisi huna vhu tshigwada ntswa tshivhumbeo vhulungani vhulunga lingedze koni afho thutha fhethu ndeme khulwane maitele thi ngomu foluda wana Ṱhumanyo thaidzo html tshiteṅwa Thuthani phanḓa lulamisani vhukuma ṱola hoyu dzhenise li vhutanzi toda swaswara kone kiḽikani itani fhelelaho web vhuvha ita fhasi siatari re nwalwa webusaithi nangiwaho nanga mbonwasia bvela dzine zwiteṅwa Rumelani nthihi mulayoni meili lingedza wanani tshikhala rumelwa lushaka khetho nnḓa nomboro vula ṱunḓa tshipiḓa sia mashika zwishumiswa thebuḽu sumbedzani muelo bvelela Ḽainini zwavhuḓi vulani vhulungwaho shumiswa shuma saathu hezwi fasiṱere url thero inwi zwitakalelwa tswayo gandisa fiḽitha dzoṱhe disiki diresi Ḽaini zwine Tendelani nange muvhala Ṱolani luswayo lavhelelwaho do Ṅwala iṅwe engedzani emeiḽi Bvisani yone vhulungwa nyengedzedzo nwala ṱhoho heḽi saina nṱha fomo thungo tab RSA mbonalo khouda fhela dzheniswa CRL vhumba tsumbo nnda Mac linwalwa ldap ḓivhazwakale vhukati tshoṱhe inwe hayani dzudzanya dzhena bula vhukwae vhuimo vhala takalela nḓila murumeli maimo lo tsaino sumba makokisi dzivhiswaho zwoṱhe sisiteme ṱoḓea mvelele mulayo longelwa kopa khomphwutha ḽine humbula fureme dziṅwe didzhithala bulwaho vhupo shandukisani phirinthara mbekanyamushumo khwathisedza khii dzhenisiwa CA bvelelaho zwiga vhona tshitaela tshiga tou sofuthiwee r netiweke mushumo masiaṱari lingedzani fhelelwa bvisa vhuṱhogwa Vhekanyani vala une tshithu thikhedzo tendela siangane muswa mozilla lavhelesa Khwaṱhisedzani kale itea Fhelisani fhedza emeili dzudzanyani buḽoko tsumbandila thendelo Longelani kilikani f zwipiḓa ye vhune thuso thusedzi SHA1 Ḓoweleaho ḽoga mulandu lavhelesani kiḽike hedzi ane anḓadza zwidodombedzwa yoṱhe vhumbani tshumelo thomani thaiphani tendelwaho SMTP s ntha magumo lulamisa gunubu c Ṅwalwa vhutumani tsivhudzo SSL netscape moudu miswa Khwinifhadzani khole-khole iyi ḓivhei itululani humbela hetshi hafha elanaho dzheniswaho di bviswa bogisi zwiṅwe vhalwaho tshivhalo tshiko tshifhingani swikelela shumiswaho p mivhala madzina Kopani khwaṱhisedza khumbelo KB fhiraho divhei zwire yanga vhuṅwe vhathu Vhalani tsini tshifhaṱuwo Thoho nwalwaho modzhulu luga lavhelelwa laini khophi Iyani ṱhohwana garaṱa fhindula fasitere elana zwone Xndila wanu tshitenwa t sele rumelwaho nzhele ndivho muthu muṋe matungo konḓi konadzei ire heli fulufhela fftb dzaṋu dzanu d zwavhudi windows vhumbiwa tshidzumbe shumi photho ṱole ocsp line Langani ipfi hune fhelisa b wanulusa vhe tshothe tshipida tshibuḽoko tshanduko tola thuthuba thumanyo thege siho phuraivethe phanda nyambedzano monde mmbudziseni masia l humiselwaho garata g fheliswa fhedzisela dzivhisa dzifaela buḓo zwitenwa yothe xslt vhetshelwa tshine sumbedza ri phindulo pfanelo parse khwinifhadzwa ḽiswa Ḽinwalwa inthanete imap haneliwa fhira Fhindulani engedza elani e AB zwigwada zwe yapo vhekanya Valani v ṱunḓiwa tsireledza tikedzi swikela Swayani PKCS nnyi ndaka naho muṅwe menu MD5 logo kunakisani khwaṱhisedze ḽiṅwe Irani Dzudzani ṱahela zwivhumbeo xml waṇu wanalaho vhuṱumani tshithihi tshishumiswa tshinwe tshidzivhisi TLS tendelwa shango ndaela mvelelo Mushumoni mune linwe lainini kwame kwamane khwinifhadza khwaṱhaho khoudiwaho khombo khanzwo itiwa ṱhukhu Ṱhanganedzo hanelwa dzangano DES Chinese Ṱanani zwithu zwiswa zwipulagiwa zwidzheniswa zwenezwo width vhunzhi Vhuedzedzani vhashumisi vhanwe tshiṅwe tshiitwa Thunderbird thalathadzo span shumisiwa shandukiswa RSS ralo nayo mutanganedzi munangi luambo lu longelulula liswa lindele langa kovhiwaho konadzea khwaṱhisedzo khoḽomu khetheaho khayo khakheaho k id h gandiso ftp dzudzanywa cc AUS ṱanganedza anḓadzani ṱana zwothe zwiṱumetshedzwa vhekanywa vhaṅwe vhane vhaṱanganedzi Ṱunḓiwaho tsumbavhune tshithusedzi TshiArabiki Tolani Todani Thivhelani thivhela thaipha swika shandukisa sesheni Outlook ṱoḓani nyambo nnzhi netshedzwaho Nambatedzani muṅwali muvhigo Musumbi muṱanganedzi miṅwalo Mbekanyo maḓuvha luthihi khamusi java ḽiṅwalo isa ḽino Humbulani Gandisani Firefox filitha fhedzisa dzisele dzire dzinwe dalela balelwa ṱavhanya Ṋangani algorithm zwinzhi zwikhala X-Accelerator-Marker vuleni vhuyo vhuraru vhuphara vhunzani vhukwamani vhonala UTF-8 Ṱumani tuma tsireledzwa tshiswa tshinyadzwa tshinyadza TshiCyrillic tikedza thivhelwa thendelano sisiṱeme Putelani PSM none naa muṅwalo musaini mitaladzi milayo loga kondi kokisi khouthu kbd j humbeliwa hoṱhe generated fhirisa Ee eḓanaho dzitab dzikhetho dzifoḽuda dzhia doweleaho DHE brand Automatically athu Ḽanga zwitumetshedzwa yayo Wisani watshi ṅwalwaho w Vhuzwa vhuya vhuthogwa vhumbulu vhulanguli Vhukovhela vho vhanga Ṱunḓani ṱumana ṱuma tunda tsumbavhuṋe tsireledzeaho tshiṱumetshedzwa tshiḓaho thomiwa thikho tenda tanganedza swaya shumise shume sainwa rumeliwa phambano org n muhumbulo modzhuḽu miminete menyu mabogisi m Luswa lavhelela khakhea katela indekisi Ḽihulwane http hovhu height he gireidi fulufhelo fulaga Folida FIPS fhelaho e-meili Dzumbani dzulaho dziphasiwede dzifhio dzhiela DN bvise bvele Bcc ḽanu angaredza ṱanganedzwa ḓaho zwiṱumanywa zwilanguli zwifanyiso yeneyo y woṱhe we vhunwe vhulungiwaho vhulungiwa vhudavhidzani vhone vhidzwa Vhambedzani vcard ṱuwa tshikirini TshiHevheru tshifhinganyana tshibveledzwa tshe tshanu thuthiwa thukhu thohwana Sudzulusani Shumani sek RC4 preferences POP nyimele Ntsivhudzeni nḓivhadzo ndango mutumbu mutaladzi Mululamisi Mubvumo mm mime milaeda midia mathukhwi Mathomo luzwa lugisa longele Litshani lavhelese kuvhanganya kopiwa kheisi khasitama ini humela ṱhumano hanu hanisiwa hanelwaho hanelani hanela hai ganḓisa Fulufhelani fho fhambananaho fhambanaho fanaho European ṋetshedza edanaho dzikhoḽomu dzifomo dzifoluda dzifilitha DSA dovha desikethopho console Bveledzwaho bveledza buḽethe Budo AES zwithuthubi Zwilongeli z wane wanali Ṅwaliswa VKF3 vhulunge vhuedzedza vhudzuloni vhothe Vhonani vheiwa vheani vhaliwa uyu ure tumana tshimbilelani tshila tshidaho tsheo tiwaho tikedzwi thuthubaho thusa thangi tana sumbedze Sudzulutshelani span>khetho class="noWin">zwitakalelwa chrome bvisaho bveledzwa bve buliwa bogisini baa awela ḽaṋu Ṱanganedzwaho Ṱanganedzani ṱane andadza Ṱalusani Ḽaiburari Ḓadzisani Ḓadzisa about zwitevhelaho Zwitaela zwipuḽakiwa zwino-zwino zwayo Zhendedzi zero za yavho xhtml X9 Ṅweṅwela ṅwalisa Ṅwalela ṅwalei vulea vule vhuswikeleli Vhushumisi vhushaka vhuronwane vhuponi vhuḓiṅwalisi vhuiwa Vhuedzedze vhofhelelwa Vhofhani Vhigani vhiga vhewaho vhewa vhea vhangwa vhambedza vhalunguli vhalei vhalea valiwa vairasi UTF-7 Ukhuthani tsivhudziwa tsireledzea tsima TshiUkrainia tshitumetshedzwa TshiThai TshiRomania Tshipembe Tshinyalaho TshiNorwegia TshiKorea Tshikalo TshiJapane TshiHindi TshiGerika Tshidzivhiswa TshiBaltic tshanḓa tshakha todea tikedzwa thuthwaho thuthwa thuthea Thulusi thambo thaiphe tendi teledza teaho talutshedza Swifhadza sumbedzwa STARTTLS SOCKS Shandukiselani Sainani RC2 rasithi raloho puṱedze plugins platformNavigationBindings platformKeys PKCS#11 pima phoḽisi phesenthe pharamitha Phakhethe pfuka pfufhifhadzo pfi ofisini offline Nyolo Nyengedzo nyanḓadzo Notsi nothe Nomboriwaho nne nṱhesa Nganea netshedzwa netshedza net nembelela ndivhadzo ndingedzo Ndededzo nangwaho mutshila muthihi Murengelano mulongeli mukovhe mukano Muhasho mufhinduli msgFilterRules ms miṅwe miswaswo mini messenger masiatari mafasitere mafasiṱere madzheno lwo lulamisiwa longelwe lone leluwa laisentsi kwakwanyedza kunaho kombetshedza khwiniswa khwinisa Khwinifhadzwaho khwinifhadziwa khwathisedzwa Khwathisedzani khomphiyutha khatsho kha-mulayo kbd>Lulamisani menuBudo">Dzithulusi meme-dzo-mumaho meiḽa MediaDocument MD2 MCI Mbumbo Mbuelo Mbidzo mbekanyamushumi mbanalo Mbambedzo mbalosia Mbaelano Mazwiwa Maṅwe Mawanwa maṱuku matshililele mathihi matheriala Mashikia mashikha Mashango mashaika markByDate mapi manzhi manwe mangalaho maledere Malaysia Makokis maitevhe mailViewSetup mailviews mailViewList mailTurboMenu mailTasksOverlay mailOverlay mailEditorOverlay mahumbulwa mafhungorc Maḽeḓere Madzinginywa madzhenele MacUkrainian MacTurkish MacRomanian MacRoman MacIcelandic MacHebrew MacGurmukhi MacGujarati MacGreek MacFarsi Macedonia MacDevanagari MacCyrillic MacCroatian MacCE MacArabic Macao Mabuli mabammbiri lwone lwendoni lwalo Luxembourg luvhili Lutingo LushakalwaThumanyo Lupfumo lupenyo luno lumemeni luluwa Lulimi-nnḓa Lukanda lugiswaho lugiswa Lugisani lugelaho lufuno lufungatari Lufungaṱari ltr longelululwaho lock-item localMsgs livhuwa livhanywaho livhanaho livha litshiwa lithihi Litevhelaho LIST lipfufhi linwalo lino lini lingedzwa Linga limagani lilaho lihulwane Liga-ntha lifhio Liechtenstein Lidzani Libya lesentsi lengiswa lenelo leluwi leluwe Leluwaho lelutshele leludzela left Lebuḽu Lebanon le LdapDwim ldapAutoCompErrs layouterrors layo Lavheleswa lavheleleaho Latani lapo langwa langule languages languageNames langiwaho Langiwa Laṱiwaho Laela Laṱani lḽ kwamea kwamanywaho kwakwanyisa Kwakwanyedzwaho Kwakwanaho Kwaṱhisedzo Kwaṱhisedzani kwae Kuṅwalele Kuwait Kuvhatedzwaho Kuvhanganywa Kuvhanganyiwaho kunguwedzwa kundelwaho kunakiswa Kulungedzwaho kule kovhiwi kovhi Kovhekanani kovhekana kovhana kopelwa kope kop konḓa ko-KR kokodzwa kokodzela kokodza KOI8-U KOI8-R Kingdom kilikea kiḽlika kilika Kiḽinikani kiḽika Kiïikani khwinise khwinifhiadzo khwinifhedzo khwinifhadzi khwinifhadzeaho khwine khwaṱthisedza khwaṱhisedzaho khutha khuroumu khouṱoḓa khoumbelo khoudulula khoudiwa khonedzeo khona Khompouza khoma-yosaukanywaho Kholomu Khmer Khiululani khiulula khithi Khisa Khinifhadzani khiiwa Khiani Khethekanya Khesivi khesa Khephusheni khavho khauwi khaulwa khaulu Khaula khathihi Khanḓso Khani khanedzi khalo khakhulula Khaṱhisedzani khae khadzo Khabinethe keys kbd>Sudzulusani kbd>Ctrl kateli Katelani Kanzwa kanzhi kan junkMailInfo junkMail junkLog jpeg Jordan JOHAB JavaSikiriputi JavaLiṅwalwa Japan Jamaica ja-JP iyo IyaRumelea ḽiṅwe-vho Ḓiṅwaliseni ḽiṅwala ḓivhiwe ḓivhiwa ḓivheaho ḓivhani ḓivhaipfi ḓivhadzwa Ḓivhadzani ḓivha itwa it-IT itiswa ḽitevhelaho itelwaho itelwa itelal itei itee ite Italy ispf ISO-IR-111 ISO-8859-9 ISO-8859-8-I ISO-8859-8-E ISO-8859-8 ISO-8859-7 ISO-8859-6-I ISO-8859-6-E ISO-8859-5 ISO-8859-4 ISO-8859-3 ISO-8859-2 ISO-8859-16 ISO-8859-15 ISO-8859-14 ISO-8859-13 ISO-8859-11 ISO-8859-10 ISO-2022-KR ISO-2022-JP ISO-2022-CN ḓisikela isi iselea ISDN irwa ḓiresiya Ḓiresiresi Ireland ḽire Iraq ḓiraivi Ḓiraiva IP ḽinwalo ḓinwalisulula ḓinwalisa Internet Ins India incompatible INBOX ḓinangele Ina importMsgs importDialog Imiswanyana Imiswaho Imiswa imisiwa imisela imapMsgs IMAP4 Imaninyana ḓilugisela ilo iledzwa ḓiita Iḽi Ignore ifureme IDLE ico IBM-874 IBM-864-I IBM-864 IBM-862 IBM-857 IBM-855 IBM-852 IBM-850 IBM HZ Hwetekanyani HW huṅwe hut hunwe humiswaho humiswa Humiseleni humisela humisa Ṱhumekanyo humbulelei humbulelani humbelo humbelani hulesa HtmlForm htmlcompose htm hoyo ṱhowana Hovha Horizonthala Honyekanyani Honduras Ṱhoḓisiso ṱhogomelo hideBanner heḽo Helvetica heḽli heila hedara hayo havha Ṱhasululo hasha Haniswa hangwiwa ṱhanganyiso Hanedzani Hanedza Ṱhandavhudzo Ṱhalusamaipfi Hallo hadiwee H6 H5 H4 H3 H2 H1 Gute Gurmukhi Guḽosari gume gudise Guatemala greShared GRE's greLocal greForce Gopher Goloi global-strres global girafiki GFX GetWindowsDirectory GetSystemDirectory GetProcAddress Germany GEOSTD8 GBK GB2312 GB18030 gaya ganḓiseiho ganḓisei ganḓisea gandiswea Ganḓaiso Gaelic FW futhara Fushani funi Fungani fulopi fukedzwaho fr-FR France FoḽudaX forward form-data fontscaling Fomathani folusa folidi folderProps folderpane Firebird Finland FilterListDialog FilterEditor filter filithara filhitha files\mozilla files\common fiḽiltha fieldMapImport fieldMapExport fhura Fhumulaho fhululedza Fhufhani fholaho Fhiriselani fhirisela Fhindulwa fhende fhenda fhelele Fheledzani fhedziwa fhedzise Fhedziha fhedze fheda fhe Fhatani fhandekanya Fhambanyiswa fekisiwa feed-subscriptions feed-properties feala FCC Fasiṱereḽa Fasiṱere95 fani fanana fana famithiwa faila faelaḽi F9 F8 F6 F5 F4 F3 F20 F2 F19 F18 F17 F16 F15 F14 F13 F12 F11 F10 F1 eWorld ṋewaho ṋewa eudoraImportMsgs EUC-TW EUC-KR EUC-JP ṋetshedzi ṋetshedze Ṋetshedzani ethe es-ES Esc errors en-za en-us Enter engedzwa engedzedzwaho engedzaho en-gb ḽenelo ḽeneḽi End enctype=multipart Enc en eml eletshedzwa elena elelwa elano El eṱhe Egipita Ḽeḓere Edzanimuthu EdNamedAnchorProperties EdLinkChecker EditorTextAreaProperties EditorTableProperties EditorSpellCheck EditorSnapToGrid editorSmileyOverlay EditorSelectProperties EditorSaveAsCharset EditorReplace EditorPublishProgress EditorPublish editorPrefsOverlay EditorPersonalDictionary EditorPageProperties editorOverlay editorNavigatorOverlay EditorListProperties EditorLinkProperties EditorLabelProperties EditorInsertTOC EditorInsertTable EditorInsertSource EditorInsertChars EditorInputProperties EditorImageProperties EditorImageMapHotSpot EditorImageMap EditorHLineProperties EditorFormProperties EditorFieldSetProperties EditorColorProperties EditorButtonProperties editMenuOverlay EditConflict editAction EdDialogOverlay EdConvertToTable EdColorPicker EdAdvancedEdit Ecuador ECDSA Ḽebulu ṋea Dzumbiwaho dzumbiwa dzumbamaho dzula-ho dzudzanyiwaho dzudzanyelwaho Dzudzangani dzudza dziṅwe-vho dzivhisiwa Dzivhisani dziURI Dzitsumbanḓila Dzithoho Dzithendelo Dzithebe Dzithanziela dzitevhelaho dziseva dzisenthimitha Dzisan-serifi dzipixele dzinzudzanyo Dzinzhini Dzinomboro Dzinal dzimbalelano Dzima Dzilesentsi dzikhomphwutha Dziḓiraivi dziheda Dzifureme dziemoticon dzidzhithala Dziḓdiresi Dzibulethe dziathikili Dziathikiḽi dziakhaivi dzhisiwa dzhiiwa Dzhienisani dzhielwi dzhielwe Dzhielwaho dzhie dzhenisululiwa dzhenisiwe Dzhenisi dzheniselwe dzhenisela dzhenisas dzhenisai dzhenis dzhenie dzhenesa dzhenelelwa dzheneho dzhene Dzhava dzayo dzani Dwayne Duvhal downloadProperties downloadProgress downloadheaders Dominican domain dom divhumbela divheaho divhazwakale Divhashango Divhafhungo Divhadziwaho display dishumisela disa diraivi dirafuthi Dinwalisululeni dinwalisulula ḓdinwalisa dinangele Dilugisela dikatela diita Diimisela Diiimela dialogOverlay dialog deviceManager DELE defaultClient de-DE dd DC Davha Datumuna dathabeisi Darussalam dalelsa dadzise Cyrillic customizeCharset CustomHeaders custom Cryptogrifiki Cryptogirafiki createProfileWizard CP-866 Courier Costa cookies CookieExceptions Compuserve composeMsgs compose Company commonDialogs commonDialog comm4xMailImportMsgs colors Colombia Cmd cleanOnUpgrade class="win class="unix class="noMac">Dzhenani class="noMac">Ctrl class="noMac">Alt class="mac">Opt class="mac">Humelani class="mac">Cmd class="mac China Chile charsetTitles charsetOverlay Charlton changemp cfg certManager certFetchingStatus center-y center-x CDATA caps bytes byte bvisiswa bviseni bviselaho bvelele Bveledzwahafhu bvelaphanḓa Bvelani bvelaho bunugu bulwa buliwaho Buli bule Brunei Brazil BQ bottom bookmarksProperties Bolivia Bold Bokmål Blogs bindu Big5-HKSCS Big5 Belize Belgium beitsi Beisi bebwa BBS baseMenuOverlay baka Bailey Bahrain Backspace ṱavhanyisa ṱavhanye avha autoconfig Austria Australia ATT atsho athikiḽi asynchronous askSendFormat Asian Asia ar-sa ARMSCII-8 Arial Argentina are Arabia Apulethe ApulaHuthihi apppath Applelink API ṱanzielwa ṱanwa ṱanganyisa Angani ṱanganedzi ṱangananaho ṱanganaho Ṱanea andadzwa Ṋamusi am-serverwithnoidentities am-server-top am-server-advanced am-offline am-main am-identity-edit am-identities-list am-copies am-advanced am-addressing Ṱalutshedzwa ṱalutshedziwa ṱalutshedziswa Ṱalutshedzani Alusani Alpha all Algeria Ḓalaho akhaundu ḽaisentse ṱahelaho ṱahedza agreement Afurika afha ḓadzisiwa ḓadzisela advanced-scripts addressingWidgetOverlay addressBook addBookmark ACL AccountWizard AccountManager accept2locale abSelectAddressesDialog abResultsPaneOverlay abNewCardDialog abMainWindow abMailListDialog abDirTreeOverlay abContactsPanel abCardViewOverlay abCardOverlay abAddressBookNameDialog A5 A4 A3 A2 A1 A0 3KB 2KB 1KB  dict-ve-20070206.orig/ve/wordlists/wordlist.openoffice.in0000644000175000017500000017574210562150176021722 0ustar dokodokou ya kha a nga tsha na ni ha dza i khou yo wa Ḽa tshi ho Ḽiṅwalwa vhuṱanzi nomboro zwa ndeme POT-Creation-Date faela package VERSION ḽo dzi mutevhe si uri bva vhukhakhi vha sa kana hu dzina zwi nzudzanyo ngo Ṱoḓa itela ḽi ine fhasi tshifhinga thoma musi dzo humisela nṱha tea Ḽiṅwalo ngomu lwa tsho kona text thebuḽu Project-Id-Version PO-Revision-Date po plain MIME-Version longela Last-Translator Language-Team Content-Type Content-Transfer-Encoding charset=UTF-8 ZONE YEAR-MO-DA NAME MI LANGUAGE FULL nangani humbelwa ndi tshiteṅwa zwo lushaka longelani huna siaṱari hone Ḽaini tshiko buḓo nyito songo vhu arali tevhelaho khetho hei zwipiḓa vhuimo monde tshigwada maitele zwiteṅwa murahu fhedzi thempuḽethe mushumo tshipiḓa database khulwane mbonalo no hafhu Ḓiresi mushumisi kone khoḽomu datumu yaṅu phanḓa longelwa nahone vhukati tsumbanḓila dzine zwire la tshikhala ARG1 tshiga Ṱhumanyo sisiṱeme Ṱhoho fhethu shumisa nnḓa nyolo tshati thikhedzo sele wanala tshanduko bvela fureme thuthani indekisi zwino shuma mulayoni vhukuma shumiswa rumela wo Ḓoweleaho Ṱola vula o nangiwaho fomo dzudzanyani wizadi fomathi siḽaidi sia muvhala tshitaela openoffice nyanḓadzo ntswa laini tsumbo fiḽitha tshishumiswa bvelela tshithu vhulunga mutaladzi hetshi phambano Lulamisani khii madzheno kiḽikani vhalela vhumbani shithi ita dzoṱhe vhumba seva zwikhala vhuphara vethikhaḽa ṱoḓea shumisani nombora mbekanyamushumo engedzani zwauri muṅwalo musevhe dzisele dzhenisa tshoṱhe horizonthaḽa buḽoko itani fhedzisela dzigirafiki muvhigo vhulapfu phasiwede org thutha swika sumbedzani rekhodo re moudu Khwinifhadzani muelo fhiraho swikelela ndango nanga hune elana bodara tsireledzo tshibveledzwa Microsoft mbalo maṅwalo iṅwe vhulungani thuso sumbedza pharagirafu mvelele e-meiḽi bugu shandukisani nzwalelo nyimele dzikhoḽomu zwine zwiga nzhele khoudu kavhili kale ḓiraiva bvisa zwishumiswa shandukisa heḽi mitaladzi mbudziso java Ṱhukhu dzudzanya tshine mukano ḽine gumba bulwaho web wana thi html fomuḽa reithi ndaela longele koni do zwoṱhe ProductName phirintha fonti tshivhalo tshikhau nthihi masiaṱari luambo ire fhelelaho dziṅwe ane tsima ngoho ndima mabuḓo ḓiraivi X vhune vhumbiwa vhuṱhogwa Vhuedzedzani une siatari Khwaṱhisedzani giridi girafiki engedza vhalelwa nange maximamu kusuvhele URL mbadelo maimo itiwa funga engele disiki bvisani bogisi zwitaela y ṅwala tshiṅwe ri nḓila netiweke maipfi lulamisa ino fhela eḓanaho dzivhiswaho amba vhupo mitevhe meiḽi maṅwalwa macro lu elanaho afho Ṅwaha tshitaila thulusi mutengo miṱaṱisano madzina vhuvha vhutanzi vhulungwa tshivhumbeo sumba siangane pfanelo mulaedza mathomoni hafha foḽuda writer vhuedzedzwa mulanguli linwalwa khwaṱhaho khakheaho hezwi Excel bveledza xml tshiṱumanyi sun ralo matungo magumoni ḽiṅwe itea gunubu fomatha fhelisani Windows tshifanyiso thomiwa thero thebulu sipuredeshithi ngauri mishumo lo lavhelesani ḽiṅwalisa Ḽiswa heda fekisi zwavhuḓi vhetshelwa vhala tou thungo Ṱolani nyambedzano Kopani ipfi zwone zwiṅwalwa tshumelo tshamonde Tendelani tendela seiva saizi phirinthara ndumeliso ndenya murunzi minimamu maḓuvha ṅetshedzwaho daimensheni calc wanani Ḓuvha tsivhudzo saathu ODBC ndingo mivhala mbonalonyangaredzi hoyu fasiṱere dzhenise zwiṅwe yapo tshishumiwa tshikwere sekisheni Rumelani phumula notsi li konḓaho inthanete futha faila Dzumbani dzhenisani bitmap bithi vulani vhekanya vhe tshauḽa tikedzwi thomani nnda lingana khwinifhadzwa kheve hadi Yuropa yoṱhe vhurifhi vhaliwa ṱunḓiwa thuthiwa thendelo Talelani Sudzulusani oṱhe menu mafhungo editha dzifaela baa adzhenda zwithoma zwiḽaidi thumanyo Sql pdf naho mvelelo mushumi kwamani kheisi katela ḓivhei imela FTP Fhandekanyani fhambananaho Ḽevele dzithebuḽu dzimacro vhuedzedza Vhekanyani ṱumanywaho Tshiarabiki thempulethe shumiswaho shumi ngaho muhumbulo mubvumo masia luthihi longelwaho konadzei kiḽika khwinifhadza khwaṱhisedzo khumbulelwa JDBC itwaho gonyisa fhirisa fhelela Ḽeyara dzudzanywa dziḽaini dzhena Ṱanganyisa Ṱaluswaho ḽaisentsi zwigwada Word Ṅwedzi vhuyo vhuṅwe vhubindudzi tshiputo siho shandukiswa rumelwa ndingedzo mashithi luswayo kundelwa khayo kharentsi guḽuu fonwana fomethe Fhufhela fanaho deshe yanu vuliwa vhushaka vhukovhela vhonala vhiga tshire Tshipenishi toda shandula sethingi Putululani OLE nyengedzedzo ntha ngayo nangiwa misevhe magumo lungano impress Ṱhaluso guma ganḓiso Fhufhelani fhira ERR dzhiela diresi desimaḽa bula Akha zwiṱuku Zwipfufhi zwikwere zwifhinga wanalaho vhupfiwa vhulungiwa vhuḓiṅwalisi Valani Tshitshaina tshikirini tshifhingani tshidzivhisi thwii thusa thaidzo teaho swifhadza Shandukiselani Putelani PowerPoint pambuwa ndaka n mvelaphanḓa mona manyuala lwo kopa khonthuwa khomphwutha Ḽino Ṱhodzi hayo Hangulu Ṱhanḓavhudzo ee dzothe dzivhisa dzhiele ṱanganyiswaho vethikhala tshedza tsekene poswo phanda phakhethe muswa muṇe mbili Mbidzelelo mathomo manwalwa maledere khwinifhadzo khakhea katelani JRE ḽihulwane humiselwa hovhu foluda DOS digirii databeisi Ṱanani zero webusaithi ṅwalisa vhuvhili vhure vhona vho tsireledzwaho Tshiṱundi thithilidzo thandela tendelwaho tendelwa sumbiwa StarWriter shango shandukisela sekele nyandiso ntswu muṅwe mulenzhe Microsystems maḽeḓere maanḓa louda lingedzani kuvhanganya kiḽasi iyi ḓitika ID haṅu ṱhalutshedzo hai fhedzisa dzire dzikhetho dzheniswa dovholola axis athu Apple angaredza ḽaiburari zwifanyiso zwidodombedzwa Tshisiriliki tshikalo tshiitwa tshiḓaho tikedzi shumisiwa pharamitha Othofomathi ṱole Ḽoṱhe MS modzhulu mbofho mafhedziseloni Macintosh lavhelelwa kwama iyani hoṱhe heli Hedingi Ṋetshedza ḽebuḽu dzidigirii dzhielani draw budo badela Ṱanganyisani Ṱalusa Ṋaledzi Ḓadziswaho Ḓadzisa zwivhili zwiko vhege tsireledzwa Tshiisimane tshifhinganyana tshe tsela tsaino thome thikho thendelano thasululo Tatamudzani tab Sudzuluselani Solaris simbolo shume pimiwa Pilot otho Mushumoni mupo MB maṅwe math logarithm khophi hayani guṱe gamma fhedza ṅetshedzwa Ekisithurushini e dzheniswaho CJK bvisiwa Basic Ṱana Ṱalusani zwithu zwibuḽoko zwe z ye xela wanali ṅwalwa vhonadza Vhambedzani vesheni uno Ṱumanyani tshitatamennde tshikimu tsa thusedzi takalela StarOffice shela s Riphuleisa putela mulandu muṱanganedzi Mozilla miṅwalo miminete menyu lune Luṱingo lugisa luga lingedza lavhelelwaho khwinisa khona khaḽenda iwe Iranihafhu inwe inc heyi fhelelwa fana dzirekhodo dziburaketse CD beta bammbiri anḓadza Access zwitenwa zwikhau vhutshilo vhunṱha vhea vhashumisi US Ṱunda ṱunḓa ṱuma tsitsa Tsireledzani tshitikedzi tshiswaswari tshisumbi tshipikwa tshikiriputi Tshiasia Swayani sumbedzwa StarCalc sofuthiwee sine pimeaho phesenthe ola ofisi ṋṱoḓa nwala none ndivho Mutalonnḓa murumeli mukumedzo muṱaṱisano Monisani miṅwe liṅwalwa linga leludzwaho khuphoni khevaho izwi itulula generated gaidi FILE Fheledzani Fhedzisani dzifonti dziḽebuḽu dzhia di cosine Boolean Automatically Ṱano ṱanganedza Ṱandavhudzani zwothe zwiwo zwiputo zwihulwane ṅwalisulula vhunzhi uya tswuku tshiwo tshithihi tshitenwa tshiswa Tshilatini tshifhandekanyi tshidzumbe tshena tshaṅu tikedza thikhedzi talusa Suphasikiriputi sudzulusa StarDraw shandulwa shandukiselwa rekhoda pima othomethikhi othomathiki OpenDocument Ḽogo ṱoda ndugelo MySQL murango modele mm milaedza methiriki metafaela mbekanyo mausu lugisani kiḽipibodo khwiniswa khephusheni katelwa ḽithihi Ṱhukhusa hedzi ṱhanziela hani hafha><ḽiṅwalwa Ganḓisani futhinoti Fhungudzani F Ṋetshedzani ḽeḓere ḽebulu dzudzanywaho dzitshanduko dzhoini Dovhololani difolithi desimala daigonaḽa CR chi Bvelaph buḽuu bule bitimepe ba avaredzhi ṱaniwa ṱanganyisela Ṱanganedzwa alpha zwitaila zwisiḽaidi zwipida zwibveledzwa zwea webu vhuthihi Vhubvaduvha vhekanywa vhale tswifhadzo tswayo tshinyadzwa Tshigerika tshiḽeithi TshiChina thuthuba thukhu thaitili T StarImpress sisiteme sipeshala shanduka seiviwa Roman Pocket p ḽoga office odo odio octal NzudzanyoyaFureme ngona ndulamiso miṅwedzi mivhigo maswa mahulwane luvhili lulamise lingedze lavhelesa Laser kwa kopiwa kondaho kiḽike khulwanesa khetheaho khesa khaula khathihi khasiṱama Itululani inwi ḽinwalo Hyperbolic Hanja ganḓisa furakisheni fhandekanya fakisi edzatshipuka dziindekisi Dzidigiri dziaxe dzaṅu dodombedzwaho DDE dBase dathabeisi burausa buluu Bulani bindu are ṱahela Ḓadzisani zwivhumbeo zwima ZIP yone wizathi ṅwaliwa vuleaho vulea vhuswa vhuronwane vhulungwaho vhudzuloni vhewa vhanga vhalelani vhala-fhedzi value vala ṱumiwaho tsireledza tshiswayi tshihaḓu tshidzheniswa tsendama Time tikedzwa thothaḽa thaipha tanganya swikelelwa sialala salaho raundu phetheni OthoPhaiḽotho Ḓorobo ngeletshedzo Ngaḽoṱhe ndila muthihi Musumbedzo munwalo mululamisi mulongeli monaho marifhi manyuaḽa madanzi m Linganya ledere laulwa kuvhanganywaho konadzea Kiḽikani-kavhili Khwinisani khwaṱhisedza khonfigaresheni khathaḽogo KB kanzhi kala ivini itwa itshi itiwaho ḓitikaho ḽire Irani intshi ii Ibvani horizonthala hexadesimaḽa henefha Ṱhalusaipfi girini gireyi garaṱa gandisani fhiriswa fhelisa engedzwa emeiḽi elani eḓana dzumbiwaho dzivhiswa dzinomboro dzima dzilaini dzhielwa DPI doweleaho dovha DD cotangenthe com bviswa Bvelani buḓa Bézier base badelwa anyuwithi Ṱanganedzei alifanyumeriki akhaivi Ḽainini zwituku zwipiḓazwinzhi zwinzhi zwikiriputi Zwifaro zwenezwo Zumu Zumelani XSLT wanuluswa voḽumu vhuṱumani vhulunge vhukwae vhukoni vhubvo vhonalaho vhofholola vhambela vhambedzwa vhaṱanganedzi vekitha tsumbandila tshothe tshivhanga tshithusedzi tshithomatshihaḓu tshinyala tshilongeli Tshifonetiki Tshibengali tsheo tsengo toḓa TMP thuthwa Thuluba Thiraiengele Themphuleithe thangi Thagethe tevhekana talela sumbedzwaho sudzuluswaho sinthekhisi sikiroḽa Shelani setha renga puṱedzani polygon Phumulani photho Phalethe pfufhifhadzo PC othe OS noutu nnzhisa ngaḽo netshedzwa ndapfu nambatedza muṅwali muvi mutumbu miṅwaha milayo miḽaini mbambedzo max Makokisi mabulwa luvhondo luṱa longelulula livhiwaho livhisa line leluwa LDAP kuvhanganywa kombetshedza Kombamaho kharedzi khamphani ḽiṱuku iii idzi hwaya humelani holu Ṱhoḓea Hangul Ṱhandavhudzo haiphalinki gaḽari funa fulufhelwaho fomula FIELDNAME fhufhuma fhelisiwa Env Enkhara dzivhege dzitshati dzipharamitha dziheda Dzifiḽitha dzideshe dzhenelela dzanu dovhololwa Doto dombelelaho diraiva didzhithala dededza dalelwaho dalelani d cm bvelelaho bvaho beisi b Axisi ṱavhanya ḽaṋu ARG2 app ṱanganelanaho Adabas Zwipopola zwilongelwa zwigidi zwifhiwa Zwidzheniswa zwavhukuma Zumani YY XP www windosi wela Weibull vulei vidio vhuraru Vhungomu VhuṱanziVhuhulwane vhoṱhe vhofhiwa vhewaho vhelelwa vhabveledzi Var ṱunḓiwaho Ṱunḓani ṱumiwa tsinisa tshipida tshinwe tshinamo tshimbila tshimbidza tshikwama Tshikorea tshikhauli tshiimiswa tshihulwane Tshifura tshifarafhethu Tshidzhapane tshibulwa tshanḓa Tandedzela swikelelea swikela swaya swaswara sudzuluwa sudzulutshelani StDev src SMTP shumise seriala sainiwaho sainiwa saina sabusikiriputi rumelwaho ruḽa Rembulusani rembulusa rathisela r putedzani Postscript pi phuraivethe phirinthiwa phaiphi Outlook othomathikhala ṱoliwa Nyengedzo nyaluwo nnyi nḓisedzo ngomu-ngomu nembelelaho nayo Nambatedzani muvhuso Mushumisi-o monisa mmbaleni misi misekene minzhi mini min MIME milaini Mikano midia mepe memori masheleni mapi Manweledzo makhuro Mahumbulwa Magumba Magombiko Luisimane lugisela luafhulelo lithihi liswa linwe linwalo lingani LF levele Kuvhanganyani Kuḽokowaisi konou Kokodzani kokisi khwinifhadzwaho khwinifhadziwa Khwathisedzani Khurosiwa khurosi-feida khouthu khoḽumu khouda Khonelani katelela Ḽi?walwa Ḓivhaipfi ḓivha itululwa itelwa ḽipfufhi Ḽinwalwa ini India Indenti IIS iḽi humisa hohu he haniswa Ṱhanganyiselo hana gidima fungiwa filitha fhungudza explorer endenoti eḓani ḽe dzula Dzudzanyanihafhu dzudza dzone dzitsengo dzithempuḽethe dziradian dzinwe Dzikhounu dziṱhoho dzifomuḽa dzididzhithi dzibodara dze dzavhuḓi dt dikishinari deshiwa dailogo daigonala CTL Count c bveledzwaho bveledzwa buthahafhu buliwa bono Bodo bibliogirafi Beziki baḽantsi awela awara Asia Apudeitha Ṱanḓavhudzani afha zwisumbi zwipuredeshithi zwikere zwifhio zwifarafhethu YYYY yanga WinWord Webupeidzhi wave wanulusa wanu Ṅwalani vusa vhuvhambadzi Vhurwa Vhumbuluwani vhumbiwaho vhumbe Vhukhahi vhuḓalo vhonadzaho vhofholowaho vhidza vhalani-fhedzi vhaho VBA VarP valiwa uralo Ṱumani uḽa tumanywa tswonyelwa tsireledzululani tsireledzeaho tsireledzea tsimbe tshumiso tshiṱumetshedzwa Tshithekhishi Tshiswahili tshipentshela Tshintshanani tshino Tshileme Tshikhedishi tshihulwanesa Tshihevheru Tshifhiwa Tshidzudzanyi Tshidzheremani Tshiṱaraṱa tshaula tshandulo tshakha thoho takalelwaho Swaswarani StDevP sota Silanti sikirola sika Siḽinda Semisekele sabuthothaḽa Rula rubi RTF rot13 riphuleisiwa Rekithengele ra quantile pwasha pulatifomo Puṱedzelani Poisson Phitshi Pharalele pfufhi othomethiki othomethikhala othomethikhaḽa othomatiki Othofomethe ongolowa olani Ṱoḓani nyeḓano nyambo nnzhi ngauralo netshedza ndovhololo naa Mutwe mutshila Mutalo mutala mupeleṱo mupeḽeṱo muhulwane muḽaini mu monitha moniswaho minwalo minete mimodzhulu Midzi Metse meili mbofholowo mashango Masana manwalo Magenta Mafhung Madzhini madungo Mac mabudo lwoṱhe lumveru lulamiswa Luṱ longelea Linux linki lapfesa langiwa laiburari Kulokowaisi konḓi Kilikani khwinisiwa khwaṱhisedze khonadzeo khoma kho Khiyi khawo khauwa kerna katelwaho katakana itelwaho Itanihafhu ira ḓiphina io inthavaḽa inthanethe indenthi imphotha imisa iho hyphenasheni hyperlinki huṅwe humbela Gumofulu Gnome giradienti gera Gandiso futunoutu Fureimisethe fulufhela flash Fiḽithara FIELD fhungudzwa fhindula Fhedzi-ha fhanda fhambanaho Fhaṱani fareaho fani euro eps Engedzwaho engedzedzea Ellipse elahafhu dzumbamaho dzumbama dzudzanyelwa dzivha Dzitshupu dzithebulu dziseva dzipixel dzipharagirafu dzinyito dzinwevho dzingu dzimakhuro dzikheve dziḓiraiva dzigunubu dzifutha dzifureme dzifomo dzifomathi dzidatabase Dzibureisi dzibukumaka dzibuḽethe dziba dziaikhoni Dzhiani dzhenerala dzangano doc Devhula davhulo data danzi csv Buraketse bulwa buloko Bridge binomiala Bessel ṱanganyiswa Ṱanganya Ṱangana andiswa Anḓadzani ṱalutshedzwa Ḓalaho ADO zwitukusa Zwitopo Zwithusedzi zwithomathoma zwitatamennde Zwishumi Zwinwevho Zwikimu zwiitwa zwifhandekanyi yothe yayo yadzo woṱhe Wise wisa waṅu wane ṅwalwaho ṅwaliswaho Waivi vulwa volumu vhuṱumanyi vhuṱolamupeḽeṱo vhunwe vhuntha vhumbea vhulungea vhukando vhufhio vhudzedza vhudza Vhudavhidzani vhubulwa vhonali vhathu vhambedza Venetian variebulu Valeaho ṱuṱuwedza utlui usr ṱusa URL1 Unix ṱumanywa tunḓa Tsumbedzelo Tsimiwa Tsimani tshone Tshiṱunḓi tshiṱuku Tshitumanyi tshitopo Tshitingeledzi tshisumba tshishandukisi tshilapfu tshikovhi Tshikoreani tshikhonvethi TshiFrench tshifhanda TshiDutch Tshibuḽoko Tshibolitiki tshenzhemo tshenisa tshanu tshaka Tolani tola todea tm TIFF Thothala thodzi thithisa thimu themphulete thekenikhaḽa Thanziela thaithili thaiphe tevhekanaho template tangenthe Tanganedza tama Switzerland SWF suvhelela sumbedziwa Sudzuluwani sudzuluselwa SSL SPARC source so shumiselwa shumisei shumaho SeNṱha sendmail sek Sedzani saithi Sabumenyu rwepu Runtime rumeliwa row rina riṅe rekhodiwaho rekhodiwa Rekhodani Rea rathiswa rathiselwa RAM radiasi radiala python pwashea pv program Polygoni phurogireme phurofaili phointhi phiriviwu phiriNṱha phindulo phere phede Phatheni Phai Pearson papamalaho Palm pakululwa Othofiḽitha ḽothe orenzhi oputimala Opusheni options Ḽogani Ofusethe nzudzanya nyengedzedzo-ngayoṱhe Nyedzatshipuka nyana npery NPER Nomborani nḓivhadzo ngatsho ngalangala Netscape ndalukanyo nangoho nambatedzwaho mveledziso mutswu murengisi munwe mune mulayotibe Mufumakadzi mudzi mubveledzi muṱangano monisiwa monde-uya-kha-tsha mondeni Monde-Fhasi Mivhili mitshila-mivhili misc Mielo mbo mbalelo mavhili matuku mathemo maitela maikhuro Mafhelo Macromedia Mabebo Lutombo luta Lushaka=1 Lushaka=0 Lupenyo lufhio longelululwa liṅwalo linganyisa lifha lemela leluwaho lanu langa lambda kwakwanyedza kushumele kuambele ku kovha konaho kilike kiḽipubodo Kiḽipuathi khwinifhadze khwathisedzo khungulu Khumbudzo khumbelo khumba Khoudiwa khoso Khonthirasiti khonaho kholomu khiibodo khia Khethekanyo khaulwa khaho khadzo kaṅwe katifhadzwa kateliwa kateli kararu kaliwaho kai JIS izwo itiswa Ḽitevhelaho ite ISO irwahafhu Ḓiraivia Ḽinki iniphuthu iNṱhanethe iNṱhafeisi imiswa Imisani imenyana imelela imedzhi ḽiḽi idzo Ideographs hyperḽinki humiswaho Humisiela Humiselani humela HTTP HOST Ṱhoḓisiso hiragana hetshingi Hebrew haya Hanisani Haifanesheni gumi gonyana Giradientsi Gerani ganḓiswa fusha Franc founu font Fonetiki fomathiwaho fomathiwa Fomathani filter filepicker fheliswa Fhelelani FheledzaNgaYoṱhe fhandekanywa Ḽeveḽe ḽethahede engedzedzwaho Ḽeḓeretsendama edanaho dzudzanyo Dzudzani dziURL dzithempulethe dzithemphuleithi Dzitab dzipolygon dziphirintha Dziphiramidi Dzimetafaela dzimbudziso dzikiḼasi dzikhophi dzikhona dzikholumu dzikholomu Dziholodei dzigiridi Dzigaidi Dzifilidi dzifhio Dzibitmap dzhie dzayo dza-4 duvha dlg divheiho ditika disimala diraivi Dif dialogs dialog Deithi DEFINEDVERSION DEFINEDPRODUCT Date dala dairekhithiri Daimane Cyan Cotangent contangenthe coefficient coefficeinthe Chart bvise bvelisa Bveledzani bva-kha-Tshauḽa Bureisi buraweni buliwaho Bulavhupfiwa Bukumaka buḽethe bmp Bini Bevele beisilaini Beisani bathoni Bangladesh bambiri aya ḽa-uya-kha-tsha ARG Arabiki ḽanu Ḽa-Nṱha ṱanganyiselwa Ṱanganyani anḓadzulula aluwa ṱalutshedzwaho ḓala akhounthu Aikhoni Ai Ḽa-Fhasi accessibility aaa aa Zwiundiwa Zwiṱumanyi Zwitakalelwa zwiswa zwisiwana zwishandukaho zwisekene Zwiraru zwirafhethu zwinzhisa Zwikhauli Zwikhalazwadzina zwiṱepisi Zwiedzatshipuka zwidzivhiswa zwavhudi zwaṅu zi zeta Zealand Yunivesithi Yunikhoudu ys Yela yau XX xi X-Generator wisela WinLatin wekesiṱesheni wekeshithi Weivi WeeksInYear WebCast Wavho Ṅwalisululani w vulelwa viwu view vhuya vhuṱuku vhutukusa Vhutshiko vhuthogwa vhushumisi vhushumi vhuno vhumbi vhulongeli vhulanguli vhuḓinwalisi vhuhulwanesa vhuhulwane vhuendi vhuedzedzwe vhuedzedzwaho vhuedzatshipuka vhudiṅwalisi vhudi vhudenya vhuṱanzi2 vhuṱambo vhuṱama vhuṅa vhonetshela vhofhiwaho vhofha Vhigani vhidzwaho vhekhanya Vhekanyelani vheiwa Vhaṅwali vhashumi vhashu vhanu vhangwa vhambadza vhalwa Vhalondiwa vhalea vhalani vale uyu ṱusiwa Ṱusani usa ure ḽupu upsilon unset Unified ṱumulula ṱumanyiwa ṱumanye ṱumanya ṱumana Ṱukufhadzani UI type txt Tumanyani tuma tswikelelo tsumbavhune tsumbavhuṅe tsivhudziwa Tsivhudzani Tsitsikana tsini TshiZulu TshiXhosa TshiVietnamese Tshivhuru Tshiudu Tshitswu TshiTswana tshitshena Tshithomatshihadu Tshithoma Tshithai Tshitambi Tshisuthu Tshisotho Tshisebia TshiRoma TshiPortuguese Tshipidi Tshiṱoḓisisi tshinyadzwaho Tshinwali Tshintshani tshintshana Tshinepali Tshimedzi Tshimaleyi Tshilutheniani Tshilongelwa tshili tshilaho tshilafhadzo tshikwe Tshikwamani Tshikwairi tshikovhiwa tshikoro tshikhwaṱhisedzi Tshikhalatshadzina Tshikashmiri TshiItalia Tshiimo Tshihumbulelwa tshihadu TshiGerman tshifumakadzi tshifhandi TshifanyisoMepe tshidzivhiswa Tshiarabu Tshiarabia tshiṱanganyi tshelede tshathi tshanga tshanele Tshandukiso tshamurahu Tools Tombo tole to t-nyanḓadzo titilidzwa tinya Timatimisaho Timatima Tilde tika thuthwaho thuse Thunderbird thulusa thouna thoḓea Thivhelani thivhela Thithisani Thirantsiparentsi theta thesaurasi Theo Thendeleki themphuleithi Themphuḽeithi theiphi Thalutshedzo thaluso Thaiphani TGA tevhele tevhela tevhedzela tendelana tenda tau TARGET Tangent tanganyiswaho tanganedzwa tandululwa Tandedzeaho Tanani tana Tambani taluswaho Talusani takadzaho TahomaBold10}No tahela Synaptics Swondaha swikelelei swifhadzwaho Swifhadzwa swifhadziwaho swaye SvNyolo SVG suvhelelaho sutu Sumbani Sum start StarMath stardiv SQLyanga Spline Sinkhuronaiza singili sina Sikiroḽo sikena sikeilingi sigma siaṱarini shumiwa shumiswe shumisiwe shumisea Shumisahafhu Sheduḽu sheduḽa shangoni shandulwaho Shandulani shandukiswaho shandukisiwa shandukise shandukaho Shandikisa SF sete SESSIONMANAGER serisi Serifi Semikholoni seleni sekondo sekithara sedzuluswa sdi SDBC Saukanyani saukanya SAR SANE salela Saidi Rwepa ruthu rumele ROWNUM ro Risetha rhombasi rho resource REPORTFORM RengwaKha Relethivi Rekithenguḽa rekhithengele refarentsi redzhisitariwaho Rediasi Rasterfaela rashio ramba Radio radian Pwashani Pwanyeledza pulana PTNUM psi Product Presentation posa pop-up Pop Polyḽaini PM pixel pikiwaho pikisele Phurophathisi Phurophathi Phuromota phulu phulingi Photo-CD PHONE phoḽisi phirinta phimo phi Phelo phambana pfuka pfufhifhadzwaho pfufhifhadzwa Pfalaho peta Perl penyelela PCX Papamala Palette Pakiwa Pakani packed Ovafuloo Orienthesheni Oracle Ṱoḓou one on omicron omega Ṋombora ṱolwaho Ṱolela ṱoḓiwa ṱoḓiswa ṱoḓisisa odi NzudzanyoyaMvelele NzudzanyoMvelele NzudanyoyaFurme nyumereitha nyumerala NyangaredzongaOtho Nyanganyelo NyandadzoNgayoṱhe nyandadzo nyalo Nwelela nwaha Nungo num nu noti NomboroyaMutevhe nngana Nḓivho nḓila-ḓe nṱhesa nṱha-tsha Ngudo nga\tDatumu Ngamurahu Ngamaanḓa Ngaha ngafhi NFS NEWLINE New nethiweke nembelela nekedzwa nea Ndugiselo ndivhadzo ndinganyo Navigesheni Navha nangwaho nangeaho nangea nambatedzwa namba mvelephanḓa mvelaphanda Mutswuku mutshini mutshila-muthihi muthu Mutanganedzi Mutaili Mushumusi murumelwa Murei muratho Murafho Munna mundende multinomiala mulayo mukovhe Muṱhomphei Muhasho mufhandekanyi Mubvisi Muanḓadzi muṱala MSSansBold8}Lushaka MSSansBold8}Ḓiimisela MSSansBold8}I MSSansBold8}Foḽuda MSSansBold8}Bvisani msi Mpho mpeg moudu=1 moudu=0 moniswa Monde-Nṱha mitengo Minwedzi minwaha mimodzhuḽu Mimenyu mihumbulo mibvumo Memo meṱiriki Medzha Mbulungeno Mbulungelo Mbilu mavhi Matungo-Mavhili Matrix MathType mathomani masiki masiatari masiangane Mashudu Mark manzhi ManweledzongaOṱhe Manwe malugana malederedanzi mafulufulu Mafhande mafasiṱere maelana Maddin madavhulo Mac-Pict Macaulay Mabulele mabammbiri mabadelo maanda Ma lwothe Luxembourg luṅwe luswa lushala lushaka-lwa-midia Lupu lunzhi lulamisiwa Luhuhi lozwa longelwe longeliwa Longelanihafhu Londani loṱhe LOGICOPERATOR logarithim loga lngelwa lire lino Link Liniya linia lingu lingiwea linganaho lindele lindela LIKE lihulwane lib lenga Learning le lavheleswaho Lavenda Langani Landula L kwamea kwame kwamanani kwamana Kwakwanyedzani Kuvhanganyululani kuvhanganyulula kuvhanganyiwaho k-th kovhiwa kovhekana kou kopei Kong konḓesa konadzee Kombamiselani Kokovhela Kodak kilipubodo kilipibodo kilika Kilasi kiḽikiwa khwiniswaho Khwikisiṱata khwifhadzwa Khwatha Khwamani khwaṱhisedzwa khunguwedzo Khountha-Kulokowaisi khoui khotsi khothesheni Khoodineithi khontheina Khonivetha Khoneni Khomphathibilithi khirasha khiiwa Khepusheni khei khauwi khauwe khatsho Kharensti khao khantsela khamusi khamera khalo khalenda Khakho khagala khabinethe KBabel katelelwa kappa ka K JPEG Ḽiṅwalwat ḼiṅwalwangaḼoṱhe ḼiṅwalwaḼinyanyu Ḓiṅwaliseni Ḓivhe ḓivhadza itilula iteaho itaho IsLeapYear ISBN irei iota ḽinwe inthaekithivi Internet International Intel Installer inisitolesheni index ḓinangela ina in imiswaho IMAP Imani ili ḽihumbulelwa ḽiga ḽifhio ifhio Icelandic Iḓaho Hypheneithani Husi humisiwa humbulwaho humbulwa humbulelwaho humbulela Humbulani Humbula humbelwaho humbelea Ṱhumano hulwane HRESULT Houḽa hothe horizoNṱhala Hong holodei Ṱhohwana Ṱhirei haniwa ṱhangayiselo haluluwaho haifaneitha Ṱhahelelo hafu gurupu gonya gireyisikeili Gireisikeiḽi Gireiscale GIF geriwaho gathi ganḓisei Ganḓisagunwe Gamani Galari Futhunoutu futhinoutu Furemela Fungwa Fulwi fulufhelo fulobo Fometha fix Fiḽipa fhungo fhiri fhirelisa fhelelela fheledzwaho-kha-muelo fhedziwa fhasi-tsha fhambana fhaṱa fekithoriala fasitere fara fane Faela-FM3 eta epsilon Environment engedzedzwa ene endenoutu e-meili emeili elliptikhala Elipisoidi Elanihafhu Edzanitshipuka Edithea edishini ḽedere Ḽebuḽani dzwalaho dzule dzulaho dzudzwa dzudzanyelwaho Dzudzanyeaho dzudzanyahafhu dzitshumelo dzithemba dzithebe Dzispline dzisisiṱeme dzisethingi Dziserisi dzisekondo dzisekisheni dzisekende Dzisan Dzirula Dziruḽa Dzirou Dzirhombasi Dzirekithengele Dzipharametha Dziphambano Dziphai Dziopusheni Dzindima dzindeme Dzindekisi dzimetric dzimbalo Dzilinki Dzikhii Dzikhamphani Dziḓiropokhephe Dziḓiresi dziindenthi Dzihetshi Dzigireisikeiḽi Dzifurakisheni dzifoḽuda dziekisepusheni dziḽebulu dzidesimaḽa Dzidatumu Dzibuḽoko dzibulethe Dziblind Dziarc Dziṅaledzi dzhenisiwi dzhenisiwa Dzhenani Dzhenala dzhenaho Dzhamo dzawo dzavho dzapo dzanga dza-6 DTD dtappintegrate Dovholosani dovhololaho Dollara Dokololani Dock DN dll dl Dinomineitha Dimota Dimani Diagonaḽa Desikethopho delta DeithiyaThengo de DB DaysInYear DaysInMonth datefunc dalaho daka daimesheni Daikiretiki daho da core control config component Compatibility Columnar Click classes Chinese Chevuroni Center CDE Canada C=1 C=0 bvisiwe Bviselakhagala bveledzei bvele bvelaphanḓa Burotsha Buratsho Burakete Bulethe buda Bopomofo bin bibḽiogirafi Bibiliogirafi beveliwa Belgium Bammba balelwa B6 B5 B4 Awelani Ṋawa ṱavhanyiswa ṱavhanyisa AutoCAD Australia ASCII arctangenthe arcsine arccosine Arc AppLushaka AppId AportisDoc ano ṱaniwaho ṱanganyisiwaho ṱanganedzi ṱanganedzea ṱanganedze Ṱanganana Ṱalutshedzani aluswa Alusa ALPS alidzhibura Algorithm alfanyumeriki Alainimente alaina ḓaka Ḽaini-nnzhi afm afhulwaho Ḓadziswa Ḓadzisiwa Ḓadzisanibitmap ḓadzisabitmap Adzhenti Adobe Adaputa activex A1 Zwpiḓa Zwoluga Zwiṅwalwaposwa Zwiṅwalwa-nga Zwiṅwalwamutumbu ZwiṱuṱuZwihulw ZwiṱuṱuwedziZwihulwane Zwiunḓiwa Zwiṱumekatshedzwa zwitumetshedzwa Zwitumanyi zwitshithu zwitshiga zwitshena zwitingeledzi Zwithuthwa Zwithabuḽeithi zwiteṅwana Zwitevhelaho zwitats Zwitatisitiki Zwitatisiṱiki zwitatammende zwitange Zwitalusi zwitake zwitab Zwishumsiwa zwishumiwa Zwishumiswazwanduni Zwisavhonali Zwisagumi zwirumelwa Zwirafarafhethu zwipulagiwa Zwipiḓazwathebuḽu Zwipentshela Zwiṱoredzwa Zwiṱoḓea zwinwe zwinw zwino-ha Zwine-zwaḓo-Itwa Zwinepe Zwinamo Zwina Zwimela Zwilongelwa-Ngomu zwilengo zwilanguli zwilaidi zwikwairi Zwikuvhanganywa zwikolo Zwikiroḽobaa zwikhauwa Zwikhaula Zwikhalazweadzina zwikha ZwiḽiwaZwifhio zwiitisi Zwiitei Zwiṱirepe zwihumiswa Zwigireisikeiḽi zwifuniwa zwifhiyo zwifhingazwofhelelaho Zwifhande Zwifaratshifhinga Zwiṅetshedzwa Zwidoto ZwidodombedzwazwaOda ZwidodombedzwazwaInvoisi ZwibadelahoMuthelo zwiṱanganyi zwiḽadi Zwezwo Zwdzheniswa zwayo zwavhu zwaTshilatini Zwasaralondeme Zwa-Nyengedzedzo zwanu Zwalelo zwa-3D zw Zume Zuma zu ZTEST Z-Soft zo60 Zipululani Zimbabwe Zigizaga Zhuyin ze YYYY-MM-DD YY-MM-DD YunitsidzireKhaOdara YunitsidzaTshitoko YunitsidzaOda YunitsidzaDzireTshitokoni yunitsi yunithi you yo-on yongo Yn y=m^x YMD YIELDMAT YIELDDISC YIELD Yi Yemeni YEARS YEARFRAC YEAR y=b*m^x yazwo yavhuḓi yavhudi yavho yashu ya-kha-tshamonde ya5 ya-3D XYZ XY xsltfilter xsltdialog Xrumelea XPM XNPV XMveleleKhinifhadza XMutaladziKhinifhadza XML-iCalendar-Faela xls Xkana XIRR Xes xelaho xedzi wrtsh WORKDAY WordPerfect wone ṄwNziNyedz wizardname Wizadzi Wiselani 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 Win Wido wi ṅweṅwelaho Westerni Western Weierstrass WEEKS WEEKNUM WEEKDAY Webuthopho webusaithiyanga Webtop wea ḽṅwe we wazadi waVhukhaki wanuluseaho wanulusea waniwaho waniwa wananitshigwada wananiḽiṅwalwa ṅwana Ḽṅwalwa waluswaho ṅwalulula ṅwaliwaho ṅwaliswa ṅwalisiwa ṅwaleli ṅwalela ṅwalanganṱha ṄwahawaNzivhanyedziso ṄwahaBveledz W4W vyu vusuludzwa VunḓuḽaShangoḽoLivhiwahoa VunḓShangLivhiw vuliwe vuliwaho vule Vulawindosi VulaGL vuelaho VRML VLOOKUP Viyolethe Viwa VIM viewer Video via vhuṱûanzi Vhutumani VhutshilovhuDiphirishiethaho VhutshiloDiphiris vhuthihi-uya-kha-vhunzhi vhutevhelaho VhutanziVhuhulwane vhutanziE vhutanzi1 Vhutala vhuswikeleli vhuswaX Vhusumbe Vhurwa-Vhukovhela Vhurwa-Vhubvaḓuvha Vhurathi vhuṱranzi vhupuli vhuponi vhuphara-hofhelelaho vhuphara-hahafu vhuṱolamupeleṱo Vhuṱoḓisisi vhuṱnzi vhunzhisa vhunNṱha vhuna vhumveru vhumbwa Vhumalo vhulungwiwe vhulungwi vhulungwe vhulingwaho VhulapfuNgaHoṱhe VhukwamanikhaNzwalelo Vhukwamani Vhukwae-ha-Tshibveledzwa vhukhaki vhukhakhai vhukanya Vhukalefhali VhuimoY VhuimoX vhuimo-ha Vhuimoc vhuimo1 vhuḓiimiseli Vhuḓifhinduleli vhuḓibuli Vhuhulu vhuelwa vhuelela vhuela vhuedzedzwea VhudzuloniNgaHoṱhe Vhudzivha vhudziswa vhudzisiwa Vhudzisani vhudzisa vhudanzi vhudalo Vhubvaḓuvha vhuṱanziY vhuṱanziX vhuṱanzivhuswaX vhuṱanzilushaka VhuṱanziB Vhuṱanzi1 vhuṱ±anzi Vhuṱanu Vhuṱala Vhuṱahe vhoniwa Vhongwaniwapo vhofhelwa vhofhekanywaho vhofheaho Vhofhani vhofhaho VhkwmnNzwal vhkando vhigiwaho vhidzwa vhidziwa Vhiḓa vhetshelwaho Vhekanyahafhu Vhegeyamushumo vhayo vhatsivhudzi vhatikedzi vhathetshelesi vhare vhapfe vhanzhi vhangaho vhandekanaho vhambelaho Vhambani vhambadzwa Vhambadzani Vhalululani Vhalulula Vhalidzi vhaleliwa VhalelaNgayoṱhe Vhalela2 Vhalela1 vhalei Vhalavhelesi Vhalanifhedzi Vhadzheneleli Vhabebi Venezuela Venda vekithara vekhitha Vectoriziwaho VDB vCard vCalendar-faela vartheta varsigma varrho varpi varphi VARPA varepsilon VARA valwa valiwaho vah va v uyo ḒuvSwik uvhu ḒuvhMbadel UvhanaNdindakhombo ḒuvhalaMbadelo ḒuvhaḽauThoma ḒuvhaḽauTholwa ḒuvhaḽauSwika ḒuvhaḽauFhedzisela ḒuvhaḽaufhedzaḽaKhiredithikhadi ḒuvhaḽaRizev Ḓuvhaḽamabebo ṱuṱuwedzwa Ṱuṱuwedzani Ṱuṱula ṱutuwedza ṱutshele UTF-8 UTF-7 USERNAME Uruguay URL2 ḓura UPPER Upima uṱola Union undo ṱunde Ṱundani Ṱumululwa Ṱumululani ṱumiswa ṱumetshedzwa ṱumekanywaho ṱumanyulula Ṱukufhadza Ukrainian Ukhuthani Ṋukadzulula UK uiview uho UAE tYo twiteṅwa TWAIN tusa Turkey tundiwa tundea Tundani Tumululani tumiwaho tumetshedze tumbulwa tumbula tumanyiwa tumanya Tumana tumakanya tukufhadze Tufu Tu TTEST Tswititi tswayongangaredzo Tswapula tsuvhudza tsumbavhuyo tsumbandilathukhu Tsumba Tsmbanḓila tsivhudzwa tsiḓufhala Tsitselani tsireledzwea tsireledzwaho-ngaphasiwede tsireledzululwe tsireledzulula TsireledzoyaNdeme tsireledzdo tsireledzaho TsireleddzoNdem tsinisi tsime Tsimbi tsi Tshunisia TshumTsheledzo TshumManyoro TshumisoyaTsheledzo TshumisoyaTshelede TshumisoyaManyoro Tshumbelo Tshorokii Tshizaka Tshiyukireniani Tshiwelishi TshivhZwinepe Tshivhumbi tshivhulungi Tshivhudzo TshivhRizev Tshivhoni TshivhlTshumelo TshivhlDzhithirekhe tshivhambanyi TshivhalotshoRizeviwawo TshivhalotshaZwinepe TshivhalotshaTshumelo TshivhalotshaDzithirekhe Tshivhaloi Tshivhala Tshivhal Tshiuzubeke Tshiuzibeke Tshiunḓiwa Tshiṱukuṱuku tshitukusa tshituku tshitshisana Tshitopana Tshitirakitsha Tshiti tshithinga Tshiteṅwana tshitewa Tshitelegu Tshitekeniki Tshitatisitiki Tshitatammende tshitatamende Tshitata TshiTamil Tshitaliana Tshitakalelwa Tshitaela!n Tshitaala Tshiswedishi TshiSwedish Tshiswaya Tshiswai TshiSpanishi TshiSpanish TshiSlovak tshisiwana Tshisindi Tshisilovenia Tshishumswa Tshishumiswea tshishanduli Tshishanduki Tshisedzulusamupeleto Tshisedzulusamupeleṱo Tshisaradinia Tshisankiriti Tshisaintsi Tshisadzi TshiRussia Tshirumelwa Tshiromaniani Tshiraethoromentsi TshiPunjabi TshipTshireh TshiPortuguesi Tshipopola TshiPolish tshipitshi Tshipirinngi TshipiḓatshaShangPhurovint TshipiḓatshaShangoKanaPhurovintsi TshipiḓangaTshoṱhe tshipeshala Tshipenisi Tshipembe TshipeisitshireHone Tshipeisi Tshipeinishi Tshipḓa tshiothomethiki Tshiosithani TshiOriya Tshiṱolamupeleṱo Tshiṱolamupeḽeṱo tshinzhi TshinyTshelMuthngaMuth TshinyaleloyaTsheledeMuthungaMuthu tshinyalaho tshintsha Tshinowedzhiani Tshinonimubvumo Tshinna tshingani Tshinepe Tshinanga tshimiwa Tshimbilaho tshimbidzwa Tshimayalami Tshimarathi Tshimaori Tshimanipuri Tshimakedoniani tshilwa TshiLuxembourgo tshilulamisamupeleto Tshilogeni TshilMuhwal tshilikadzi tshilengo TshilemetshaMuhwalo Tshilavhelesi Tshilativia Tshilatini-1 TshiLao Tshila tshikweruthu Tshikonkani Tshikolo tshikiriputu tshikiputi Tshikinyarwanda Tshiki TshikhtshoTshimbilwaho tshikho TshiKhmer Tshikhaulasiaṱari Tshikhathalani TshikhalatshoTshimbilwaho TshikhalaLaini Tshiketshe TshikeShngVund TshikepetshaShangoKanaVundu Tshikannada TshikalotshauOda TshikaloTshauOd TshiJapanese Tshiitwa-OLE Tshiitopia TshiIrishi Tshiindonishia TshiimtshaMuraḓo TshiimotshaMuraḓo TshiimoMbinganoni TshiimMbingan Tshiimimiswa tshiḓiimiseli TshiHungaria tshihumbulwaho TshihumbelwaNgatshoṱhe tshihorizonthala TshiHindi Tshihevehru Tshihangulu TshigwadDzina tshigwaday tshigwadax TshigwadaID TshigwadaDzina Tshigumuki TshiGujarati TshiGreek Tshigalishiani Tshigaliki TshifSwik TshiFinnishi Tshifhungudzi tshifhnganyana Tshifhinga-Tshithihi TshifhingatshauThoma TshifhingatshauSwika TshifhingatshauFhedza TshifhingatshauDzhiwahaMuhwalo TshifhingatshauDzhiwa TshifhingatshaTsumbambadelo TshifhingatshaRizevesheni TshifhingaTshaNdugiselo TshifhingatshaEkisaizi TshifhingatshaEkisaiz TshifhingaRizeve TshifhingaNdug Tshifhelisi Tshifhaṱuwo Tshifhaṱo Tshifhambano Tshifhadzo Tshifhadi Tshifasi Tshifaruse tshifaro Tshifani TshiEuropean TshiEstonia Tshiesipiranto tshiṱepisi tshiṱepe tshie Tshidzongikha tshidzivhiswaho Tshidziki Tshidzhodzhia Tshidzhidzhia Tshidzheometiri Tshiduna Tshidivehi tshidindi Tshidevanagari Tshidatshi TshidaiḽI Tshidadzisi TshiCzech TshiCroatia TshiChaina TshibveledzwaID tshibuli TshiBulgaria Tshibosinia TshiBelgia Tshibaskiu Tshibailorashiani Tshiazabejani Tshiazabajani Tshiayirishi TshiAustria Tshiṱarata TshiAmerica Tshiamenia Tshiambi Tshialibania Tshiaisilendiki tshiḽaidi TshiṱafuTshiṰoḓeaho TshiṱafuTshiṰoḓ tshia Tshevuroni tshenetsho TsheledMbadel TsheledeyotheineTeauBadelwa TsheledeyoShumiswaho TsheledeyoShum TsheledeyoSalaho TsheledeyoMbadelo TsheledeyoDzheniswaho TsheledeyoBviswaho TsheledeyoBadelwahoPhanda TsheledeyoBadelwaho TsheledeyaPuḽedzhe TsheledeineyaTeauBadelwa TsheledDzhenisw TsheldyaPuld TsheldBviswah TshelBadelPhan tshee TshedzaTshiṱoḓeaho TshedzaṰoḓ Tshaulla Tshau-ḽa-uya-Kha-Tshamonde tshṱaraṱa tshapo Tshanelani TshandukongaYoṱhe Tshakhoulu Tshakhau Tshakhala tshḓaho tsh Tserakana tselaho TRUNC Trinidad TRIMMEAN TRIM TREND Trapezoidi TRANSPOSE TRANSACTIONLOG Tothesheni TOTAL Torus toolbox toolbars toliwa toḓea Todisisani tode TODAY todani toḓau tiwaho TITEL TIS-620 tinyiwa TINV TIMEVALUE Timatimiwaho tikedze Tibetani thyimu thwipi Thuḽubaa Thuthuni thuthubaho thuthu Thuthiwaho thuthea thuthe thusedza thusaho thumetshedzo thukhuuwa thukhusa thuga thubuḽu Thsigerika thothalagute thomulule Thomulula thomiwe Thomisa thoma-vho thomangayothe thomangayoṱhe Thomahafhu Thoh Thofundenna thodea thivhelwa thithisea Thireyi thireshiholdi thirasiparentsi thimbwana thevhekano thetshelesa thetha thesauresi Thero2 Thengiso thempuḽetheyaAdzhendayanga ThempuḽethedzoṰunḓiwaho Themplethe themphuḽete Themphuḽeithe ThemphṰod ThempheretshaiṰoḓeaho THEME Thekiḽolodzhi thekinoḽodzhi thekinolodzhi Thekhwesi Thekhweisi thekhinolodzhi thekeniki thege ThebuḽuYanga thebu thasululu thaphudzoya thangela Thanganyiso thanḓavhudzo thalusaipfi ThaitiliyaAḽibamu Thaiphifesi Thaiphifeisi thaipha
* Build: everything - build structure setup for Venda * Release version 20060706 dict-ve-20070206.orig/ve/COPYING0000644000175000017500000006347610562150176014410 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-ve-20070206.orig/ve/CREDITS0000644000175000017500000000017210562150176014355 0ustar dokodokoDwayne Bailey Creation of the Venda build framework Translators of OpenOffice.org and Mozilla dict-ve-20070206.orig/ve/Makefile0000644000175000017500000000117110562150176014775 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=ve LANGNAME=Venda LANGNAMELOW=venda 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=UTF-8 include ../utils/Makefile.language dict-ve-20070206.orig/utils/0000755000175000017500000000000010562173203014057 5ustar dokodokodict-ve-20070206.orig/utils/configure0000755000175000017500000000476110562150175016001 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-ve-20070206.orig/utils/README.myspell-mozilla-xpi0000644000175000017500000000044110562150175020670 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-ve-20070206.orig/utils/install.js.in0000644000175000017500000000172510562150175016500 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-ve-20070206.orig/utils/munch.c0000644000175000017500000005112010562150175015337 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-ve-20070206.orig/utils/README0000644000175000017500000001036710562150175014751 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-ve-20070206.orig/utils/unmunch.c0000644000175000017500000003021110562150175015700 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-ve-20070206.orig/utils/Makefile.language0000644000175000017500000001543510562150175017314 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-ve-20070206.orig/utils/munch.h0000644000175000017500000000461610562150175015354 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-ve-20070206.orig/utils/proc0000755000175000017500000027234010562150175014763 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-ve-20070206.orig/utils/unmunch.h0000644000175000017500000000267610562150175015723 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-ve-20070206.orig/utils/hunmunch.c0000644000175000017500000005127510562150175016065 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-ve-20070206.orig/utils/hununmunch.c0000644000175000017500000003074110562150175016423 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-ve-20070206.orig/utils/csv2acor.py0000755000175000017500000000676710562150175016201 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-ve-20070206.orig/utils/hunmunch.h0000644000175000017500000000461510562150175016066 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-ve-20070206.orig/utils/README.aspell0000644000175000017500000000025410562150175016222 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-ve-20070206.orig/utils/Makefile0000644000175000017500000000053410562150175015524 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-ve-20070206.orig/utils/.cvsignore0000644000175000017500000000001610562150175016057 0ustar dokodokomunch unmunch dict-ve-20070206.orig/utils/hununmunch.h0000644000175000017500000000267510562150175016435 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-ve-20070206.orig/utils/munch0000755000175000017500000004566010562150536015136 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-ve-20070206.orig/VERSION.aspell0000644000175000017500000000000510562150176015245 0ustar dokodoko0.50