dict-tn-20070206.orig/0000755000175000017500000000000010562171657012741 5ustar dokodokodict-tn-20070206.orig/tn/0000755000175000017500000000000010562173203013347 5ustar dokodokodict-tn-20070206.orig/tn/aspell/0000755000175000017500000000000010562173203014627 5ustar dokodokodict-tn-20070206.orig/tn/aspell/doc/0000755000175000017500000000000010562173203015374 5ustar dokodokodict-tn-20070206.orig/tn/aspell/doc/Crawler.txt0000644000175000017500000000405610562150025017536 0ustar dokodoko NOTES ON THE CONSTRUCTION OF THE WORD LIST A preliminary version of this spell checking dictionary was assembled with the help of my web crawler "An Crbadn": http://borel.slu.edu/crubadan/ BUILDING TEXT CORPORA FOR MINORITY LANGUAGES Initially a small collection of "seed" texts are fed to the crawler (a few hundred words of running text have been sufficient in practice). Queries combining words from these texts are generated and passed to the Google API which returns a list of documents potentially written in the target language. These are downloaded, processed into plain text, and formatted. A combination of statistical techniques bootstrapped from the initial seed texts (and refined as more texts are added to the database) is used to determine which documents (or sections thereof) are written in the target language. The crawler then recursively follows links contained within documents that are in the target language. When these run out, the entire process is repeated, with a new set of Google queries generated from the new, larger corpus. EXTRACTING A CLEAN WORD LIST The raw texts downloaded using the scheme just described contain a lot of pollution and are unsuitable for use without further processing. I have been able to extract reasonably accurate spell checking dictionaries by applying a series of simple filters. First, the texts are tokenized and used to generate a word list sorted by frequency and the lowest frequency words are filtered out. Then, depending on the target language, correctly-spelled words from one or more "polluting" languages are filtered out to be checked by hand later. Usually this means English, but I also filter Dutch from the Frisian corpus, Spanish from Chamorro, etc. The remaining words are used to generate 3-gram statistics for the target language. These are used to flag as "suspect" any remaining words containing one or more improbable 3-grams. Please contact me at the address below if you are interested in applying these techniques to a new language. Kevin Scannell March 2004 dict-tn-20070206.orig/tn/aspell/info.in0000644000175000017500000000062410562150025016111 0ustar dokodokoname_english Setswana lang tn author: name Kevin P. Scannell email scannell at slu edu maintainer true author: name Thapelo Otlogetswe email Thapelo.Otlogetswe at itri brighton ac uk copyright GPL version {VERSION} url http://borel.slu.edu/crubadan/index.html source-version 1.0 charset iso8859-2 special ' -*- - -*- ` -*- soundslike generic alias tn setswana tswana dict: name tn add tn dict-tn-20070206.orig/tn/aspell/Copyright0000644000175000017500000000167610562150025016531 0ustar dokodokoaspell-tn: Aspell dictionary for Setswana Copyright 2004 Kevin P. Scannell and Thapelo Otlogetswe See the file doc/Crawler.txt for information on how the word list was created. 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., 675 Mass Ave, Cambridge, MA 02139, USA. dict-tn-20070206.orig/tn/myspell/0000755000175000017500000000000010562173203015034 5ustar dokodokodict-tn-20070206.orig/tn/myspell/README_tn_ZA.txt0000644000175000017500000001132610562150026017626 0ustar dokodokoREADME for Setswana MySpell dictionary ====================================== The MySpell spell checker was created from the aspell spell checker and wordlist which is released under the GPL. 1. Copyright 2. Installation and setup 3. Helping to improve the spellchecker 4. Note on the construction of the wordlist 1. Copyright ------------ Setswana wordlist.in licensed under the GPL: Copyright 2004 Kevin P. Scannell and Thapelo Otlogetswe Porting to MySpell and other MySpell specifics licensed under the LGPL Copyright 2004 Zuza Software Foundation 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., 675 Mass Ave, Cambridge, MA 02139, USA. 2. Installation and setup ------------------------- Automated --------- http://lingucomponent.openoffice.org/download_dictionary.html Use the DicOOo.sxw file to step you through an automatic install process. If the Setswana spellchecker is not available online then download the offline pack from: http://translate.sourceforge.net/ Non-automated ------------- For instructions on how to install the Setswana dictionary please visit the following URL. http://lingucomponent.openoffice.org/download_dictionary.html#installspell Spellchecker Selection ---------------------- NOTE: Setswana is as yet not a recognised language in OpenOffice.org - this will change shortly - therefore we map the dictionary against Italian. Tools -> Options -> Language Settings -> Writing Aids Available language modules -> Edit -> Select Italian -> Ensure it is enabled 3. Contributing --------------- You can help to make this software better. If you find errors in the spellchecker or have wordlists that you would like to contribute to the spellchecker then contact Dwayne Bailey If you would like to assist Kevin Scannell with the automated web crawler then please read the next section and offer your assistance. 4. Note on the construction of the wordlist ------------------------------------------- Note: taken from the Aspell package (doc/Crawler.txt) for your information NOTES ON THE CONSTRUCTION OF THE WORD LIST A preliminary version of this spell checking dictionary was assembled with the help of my web crawler "An Crúbadán": http://borel.slu.edu/crubadan/ BUILDING TEXT CORPORA FOR MINORITY LANGUAGES Initially a small collection of "seed" texts are fed to the crawler (a few hundred words of running text have been sufficient in practice). Queries combining words from these texts are generated and passed to the Google API which returns a list of documents potentially written in the target language. These are downloaded, processed into plain text, and formatted. A combination of statistical techniques bootstrapped from the initial seed texts (and refined as more texts are added to the database) is used to determine which documents (or sections thereof) are written in the target language. The crawler then recursively follows links contained within documents that are in the target language. When these run out, the entire process is repeated, with a new set of Google queries generated from the new, larger corpus. EXTRACTING A CLEAN WORD LIST The raw texts downloaded using the scheme just described contain a lot of pollution and are unsuitable for use without further processing. I have been able to extract reasonably accurate spell checking dictionaries by applying a series of simple filters. First, the texts are tokenized and used to generate a word list sorted by frequency and the lowest frequency words are filtered out. Then, depending on the target language, correctly-spelled words from one or more "polluting" languages are filtered out to be checked by hand later. Usually this means English, but I also filter Dutch from the Frisian corpus, Spanish from Chamorro, etc. The remaining words are used to generate 3-gram statistics for the target language. These are used to flag as "suspect" any remaining words containing one or more improbable 3-grams. Please contact me at the address below if you are interested in applying these techniques to a new language. Kevin Scannell March 2004 dict-tn-20070206.orig/tn/myspell/tn_ZA.aff0000644000175000017500000000160510562150026016525 0ustar dokodoko# tn_ZA.aff - Tswana (tn) affix file for use in myspell # # Copyright (C) 2004 Zuza Software Foundation # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # SET ISO8859-2 TRY aeoltgnsikbmwhrdyfupjKMBAGOTDLESFNPRIJYH-WvCUVQXzxqZ dict-tn-20070206.orig/tn/wordlists/0000755000175000017500000000000010562173203015401 5ustar dokodokodict-tn-20070206.orig/tn/wordlists/wordlist.openoffice.in0000644000175000017500000015512310562150027021722 0ustar dokodoko# wordlist.opeenoffic.in - Tswana (tn) words extracted from the # translations of OpenOffice.org # # Copyright (C) 2006 Zuza Software Foundation # # Some words that were found have been expanded to cover plurals, # etc. Capitalisation has been validated. # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # e go ya o ga le ka a palo mo kago mokwalo di boleng se tsa Version package mola kwa tsenya phoso tse setlankana sediriswa batla po faele leina lefelo phimola tatelano fa tsamaiso ke tshupetso kgolo wa tafole jwa godimo maemo mokgwa tswa nako tsebe kwala dipoelo setlhogo kgotsa sa bogare kopo tlase tsotlhe tiro pele jaaka moja gape ZONE YEAR-MO-DA Report-Msgid-Bugs-To NAME MI LANGUAGE HO FULL kgone dipalo didiriswa bogolo molema kgetha letlha na kholomo mofuta nngwe simolola kgona tla la dikwalo dira ARG1 setlhagisi mela bontsha morago ntle jaanong ntsha boloka bala latelang disele fela template dirisa didiragatsi dikgetho mafelo baakanya ntlha kgetho boalo matseno bofelo kageletso thulaganyo axis mmala listi tshwanetse tsenyo pulophatlha kgaoganya ditlamorago patlo letlhare diteng bophara tlhakanya sele phatlalatso gatisa modirisi dintlha bobedi karolo temana moralo tlwaelo sediragatsi phetolelo gago tshwantshanyo setse tshimologo tsamaisa jo chate rulaganya tlosa motswako gare dipeo bar X tsamaisomolema tsamaisomoja mekwalo thaepa bopa thomelogare teng tekanyo pontsho bo palofatso dikholomo thata kopanya ditlankana baya y tima thuso kgolagano tshwanetseng fetileng moriti fetolela tlhalosa molantle gore baakantswe ntshetsontle nnye modiro diphetogo openoffice fitlha tswala puo busetsa boemo balwa aterese yona bona sekai nang laisa Kgorogo kgogelothoko html fetola tshedimosetso setlhopha ponagalo molelwane lemorago tswelapele tlhwatlhwa tebo dingangisano tlhagelela romela pego mekgwa lefoko kgethilweng degrees bonnye Url tshekeletsa ngwaga tsela setshwantsho dingwe tswaya tserwe org konego fetsa bula boleele taolo kona tlhola segatisi nnete tsena motheo kgonagalo ditiro difaele sepe kwalo bonwa khoutu bogodimo tobetsa peo buka tlatsa segolaganyi poeletso phatlha palogotlhe lerumo kakaretso c khutlonne automatically tshwanang tiisa none ngongorego molaetsa matshwao letsatsi generated dikago mokgweetsi microsoft maina lolea java Excel esadireng tebaganyo puisano lekana konopo fokopheto jalo tshuma tlhaola tlhaloso segopotso s mokwadi lenaneo ditafole dinako botlhokwa beilweng tswelopele tsentswe tiragalo sobokanya sefepi ntlhakgolo moo meto kopisa kgolaganyo kgaoganyo ditsebe dikolo bolokwa bofelong tuelo pharologano modumo mafoko copyright vor tlhakatlhakano menu mebala kemedi g botlase bobi xml taelo OLE letlharephatlalalo lefela koketso kgatiso internet Ngotla magareng lesedi lengwe leba kgethegile fokotsa feta eya dumela ditlhogo dinamane dikolosa bontsi tlhamo ntlhapheleletso molaodi Lekanya kopanyo kamogelo fetolelwa dikgolo tikologo src setshaba phetso Lebokoso Ditlhaloso dire bophelo tshwaragano tshuba tota tlhopha tekanyetso sekgaoganyi sekale mefuta letshwao gotswa DDE bonako bojaanong z matlhare leng gae dirang dileibole bulwa bitmap TsamaisoMolaodi Tsamaisokago tlhalositsweng tlhagisa tlhagelele thubego thuba pheleletso nna MS melelwane kolo inc Hangul goga bit ba amogela ageletsa tshwaya tseo toolbar tlhokega tlhagiso tikoloso Spanish raya phokotso MB malatsi kopantswe hyperbolic Err ditiragalo dikgogelothoko boikgethelo beta uropa tsenngwa tlhokomelo tlhokegang tlhageletse thubo tema tatealno Sql pdf n mongwe kgonege gale dumelela ditshupetso dirisetswa tshimologong tsentsweng tlhakanyo tlhagelelang sete peeletso naya mogala kgethegileng inverse golaganya ditatelano diriswa diragetse bonweng boeletsa teko siana setlhagiswa Searabia poloko netefatsa library lemoga l fosagetseng fomo fax ee ditshwanelo ditemplate dialog botala tshwaelo tshobokanyo tlhoka tiragatso Thoko thalela senya senotlelo Sekwadi seka pedi paakanyo ofuta nepagalo leibole kgwedi imeili gonne filweng dituelo dirwa diphetolelo Chinese bopiwa baakantsweng tshireletso tlhalositswe tiile seng sebatli SeAsia regression Powerpoint peresente otlhe oketsa ntse Moseja mojeng kgetse dumeletswe dirolola dikgolagano dikarolo Bophirima bonthsa atelano XX tumelano tshwara tshwana tshupetsong tsamaiswa thala Sireletsa setlankaneng nyeletsa metswako lemogwa legotlo kgomaretsa kgethilwe kgatlho i gamma foldara farologaneng English DOS dikgwedi dikageletso busediwa botho bomorago angle uniti tsona tshegediwa tseno trademark Tlhokasetlhogo tebagano siame sekao R phimotswe phapogo okwalo nalediKgatlho nakwana mopeleto MokwaloMolaodi mediro matlhabaphefo marumo Macintosh lekwa kwalotiro kwadiso kw khutshwane ithaliki fosagetse fedile ebe ditsamaiso ditlhagiswa diski boyona bontsho bolokilwe yotlhe www tshwaraganokgolo tshwantshanya tshegetso temogo tekano solofetswe Solaris sireleditswe sekaing romelwagare pv potla polygon ona nthsetsontle Nper network Naledisekwadi meralo logical letlhabaphefo legodimo keletso Godisa gana ditlhaka ditemana ditaolo diragala diphatlha dictionary CJK baana apole vnd tlhagiswa tlhaga tiriso thuto tharabololo tala StDev StarCalc Ntshafatsa NalediMoralo mopeletotlholo molemeng moago misc maatla lefokopheto latlhela konokono kgontsha kgodiso kgobakanyo jaka ise gabedi fitlhilwe emetseng dlg ditlhakakgolo dirilwe dikai boteng boikhutso bohibidu batlang tsiboso tsamaisanang thomelo templates tempalte StarDraw software romelwa phimolwa okeditswe Nepagetsemopeleto nepagetse ne metlha matlha lekwalo lebelela laesense kopano Khona khalendara kgololosego id golo godingwana file fedisa f ditshwaragano ditlhagisi dirisitsweng dirilweng dipharologano dikgaoganyi Dibrackets Cyrillic bosweu bone bokamoso boi ARG2 application aga wisa tshwaraganyo tshwaraganya tsamao ts tloswa tloso tlola tlhama tlhago tlaleletso thusa thulano tatelanong T sotlhe skrini senotlolo sengwe sdi rometswe phokoletso p nthsa nolofaditswe naledi motsamaisi mokwaloX mogo modiragatsi meili matsoketsoke mathata lesika lekane laiswa khibidu kgobakantswe kgatlha kabo JRE interger Inso ftp ditsenyo direng dipatlo dikhutlonne dikgang buseditswe bonwe bontshwa bongwe baakanngwa ago zip Word tsenyeletsa tmp tlisa tlhabaphefo tlatswa tirelo the Templatetsela sun StarImpress simololwa setseng sefatlhego pusetso Phutolola phologelo Phofokhutshwane pakilwe ofisi nnwe NalediPalo nakong mokwaloY Mfuta mabedi lekaneng lefelong leano Latin kopa kgato kgarametsa kgale kagisano Hanja Gogelathoko FV Fofela farologane esaitsiweng eo ditraele dithubego dirisitswe dilisti dikopo decimal bothata bonagala boela beke b areka vector v uno tshegetse tsaya tlwaelegileng tlhaolo tlhaloswa tlhalosang tlhagisitswe tlaleletsa Thesaurus Tebogape tangent skrola sine sethaledi Seroma sephuthelwana sekoloto Sefora poso popo polaka parameter ola OK NalediOfisi motlhala mokwa metafaele meta math m log listing letlelela lentle kwantle kgatlego kemo karabo jang itse ikgatholose hexadecimal gotsa gaufi Fofisetsa fetotswe felela ema Ditikologo dithuso dipyramid dintlhannye dingongorego dicone CR cosine clipboard chatr Bessel beilwe be bala-fela alphanumeric akgona video tshwao tshegetsa Tsharaganokgolo tsennwa tsenang toolbars tlwaetsa Tlwaelegile tlhakakgolo tletse Thibela Thai telele taelong tab stardivision Sejapane Seheberu sefetoledi rileng Rala ponagatso phofo phenshini pharologanyo pampiri of Nyaya notlela nne ngangisano neng Mozilla mmepennye mmele Mepakwana mahala logathrium lekhubu lekanang lefatshe Lebisa laser khupono kganetso kaya karolwana kalega kakanyo k golagantswe gatisitswe feditswe faeleng elela ele DPI diuniti ditlhopha diphoso dikonopo dikonego dikologa dibeke cursor chi botshelo bototshwaragano Botlhaba bosetlha bonagalang bitsa batlilwe balwang arerese alo all US ura tshwaobuka tshwane tshekeletseng tsed tlholo Tlhamalalo timile timetsa Thulanya tamaiso tafoleng syntax SVsd1 Sutisa SQL92 simolole setso seo SeJeremane SeGerika RTF rata putswa ponyo phimolo PC parameta palette Optimal oo online ntsi ntshetsantle Ntlhatshobakanyo netefatso nepagetseng nale motsotso mosha moleng modi mm mkwalo Microsystems metric mepe matsalo lingu lemogilweng leka lebota lebagane kwalwa khutswafatso kgolwane kgobakanya kgeleke kgatelelo Kgaola Kametlha kai kagong JIS ISO International ii Hauspie gotsona foromo for filwe fediswa exponential Env enke ena emisa emetse Electronic dumelana duetswe dll ditshwantsho ditshwantshanyo ditshwaelo ditshekeletsa ditsela ditekanyo diriswang dirisegang diragatswa dipalogotlhe dintsi dinotlelo dinmane dingwaga dikologwa dikgatelelo diidriswa Difepiwa degree datefunc contangent classes chanele busetswa Bonakotshimologo bolng bewa Bakanya badirisi asia applet app Ala agilwe XSLT XP Weibull Var u Turkish tulo tsia tshwanela tshiamiso tshesane Tshaya Tsharaganya Tshameka tsewa tsamaisong tsamaisano tsamaisana toropokgolo tokafatsa tlhatlhamolola tlhaolwa tladitswe Tirafalo timetse thulagano thubega Thatetsa Thalosa thaele templatr SvThala StarOffice sona Simololagape setlhogonnye setegeniki sentle SeKorea sekgala seipone segolo segatsisi sedriswa RAM ralela pulophatla pulo ponthso PMT pixels phitlhelelo phetolo phatlalatsa phatlalato phaposi PeleKwalo palokarogano paka OS Odiragatsi ntsifatso ntsho no netefaditse Neo nakotshiano mokwalo1 moja-go-molema Modirisi-tlhalositswe metsotso matshwaro matsatsi mananeo makwalo maemong MAAKA logo logathrim lhakanya legae Lebelo lebaka Kwalokgolo kwadisa khutlotharo khataluku kgweetso kgwagetsa kgonang kgonagale kgethwa Ketopele katamelano Kagotiro kagego jwatatealno janong itsiweng iii HTTP HOST Gnome Gatelela gao etela esatlhaloswang esalekaneng esa e-mail el Dumetse dumelelwa duelwang duelang dt ditlolo ditlhakanyo ditemplates dirololwa dipuisano dipontsho Dipalopalo dinopolo dikologilwe dikgatiso dikete digatisi dichate CTL Corporation cache buswa boraro bopang Bonya bontshitswe bonolo bonagale bolokilweng bleng bézier bega aya Arabic Adabas YY XSL xlt wena wala VBA VarP usa tumelo tsweletsopele tswela tswang tshwaragana tshwantseng Tshekeletsannye tshegetswa tshanetse tsentseng tsanmaiso tsamasomoja TsamaisoTekanyo tsamaisonnye TsamaisoMofofisi tsamaisoKgaoganyo tm Tlhopholola Tlhakanya-gare tlhakannye tlhagisitsweng tletseng tirokgolo timilwe tiisitse thusego thalelo Temoso tekatekanyo Technologies TARGET Tabs ta SVsa1 supetsa ste StDevP StarWriter Spline SP source skena sireletse sirelediwa sireleditsweng sianisa shupetso shiti setshantsho setsenyi setlahgisi setlagisi setennye Setekgolo set sesupi Sepotokisi sena sedirisi rot13 ropa romelagare rights reserved re putso pot pono poelo pLAO pi Phos Phologo phela phatlholo phaepe Palelo Oterro oka ODBC nyelelo nominal Netscape motsotswana molema-go-moja mokwlo mokwalong Mofofisi modiriis metsotswana Metafile Mepennye me mapi libraries Lfelo Letlharephatlalatso Lernout lereo lelel lebala Lebagape Lebaganya lebagana LDAP latlhegile latela laola Labola kwadilwe kpo Konegile kokobetseng kokobala kitsiso Khutswafatsa khunou Kgrtho kgotsofalo kgoreleditswe kgonneng kgonego kgonegang kgonega kelelokgolo kelelo katakana Karoganyo itsiwe isa interval Inafatsa gongwe gololosegile golagana gi gatiswa gatisitsweng Fopholetsa fitlhelela Fetsadintlha fetolwa FenyaLefoko Felopontsho fedisitswe fao faee euro etsa eseng esafelang Enfolopo eletswang efetileng efelo ea Duela draw Divsor Ditube ditswelopele ditoolbar Ditlhakannye ditlaleletso ditiragatso ditifikeiti Ditempaltes dirisiwa dipuo Dipitsontle dipe diparameta dintsha dinnye dikopanyo Dikoketso dikgato dikgarametso dikgaoganyo dikemedi difomo dibukatshwao Diaxes desktop degreeskgololosego Default CorrectSpell cookies Catalog calc butswe bosesane Boolean Bommamoratwa boima Bogela Bobedi-mola bobdi bisinisi binomial bakgweetsi B6 B5 B4 araba ao amogetswe Alien akopo Ac aa 3D yo xl wisang web w VALUE URL1 Urdu Turquoise tswewa Tswetse tswerwe tswelepele TswayaKago tswalwa tsw tsmaiso tshwragano tshwanetsweng tshwanelwa Tshupo tshupeso Tsholola Tshipi Tshelaganya tshdimosetso tsenyeleditse tsenye tsenngwe tsenngwang tselapele tselakhutswane TsamaisoTlatso TsamaisoNepagetse TsamaisoMopeletotlholo tsamaisomlema Tsamaisomeili tsamaisitsweng Tsabotsalo trele tlotswe tlositswe tlhakantswe tlhakanngwa tlhakakemedi tlhagelelo tlhageleleng tlha tlatsabitmap tlahgelela tirisanommogo TIFF thiko theta Thaletswe tetlelelo Tempaltes tekatekano tatelanox tasmaiso symbol Switzerland SWF Svx Suffix solofelwang snap skai simolotswe Silindara shekeletsa setshwantso Setshwai setserweng setlnkana SetlankanaTshedimosetso seriale senyegile sentsha sennye Sekgowa sedirswa Sediriswa-Kgethegile Sediragatswa sebontshi SeArabiki Sans sale Saena sadireng rulagantswe rona rometsweng REF rayang ratwang ratio rarabololwa Puso Pulophtla plaka Phopholetso Phonetic Phoenetic phitlho phimolwe phetogo phediso phatlah Phadisano pegong Pearson Patlisiso patlha patlalatso pao Palm paletswe pakolola or Omfolopo okgwa obe Nyeletso ntsifatsa Ntshetsogare ntlah npery notletswe nopolo nopola nomoro Nolofatsa nnang ngwageng newa new neilweng NalediThala NalediMokwadi naledikaroganyo NalediChate NalediCalc mpale Motshwaraditlhapi Mothe moreki Moleam mokwao MokwaloMofofisi mokgweng mokalo mogatla Mofuta Modirisi-tlhalositswe5 Modirisi-tlhalositswe2 Mmila mla Mkwalo2 matlharephatlalalo Marumoditlhogo maiteko Maemedi Mac-setshwantsho Mac MaatlaNtlha lw lotlhe loga list leo lemogilwe lele lekete lekanyagape lekalekana leinagape lein leeto lebilwe laisiwa Kwisaitlho kwelelo kweetso Kwadisa-nnete kopilweng kopanyokgolo Kokobalo Khutlone khoomo Kgwweetso kgwebo kgwagetso Kgrtha kgots kgosi Kgonthsa Kgolosiame kgobalagantswe kgna Kgethontsi kgatlhego Kgarametso kgano kgaisano kgaganya kgabaganyo ketelopele kelotlhoko kase karata kae JDBC Itlhaganele items is Iphitlhile io india in impress Ikgatolose Icelandic homelogare Hangu h Greek gradient gopolegang Gololosegileforomo Golola golagantsweng golagano Gogela godinwana getho getha Gata gararo gangwe Franc found fomong fokotswa fokophetho flash filter fetswa Fetsantlha fetoletsweng fetolelwang fetogile fetisitswe fetisisa fetisa fetilwe Ferikgong feletseng Fele feditse Farologanng farologana fael faeel etse eta Esaitseweng eng Encoded Ellipsoid elemente elatelang ekgolo Dutch driswang dolara dl ditsiboso dithulano Dithaledi ditebo ditebaganyo disk dirisang diretswe direkoto Dipoeo diphitlhelelo diphetso dipheleletso dipego dipaakanyo Dintshetsontle Dintlhathubego Dintlah dintla dingwageng dinaga dimeto dikologilweng dikgonagalo dikgaogano dikarolwana dife Dif dielemente diax diaterese dialogs DD dBoalo D cotangent cookie com CDE Byte busediwe bulega bukatshwao Bracketss Braces Botlhole botlhe botlhano botlalo bosupa borobongwe borobedi borataro bopilwe bontshitsweng Bontle bonthso bonnete Bonagatsa bonagape bonagaleng bolokwe bolengjwa Boleng1 bolelele bolaya bokgoni boitshepo Bogdimo bogareng boalodimo bnwa bmp bitmaps Biff5 Bezier Bayagape batlile batlakago base Bara Baltic balege bale bakantswe attelanoy atlase ARG arctangent angel and Alt akaretsa Ai ag afe Aesadireng ado accessibility abonwa zi Zhuyin zeta Zealand YYYY x-starimpress x-starcalc x-naledimoralo Xmokwalo XLs50 xi xcel Wise WinWord WinLatin website W4W violet VER Uzbek usr upsilon University UI Typography tumelelo tsweletse tswaragano tswano tswaletswe tssotlhe Tsiifatsa Tsibosa tsi tshwraganyo tshwaro Tshwarganyo Tshwarego tshwaraganeng tshwaraganakgolo tshwantshangwa tshwantsha tshwanetswe tshwanetesng tshwa tshuetso tshubilwe tshoganetso tshobakanyo tshikinyegile tshikinye Tshikinya tshiano Tshekeleditswe Tsheekletsa tshedisitswe tshao tshanang Tshana tserwre tserweng tsenyang tsentse tselopele TSEKOLOTO Tseeb tsamaisotshimologo TsamaisoTshiamo TsamaisoPatlo TsamaisoPaakanyo tsamaiso-koketso TSAMAISOKETOPELE TsamaisoBogolo TsamaisoBala tsamaisane tsamaisamolema Tsamaisakago tsamaega true traeleng t-phatlalatso Toropo toro toner Toggle tobetso tobetse tobeditswe to tlwaeo Tlotse tloswe tlolo Tlolaganya Tloaganya Tlhopolola tlhopo tlholwa tlhokomela tlhoka-thubego Tlhokasetlhoko Tlhokakgatiso tlhokagalang tlhogo Tlhodilwe tlhla Tlhatlaganya tlhalositswng tlhalos Tlhakole Tlhakano tlatso tlahlosa tlahlos Tiromofuta tirommogo tirgalo tio time Tilde thusang thulanyo thswaraganyo thswanetse thini Thimola theogetse Thekiso tharo Thapa TGA Tenya Temlate Telungu Telnet tekisuto tekanyothulaganyo tekanya technologu Tebontle tau tatlhego Tamil talo Taiso tahta tahepa t59\t t44\t Swgolaganyi swelapele Swedish SVsc1 SVG Sutela Stroke stlankaneng StarDrawDocument stardiv Stagger Spreadsheet Sphere soffice simolotsweng simololang similola sigma shele Sfx Seyalemowa Seutshetlgi Setshwi Setshwantsho-CD setlhpha setlhophadikgang Setlhogo2 Setlhogo1 Setlhgo setlhagsi setlha setlankana-sennye setlankana-nnye Sethogo Setata sesupetsi Sesireletse Seromedi Serif Serbian senyang Sentariana Senotlelopatlo Semolao Selhogo SeLatin Sel Sekirini Sekeleditswe segatsi Segatisisi sefetodi Seetebosigo Seemoc sedirisweng sedirisi-tlhalositswe seamogedi sdp scanner SBDC Save santse SANE samaisoTekanyobogdimo samaiso Sadiring Russian ROWNUM Rome rhombus rho Rethefatsa resource rekisitswe reka ReiserFS Rasterfaele rarolola RANTA ralala radix Radical radians radian python puisanong PTNUM psi presentation PPT97 popa Polymola polygons Poba Pixel pitso Pitlhelelo Pinyin phso Phs phosong phoos phimotsweng phi phatlatiro pharlogano pharakano permutations Perl peofelo Pentium PCX Parameters palothataro palontsi palong palogape palofraction Palofa palo2 palo1 pallette otlhalosang Ose Oriya omicron omega oloka Oliver Old oketsega Ojaanong office ofe OEM octal oa nwe nu ntshiwa ntshetontle ntsah ntlhaphetso ntl notlelo not Norwegian NORMDIST ngwaag NEWLINE netefaditswe Nepali nepageteng neilwe Neelano namune NalediNneteNakoMoreki mu mpkwalo mpeg motswko motswakong motshwarakarolo Mothaepo Moteng mosa Morulaganyi morti Moranang Mopitlwe montsha mona momalatsing Moletsi molememng Mola-thaepa Molafatso mokwalo2 mokgwetsi mokgwa moirisi mogopolo mogolo mogare Modirisi-tlhalositwe4 Modirisi-tlhalositswe3 Modirisi-tlhalositswe1 modiri Moamogedi mmogo Mmepemonnye mkgweetsi mkgwa Microosft Metsitshwao metrics meSQL Mekawalo meila megatla Medumo mebepennye mebedi Meago Matshao Matrix mareo mantsi Malayalm Malay malatsing maitsholo maililisti Maikitsiso magenta magare Mafokonotlelo mafela mafaratlhatlha madituelo Macromedia Macaulay mabakeng mabaka maalo ma Lwetse Luxembourg Lotus lona Lomaganya Ln lkaneng lising lib LF letsogo letloa letlhareng LetlhaNako Letlhakore Letlha2 Letlha1 letlelelwa Letlase Letlahre Letha Lephepha leoto lentsha lenout lemogwang leke Lekanya-go lekantsweng leitlho leibola Lebooso lebkoso LDX Lavender latlhegileng latelana latealng lapile lambda laisolola laesentsitswe laeborari Labole Kwalonnye kwaleng kwalela kwale kwalang KwalaDintlha kwaisa kwadiswa kwadisitsweng k-th kpantswe korela kopiswa kopantsweng Kopanokgolo konegileng Kodak koba khutswane khutswafaditsweng Khutsana khutlo khpono Khomese Kholomoar khitlonne khalendareng kgwetso Kgtha kgopolo Kgontshitse kgoneng kgonagala Kgomaretso Kgolaganyokgolo kgobalagane kgobakano kgo kgne kgine kgethong Kgatlo kgatlhanong kgatlhang kgaolwa kgaogantswe kgaoganngwa Kganya Keywords Keyboto kerning kemelo KB Kashmir karolobontsi kappa KapeleBoloka kapele Kantoro Kannada Kana Kajeno kadilwe jwatsebe Jeremane Jamo jaanog ja itumelela itshola itsegeng itlhagiso itlankana isti ISBN ira Ipoelo ipeo iota Intel InsoCorporation Insert ini inadmissable I-meili Ikopheto Ikgethile ikgatholosa ikemisetsa idrang iDkgaoganyi Idiragatswa Ichitaro hupono hulaganyo hola Hiragana himola hausepie ha Gujarati Graysekale Grayscales Grayscale gotswakwa Gopola golotswe Gogilwe godiswa goboloka GmbH Glue GIF gfolo Georgian ge GB gase garilwe gara gantsi gannwe ganeditswe Gaga Frame Fractions fraction Founu fopholeditsweng folosetsa fokopeto fokoditswe FM3-Faele Flat fitlhilweng files Fikotsa fetwa Fetotswer fetotse fetoletswe fetang feleletswa Fekse fedisiwa fedisega fedias Feae Fast FAELENTLE faele-beilwe factorial exponetial etsenang Etetswe esiame ESALEKANENGPATLO Esaitsegeng Esaistiweng esafiwang Esadiring Esabonagaleng epsilon eps Enter enngwe enkele ene eletsegang ela ekwadi ekai eka egolo Ecxel ebeilweng Dutiragalo Dutebaganyo duetsweng DTD Dpoelo dotiro dopalo Domain dkwalo Ditshupetsonnye ditshobokanyo Ditshkeletsa Ditshelete Ditsamaisonnye Ditragalo ditlhwatlwa ditlhokego ditlhagiso ditlankaneng ditirommogo ditirelo ditiego dithubo Ditema Diteko ditag ditaelo ditabs Ditab Disempole Disaitsiweng Disaetelwang disadireng dirwang Dirisitwe dirisetswe dirisetswang dirhombus diretsweng direlwa directory diragetseng Diragatsa diradians diradian dipotso dipitso diphtogo Diphologelo Dipelo dipeeletso diparmeta diparameter dipao dipalong Diopoelo Dioelo Dintlhakgolo Dinnyeditsamaiso dinamaen dimaele Dilabole dikopano dikhupono dikhona dikgeto dikemo Dikarata dika diinterger diidragatsi difepi didragatsi didirisaw didirisa Didiiswa Dictonary Dicookies dibloko dibekeng DibekeMongwageng Dibar diareka diangle diama Dia Device Denominator delta delimiter degreeskgololosego2 degreeskgololosego1 decimals DB cyan Croatian Corperation Coroperation core copyrighted coordinate control Constrast connurl config computer component Coie channel CD-ROM CD Canada C65 C6 C5 C4 by butsweng busitswe buletswe bulegile BulaGL buisa-fela B-Spline bpa bowena Botslano Botopatlo botlhofo Bothaipi both Botaki Borwa Boraro-Party bonye bontshiwa bolokiwa boloke bolkwa Bolesome Bokwadi Bokone bokhutlo bokete boikgrthelo Bogare-bophara Boemelo boeletswa boele boelang Boelamorago Bodirelo Bobedi-tobetso Bobedi-tobetsa bobed boagisanyi Bloka bin bikgethelo Biff8 beye Bengali Belgium beeletsa Bczier Bayaditshari Batsamaisi banei balega BalaA Bala2 Bala1 bakweetsi baka badiragatsi badilwegotlhe BAczier baane Baakany Azerbaijani axes atshwanela atlhagelelang arogantsweng Armenian API Andreas Amogelesega algebraic aleina akgethilweng akalega ak agodimo agegang afole afm adirisi accorsine About abelwa aanong AAA A5 A4 A3 A1 Zulu zu ZTEKO Z-Soft Zimbabawe Zilla ze your yo-tshumile yone yna Yn YMD Yi Yemen yayona yaSetlankana yase yas yaphokotso yaPele yang Yakgwedi yagago XYZ XY XSLTs xsltfilter xsltdialog Xponent Xor XNPV xis XIRR XIM XHTML wrtsh writer Wisetsa WinWord6 WinLefoko winexplorerext Windows-950 Win will Which wfaele Welsh welcome Weirstasss Webtop web-beilwe we wapharologanyo Walotiro Walokgolo walela wajaanong vyu VRML Völtz VLEBAGODIMO Visul virtual VIM viewer view Venezuela vector-thuto VDB vCard vCalender-faele vartheta varsigma varrho varpi varphi VARPA varepsilon VARA Values va uu utlwagala utlui UTF-8 UTF-7 usetsa Uruguay URL2 Urkranian Update uo UnZip UNIX United unitary Union Uninode Unicode ungarian undo Unary ulaganya Ukrainian uka UK uiview Tyuelo tya Twempalte twelopele Twelapele twela TWAIN Twaelo Tunisia TTEKO Tswya tswlopele tswlapele tswile tswhanang tswerlapele tswentsweng Tswelopeele tsweletswapele tsweletsepele tsweletsapele tswelangpele tsweetswee tsweapele tswao tswalelo tswalegileng tswalega tswale TswalaOtlhe tswako Tswakane Tswaa tsupetsonnye tsupetsong tstlhe tsrweng tsothe Tsolhe tsnyo tsnya Tsmaisomoj Tsmaiso-koketso tsmaisanang tsiya tsimologo tsimilogo Tsifatso Tshya Tshwraego tshwntshanyo tshwnetse tshwne tshwnang tshwna Tshwayasadireng tshwargantswe Tshwarganokgolo Tshwargano Tshwarar tshwaragolola Tshwaragaokgolo tshwaragantswe tshwaraganto tshwaragankgolo tshwaraagnyo tshwantshiwa tshwantshe Tshwantshayo tshwantshanywa tshwantshanyong tshwantshany tshwantsahnyo tshwanthanyo tshwanthanya Tshwano tshwanetsng tshwanetsego tshwanete tshwaneng tshwanelo tshwale tshwailweng Tshwailwe tshwaile tshwae Tshupetsox TshupetsoTafole Tshupetrso Tshupesto Tshuama Tshraganya tshraganogolo Tshpeto Tshomologo Tsholofetso Tsholetsa tshoga Tshobokayo Tshobokanya tshmologong Tshiologo tshimosetso tshimololo tshimologongya tshimologao tshimologa tshimilogong Tshimilogo Tshikinyo Tshikinyego Tshikintswe Tshianonako Tshhekeletsa tshgetse tshepa tshenyo Tshelo tshelkeletsa tshelang Tshelaganya-Nyelelo Tshekletsa tshekamo tsheimosetso Tshegetsoa tshegetsi tshegetsee tshegeidwa tshegedwa tshegediwe tshegeditsweng tshedimsetso Tshedimosetso-ZIP TshedimosetsoZip tshedimosetsomofuta tshedimosetsoka tshedimosets Tshdimosetso-ZIP TshdimosetsoZIP Tshawntshanya Tshawantshanyo Tshate Tsharolola Tsharokgolo Tsharo Tsharagaya tsharaganeng tsharagane Tshantshanya Tshantsha Tshameko tshaetse TSHABA tseyeditswe tsewlapele Tsetlhe Tsernya tseokrolo tsenypo tsenyo-Tatelano Tsenyopalo tsenyong Tsenyogape tsenyeleditswe tsenyeleditseng Tsenyamebala Tsenyadipalo tsenweng tsenwe tsentweng tsentswer tsentsw tsennwe tsengwang tsenenge tseneng Tsenay Tseletsopele Tselekhutswe Tselakutshwane Tseke tsegetso tseega Tsebetlase tsebeng Tsebegae Tsebefatso Tsawya tsawaetse tsatelano tsasmaiso Tsanmaisomoja tsanmaisa Tsanaiso tsamaya tsamaso tsamasitsweng tsamasano tsamasanang tsamasa tsamaiswang TsamaisoTsenyeletso TsamaisoTsamaisomolema TsamaisoTsamaisomoja Tsamaisotobetso TsamaisoTlholo Tsamaisotlhamo TsamaisoTekanya Tsamaisosenyo Tsamaisosentle TsamaisoPoloko Tsamaisopolema TsamaisoPeo TsamaisoPalo Tsamaisoolema tsamaisooja tsamaisoo TsamaisoNthsetsontle Tsamaiso-nnye tsamaiso-nepagalo Tsamaisomolems Tsamaisomolea TsamaisoMolantle TsamaisomojaBogare Tsamaisomoj TsamaisoLefelo Tsamaisokwalo TsamaisoKona TsamaisoKoketso TsamaisoKgolo TsamaisoKgodiso TsamaisoKagego Tsamaisogare TsamaisoCAD TsamaisoBophara TsamaisoBoleele TsamaisoBafofisi tsamaisnng Tsamaisitswe TsamaisiTsenyo tsamaisimolema tsamaise tsamaisanong tsamaisang Tsamaisamoja TsamaisaFormat Tsamaios TsamaioMolaodi Tsamaio tsamaile tsamaia tsamaela Tsahwantshanyo tsahwanetse tsahanetse Tsabophelo tsaamiso Tsaaisa Truncates TRUNC trlase Triniad trale traele traditional trademarks Tprus Totlhe TOTAL tositswe toolbox tomaganyo Tokomane Tokafatso Tokafaditswe To-Dos todos tobetswa tobeta tobesa tobeditse Tmelano Tlwaetso TlwaeloHebrew Tlwaelego tlwaelegilenk Tlse Tlsa tlotleng tlosiwe tlosiwa tloseng Tlopha tlolele Tlolela tlolagntswe tlogo tlogela Tlofatso Tloas TLOAMATSATSI tllwaelo Tliso tlisang TLHWATLHWAMAT tlhotlheletsang tlhotleletsa tlhopiwa tlhopho tlhophilwe tlhophe tlhophang Tlho`pha tlholwe tlholoutsweng tlholopalo Tlholomopeleto tlholile tlhole Tlhokotsa tlhokomlo tlhoko Tlhokegalang TLHOKATEKATEKANO tlhokago tlhloso tlhkega tlhhola tlhgwelele Tlhgiso tlhgelela TLHATLHWADISKI Tlhatlhaganya Tlhatlagano Tlhasela tlhaoso tlhaositswe Tlhaolapele tlhamilwe Tlhamaletse Tlhalsitswe tlhalosweng tlhaloswang tlhalostsweng tlhalosiwa tlhalositweng tlhalositseng tlhalosistweng tlhalosegang tlhalosega tlhalose tlhaloang tlhalang Tlhaknya Tlhakgolo tlhakatlhakane tlhakanyp tlhakanye tlhakany tlhakannwa tlhakana tlhakakakane tlhaka tlhaiwa tlhagswa tlhagiswang tlhagisiwa tlhagisitswng tlhagisistsweng tlhagisaw tlhagiisa tlhagi tlhagellang tlhagella tlhagelets tlhagelelng tlhagelellang tlhageleleleng tlhageleel tlhageella Tlhaelo tlhaeletsano tlhaelelang tlhaela tlhabolotsweng Tlhabolotswe Tlhabolola Tlhabeletso TlhabaphefoMatlho tletse-bophara tle Tlawaelo tlasetlhalostswe tlaolo tlannwa tlang Tlaleo tlaleletswa tlaleleltswa Tlaleleltso tlaleleditswe Tlalea Tlahola tlahloso tlahlositsweng tlahlositswe tlahgelele tlahgelelang tlagelele Tlaetsa tlae Tladitsweololosegile tl tkologo tko TITEL TIS-620 Tiropele Tirong Tirokageletso Tirisano Tiragatsi Tiragato tir TINV timolwe Timo Timmermann timetseng TIMASETE Tikologa Tiisokgolo Tiisitswe tihalosa Tiego Tibetana thwatlhwa thwantse thwanolola thuthufatsa thuswa Thusong Thupesto thupelo Thuosong thulganyo thulaganyong Thulaganya thubotsebe Thubegorep thubegile thubagana Thualaganyo Thuaganyo Thswaya thswanesteng thsupetsong Thsupetso Thsuma Thsekeletsa thsegetsa Threshold thotloetso Thorsten thomeogare Thomelontle thola Thlaloso THIBILE thibelo thibana thi these thesauus Thesauruse Thesaras Theogelo THEME theko theipi thegediwe Thedimosetso thathago thataro Thatafaditswe that thaolo thalositswe Thalla Thaknya Thakanya Thaepasefatlhego Thaepaa THAEAP Thaana Thaal thaa THa th tfole textconversiondlgs tetla tetelano testtool teokarolo tenga tendto Tenana TemplatePath templat Tempate Tempaltr TemanaKago Tekanyokgolo tekanyetsokabo teg technology tebp Tebelelogape tebelegaeng Tebego tebaganophaepe Tebagan tebaagno tditiragalo TDIST tbxctrls TBILEQ Taya tauelano tatlno tatlhelo Tatlano tatelena TATELANONTSI Tatelana Tatar tatalanoya Tatalano tata Tasamaiso TARGA taolong TAN TamaisoMolaodi Tamaisomoja tamaisanang TamaisaFormat Talse TAHN Tagbanwa Tagalog Tafolo TafoleGae Tafole-fetotswe tafile taetlano Taemane t`aelo Tabular tabledesign table t58\t{Tlola}\t9\t{Phatlha}\t32 t58\t{Tab}\t9\t{phatlha}\t32 T2 T1 system SYSDEVPHATLHA Syriac Syria synchronized Sync Symetric Syllables Sylk SYD Swedesh Sweden Swalela Swahili svxlink SVXB SVsdl1 SVscl svdraw sutiswa Sutisa-JIS Sutis suta supa SUNWzlib sunsolve sule styleui stseng stsement StraOffice stlhopha stlankana sthwanetse sthwanang sthedimosetso Sthaledi STEYX Steti stenyang STDEVPA STDEVA STD stbctrls STATTYP States STATEMENT statbar Start StarRealtimeClient StarRealTime Starndard StarCalcDocument stamaiso stakile Stack ssimolola Ssefei Sscl Srtlhagisi SQRTPI SQRT Splines Spilnes spellheck SPARC Spain Sotho Sookanya solofetsweng solofetrswe SOLK sokutshumila sobokany so snyegile SMTP sms Smolola Slovenian Slovakian SLN sle Slash skrolo skrolilwe skrining Skina size Sirooga Sirolola Sireltsa sireletswa sireletso sireletsegileng sirelediwang sireleditwe sioola siololwa Sinhala Singapore Sindhi SIN simoltswe SimololaOfisi Simola simlola Sikineitsha sikana SIHN sianiswa siane siameng siama si Shwaraganokgilo shwantshanyo shwanang shuma shobokanyo shells Shell she share SGML SGI sfwk seyong setup Setshwantsi SetshwantshoMokwadi Setshwantshole Setshwantshi setshwantshanyi Setshwantsh Setshwano setshwanetse setshabeng setsese Setsamaisi Setlopha setlnkaneng setlhodi Setlhipha Setlhare Setlhalosi setlhagoisi setlhagisweng setlhagiswamokwalo Setlhagiso setlhagisisi setlhagisise setlhagisijaa Setlatsi setlankna setlankaneg SetlankanaThaepa SetlankanaBuka Setlankan Setlamo Setlahgiswa setlahgiis setlagsi Setkhagisi setkankaneng Sethagisi seterata seteiti Setatamente Setaimente sesupo Sesireletsi sesetsentsweng sesetse sese Sesane Sesafatsa services servicename Sertlankana SeRona Sereki-letlhakore Serabia sepokokwalo sephuthelwaneng sephara sentlhaga sens senngwa senale Semocolon Semeti semeni Seltankana selhagiswa Selekanyo Selaodi selankana Sekwdi Sekwalo Sekwai Sekwafi Sekwad Sekolo Sekhupetsi sekgweetsi sekgontsha sekgone Sekgaoagnyi Sekgaganyi Seketshe seketekasekete Sekete sekene sekawa sekasekilweng Sekagaoganyi Seitshegetsi SeItalia SeIrish SegweleSengwe segstisi Segpotsho segopotsong Segompieno segment SegatisiDitiragalo sefetileng Sefepiwa Sefepi-letlhakore sefe Sefapano SeDutch sedragatsi sedorswa sediriwa sedirisw sedirisa sedire Sediragatsikwa Sedioriswa Sedimonthole sediiswa security Sebui SeBelgia sebatsi Sebatlisisi Sebaka Sebadi SeAustria SeArabo SeArabic seaki SDisthekeletsa sdidiriswa SDetlhogo script Screen Scientific Schilling Schema schedule scana Scan Scale sbx Savador Saudi-Arabia Saturation satshedimosetso sasegopotso Sanskrit sana samaya samaisoMofofisi samaisoLekanya samaisa Salmon sala Saitsiweng Sahlbach saete Saerna SAENE s2 Rwanda Rurufatsa Runic Rumanian Rulagaya Rulaganyatab Rulaganyakwa rulagantse rulaganngwa Rulaanya RSQ RRI Rre ROWSTR ROWNAME ROW ropilwe Root romrtsweng Romla RometsweMeili romelwe romelwang romelw Romanian ROMA rof roemla robegileng RLE rlaganya Ritifatso rilen Rico Rica ribbar Rhaeto-Romance RGB rfc822 res required REPT Rep relationdesign Rel rekhotiwa rekhotilwe ReisterFS regresssion registry registration-site readme READ Ratela rategang rate ratang ralele Raleal Radius Ra Quotient quickstart querydesign Qatar Python-UNO Pyramid Pusetsa Puseletso PuoDitiro Punt Punjabi pulphtlha pulphatlha Pulotsela pulophalha puiso puiano Puerto pub PTSTR pt pstack Proxy PROVINCEYATPROPO protchk propctrlr productregistration probability PROB Priority Printer previous preload PPMT PPM pplets Ppego pp potso potokilweng Potoka pota posture Postcript Portugese Portugal Population popong Popego POP3 pop pontshong Ponthsa ponogape PonOffice pongatso ponagala Polymela polokego Polish polelo Polelelo Polasitiki polao POISSON Pogelo PoenOffice poeetsong pobiwe pobiwa PNG pnagatso plugapp plophatla ploko plo pkgadd Pka piyano pionagalo pintshong pimotswe pilophatlha Pie PID PICT Pica piano Phukwi phtlalatos Phsonnye Phosoya Phosonnye PHOSOMOFUTA PhosoEsadireng Phootso Phoo Phong Phomola phokoleto Phofelo Phoenetics Phitshwana Phitsho PHITLHELOPATLO phiolwa phiola phimotse phimolwang Phimoloa phimogo phimoga phimla Philippines phifatso phetolomaemo phetollo PHETOLELOPONTSHO phetolelogare Phetolelofaele Phetlolelo Phetellokgodiso Phetelelokhutswafaditswe Phepo Phephafatso PHEPHA phepe phelelo Pheleletsontlha Pheleleletso pheleeltso Phatwe phatloga phatlhogo Phatlatirelo phatlalatswa phatlalatos phatlaaltso Phatla pharologanommogo phaposo PhaposiTsela PGM Peter Peseta PERMUTATONIA PERMUT PERCENTTATELANO PERCENTILE PERCENT peotsela peogotsaya Penta pen Pelewalo peletso Peletotlhola peletilwe Pelemola Pelelefatshe pelaelo Pego1 Pegelo pefo PBM Patterns PATLOMAT PATLODISKI patli path patelang PASEKALATSHIPI Paseka Party Parenthesis parametre parameteres Parallelogrrams parallelograms Parallelogram Parallellogram Paraguay Paragraph Para paogotlhe panish Panama paloy PALOXMY2 PALOX2PY2 palox PaloTsamaisomoja palo-Tsamaisomoja palotatelano PALOSQ PALOSETLHAGISWA Paloo PALOMX2MY2 palomadi palokgolo Palokgilo Palokaroganyo Palokargano PALOGOTLHEKGOLO palogotlhdinako Palogolhe Paloftso Palofatsa Palofaso palodecimal Paloatso Pakistan pakelela Pakanyo pahtlalatso pahrologanyo pahrologano pahposo pagedlg Pa OWNFORMAT Own Outlook outliner otota otobetsege otle otl Othometiki OSLPIPExxx Oseka osaitsiweng osaireng Osagetse osadirng OS2-869 OS2-866 OS2-865 OS2-864 OS2-863 OS2-862 OS2-861 OS2-860 OS2-857 OS2-855 OS2-852 OS2-850 OS2-775 OS2-737 OS2-437 orgtsamaisa org1 ordic Orago options opo opeoffice opensource OpenOfisi openofficeorg OpenOffic OpenOffce Open opanyo Opantswe opa ooo ookie onwe ontsho ontshitsweng ontse omela Oman Olng Okophetho okgweetsi oketsang okeditsweng Okeditswe-B Okeditswe-A ogolo Ogham Ogare Offset ofelong oetaele OenOfficeorg oeletso Oeletsa oe odumo odirisi odirang OCT2HEX OCT2DEC OCT2BIN OBJ obi obedi Nyya Nynorsk Nyenyefatsa nyeleltso Nyeleletsa nyelela nye nwpagalo nwa num nttlheng ntswepheto NTSINOMIAL ntsifatwa ntsifatswa ntsifaditswrng ntsifaditsweng ntsifaditswe ntshtswe Ntshtsontle ntshitswe ntshitse ntshetso ntshetsa ntsheditswe ntshamokwaloX Ntsh Ntsetsontle ntlo ntlhaya Ntlhathubego Ntlhapheleltso ntlhana ntis nthsetswantle nthsetswa Nthsetsonle nthsafatsa ntho Nthlakgolo Nthetsontle nthakgolo N-th NT nshetsontle nsetshaba nsekai NPV Notlestwe nosi NORMSINV NORMINV NOPOLEGO nonotlolo nomorokgolo nomiali nomialcoefficient NOM nnngwe nnlile nngwe-mogatla nngwelennwe nngw Nnge NNETSE NneteTebo Nmoriti nmoralo nlofaditswe nlha nle Nkgopotse nkgatele Nickname Nicaragua Ngwanatsele ngwagatlolaganyo Ngwagatlola NGWAGAFRAC ngongoreo ngongorega Ngngorego ngangiasano ngagisano ng Neuroth Netherlands netefatswa Netefasa netefadiwa neteaditse nete net Nescape Nepo Nepal NepagtseMopeleto nepagalang Nepa NEGBINOMDIST NEG neelwa neelane neelana Nayaleina navipi NASD napeo Naleisetshwano NaleimoraloSetlankana NaledoMoralo NalediThalo NalediSetshwantso NalediSetshwano NalediSediriswa NalediNneteNako NalediNneteMoreki NalediNalediMoralo NalediMoraloSetlankna NalediMath NalediKgatlo NalediKgatlhisa naledikgaganyo NalediKantiro NalediKageletsoBaya Naledigatlho NalediDitshanele NalediChata NalediBona NalediBoalo Naledibala nakwan Nakotsamaiso nakokgaoganyo NAKOBOLENG nagore Nagakarata Naga Nabla Naane MySQL Myanmar mwkawlo MUNITI mtsotswana Mtric MTIKOLOGO MTEMOGO MSWord msilanguages Mrago Mplelwane Mpla mpkgwa mpho mpg mpe mov motwako Motswapele motshwaralefelo Motshwako Motshwaaaralefelo Motsheganong Motshai motsayakarolo Motsamao MotsamaisiMoalodi Motsadi motirong mothswralefelo mothofatsa mothjeo MOTHARADITLHAPIINV Moswagadi Mosupologo Mosupi mosotso Moseaj Mosaeno Morphing moroti Morocco morititimile morero Morekisi morao Moragolebala Moragoga mopla mopkwalo Mophatlhalatsi Mophatlalatsi Mopdiro monthsa Monnye Monitor Monithara Mongolian Monetary Monarch Monaco mom Molma Mollwane Molenma Molemogi molema-go Molelane MoLefelong Mola-Pulophtlha Molao Molantsi Molantke molaetseng Molaets Molabokgakala mokweeti MokwaloTsenyammala MokwaloTalolo mokwaloo MokwaloMolauodi MokwaloMolaodo MokwaloEnjene mokwaloE MOKWALODEVSPACE MokwaloB mokwaloattelano mokwalng mokwako mokwa mokw mokgwao mokgwaga Mokgwa2 Mokgwa Mokgatlo Mokgabisi mokadi Moirisi-tlhalositswe3 mogolwane Mogolaganyi Mofutamogala mofutae Mofuta mofuata mofta mofosagetseng moffuta MOFATA Moetapele modulas Modro Modorisi Modisi modirong Modirisi-tlhaolositswe Modirisi-tlhalositwe1 Modirisi-tlhalositswe4 modirisi-kgethegile Modify Modierisi Modern MOD moborago moBonako moaletsa Moal mnaneo MNAKO MMULT Mmepmonnye Mmaoratwa mmamoratwa mmalwa mmaleng mlantle mkwalong mkgwa'NalediOfisi mitare miscdlgs misc1 MIRR MINA MIME migration MIDI Microystems Microsysytems Micrisoft Michel Michael Meyer Mexico metwako metswakong metsotsong Metsiletshwao Metsi Metri metlhala metilwe Metafiles metafaee MET mesha merwalo Merten Mercury Mephatlholo meODBC mentsi mengwe menagano Memo memeng meleng melelo Melao Melamentsi mel mekwa mekoti megolo megala mefuteng medirong MEDIAN Meafaele MDY MDI MD MBOLENG maxnum MAXA maturity Matthias Matswao matsogotshwaro Matshwao-B Matshwao-A matsena Matsen matsatsingma matsasi Matrixes Matlhakore Matlhabphefo Matlhabaphefo-Johab-1361 Matlhabaphefo-949 Matlhabaphefo-936 Matlhabaphefo-932 Matlhabaphefo-1257 Matlhabaphefo-1256 Matlhabaphefo-1255 Matlhabaphefo-1254 Matlhabaphefo-1253 Matlhabaphefo-1252 Matlhabaphefo-1251 Matlhabaphefo-1250 Matlahre MATLAFATSO MathML Mathias mathatago Mathare Matesno Master marumotlhogo marumoditlogo Marumo-B Marumo-A Marothodi Markus Marathi MAPItshawantsaanyo Map maoto Maori Maoletsa maokokemedi Mantswe mannong manno Manipuri mangwe mananeopele manager Malte Malhabaphefo-874 Malaysia MALATSINGWAGA MalatsiMoKgweding MALATSIMOKGWEDI MALATSI360 Majato main mail Maikgethelo maikemistso Maikemisetso maian magolo magnta magelo Mafokopheto mafokong Mafokodinotlelo maflo mafelotiragalo MaemoY MaemoX Maem Maelo maele madulo madiotlhe Maddin2 Maddin1 MACRO Macedinian Macau Mabole mabapi MaatlaPoint maaatla LZW Luxenbourg Lück Ltela Lsedigare LS logtlwaelo LOGNORMDIST LOGINV Login logilwe LOGEST logatrimically logathrm Logathrimic logathium Logarithm LOG10 local lmogilwe Lithuanian Lithuania Lithuaian listiTafole Lista Lira Linux Limes Light Lichtenstein liborari Libia libemp libary lhopha Lhokomelo lhaola lgo Lewatle letshwo letshao Letsela letse LETSATSINC LETSATSI-LA-TIRO letlharetiro Letlharethubego letlharengboalo letlhar LETLHABOLENG letlhabaphefong Letlhabahefo le-tletse letleletsweng Letleletswe letleletswa Letlawa Letlaretirelo Letlare Letlapa Letlahbaphefo lethwao Letheka Letharepatlalalo Lethare letefatso Letefatsa letatsi lesome Lesedikgolo Lesedigare lesatsi Lesasirelediwang LESAFETOGENG-LETSATSIBS Lesadireng lerumotlhogo Lerumop leregrssion leogang lenaneoo lenaneong lenaeno lenaane lena LEN lemotshegang lemositswe lemorgong lemoragong lemogweng lemogw lelelee Lelefaditswe lekwaloitshupo lekw Lekokoko Lekile lekantswe lekanasegopotso lekanan Leje Leinatshwano LEINATAOLO leinasetlhagiswa LEINALANTLHA legotlo-ditobetso legore Legong Legend Legale legaetsebe lega LefokoNepagalo leflo Lefiko Lefifi lefelotirelo lefelotiragalo Lefelopeo Lefeko lefeflo LEFEFA leelo leela Lebsa Lebokosontle Lebikso Lebganya lebelelwgape lebe Lebanon Lebalapele Lebalamorago LEBAGODIMO LCM lbisa lbagana Layer Laux Latvian latshupetso latshimologo latsa latlhwa latlhegile Tafole latlhega latlha Latlang Latin-1 Lathe latelanh LatelangTemana latelang-setshaba latelane Latelag lateang Lasr lase larona Lao LAMBADA Laletsa laisitswe laisitsw Laisatlase Laisagape lais laetsweng laesensitswe Laer Labs labofelo kza Kwiso Kwetliso kwedi kwdisa Kwalophatlalalo kwalong Kwalga Kwalelonnye Kwalelokgolo kwalelo kwalegodimo kwalegang Kwalega kwala-fela Kwal KwaGodimo Kwagditswe KwaFetileng kwadiso-nnete kwadisitse kwadise Kuwait Kutlwagalo kutlonne kurtosis KURT ku Krapp kppo kpang kouta kotsofalo Korean kopskopaneng koppang Kopntswe kopiwa kopiso Kopilwe kopanyong kopanyang Kopanyabitmaps kopanngwang kopanngwa kopanang kopakopano kop koo konopong konop konnwe Konkani Kongo Kong konegong kone kolaganyo Koketsonnye KOI8-U KOI8-R Koetso kobegang Kn km KitsoBoalo kitso Kinyarwanda Kiketso-A ki Khutswfatso Khutswafatsonnye Khutswafaditswe khutswafaditse khutshwaneMaemo Khutlonnekgolo Khutlnne Khuthswane khuponong Khunousekale Khunouletlapa Khtswafatso KHOUTUPOSO Khotu khotlonne Khopy khomputhareng kholomong Khmer khlomo khesara khamphani khalendra Kgwwetsi kgwwetsa Kgweetsa kgweeto kgweding Kgtlho Kgtiso kgthegileng Kgtalho Kgtaiso kgrthwa kgotsatlhakanya Kgotsaboleng kgotaa kgos Kgoreleytsa kgoreledotswe kgontshitswe kgonnweng kgonge kgonagetse kgonagaleng Kgomaretysa Kgomaganya kgolreleditswe Kgolotsamaiso Kgololosegoforomo kgololo Kgolokhutswafaditswe KgoloKago KgoloInt kgologeometric Kgolo5 Kgolagayo kgolaganya Kgolagana Kgolaan KGOGOLOG kgogo Kgogelo-thoko kgogelongthoko Kgodisokgolo kgobakantse kgobakanngwa kgnege Kglo kgetseng kgetse-boi kgetilweng kgethwe kgethollo Kgethokgolo kgethlweng kgethillweng kgethileng Kgethela Kgetheile kgethego kgethegilelng kgethegang kgethega kgethe Kgeta kgehiwe Kgehegile kgdiso kgbakanya kgatso Kgatla kgatisontle Kgatisego kgatio Dikgato Kgatholose kgapeletso kgaolo Kgaola-Tsebe Kgaognya Kgaogayo kgaoganye kgaogantsweng kgaogantseditswe Kgaogano kgaogannga kgaogane Kgao Kganyisa Kgantsha kgankgolo Kgalalelo Kgaisno Kgaganyo kgagane kgagana kgafetsa kgaetso kgabiso Kgabisa Kgabio KGABETSA kgaaya Keyboard Kenele keditswe Kazak katebaganyo Kashmiri kas karona karolontis karolo-nngwe Karoganyonnye karetso kare karatanaga KapeleNako kapa kaoganyoo Kaoganyo Kao Kanxi kantsha kanji Kanbun kamolaokwa kamolaoefeta KamogeloMokwalo kaMatlhabaphefo Kamano kaLwetse kalwa kaLernout kale kala Kakopo kako kakgona KagoTamaiso Kagonnye KagoKwalo KagoKwala Kago-go-kago Kagoganya kago2 kago1 Kagnetso KageletsoSete Kagegeo Kagatlho kagaoganngwang Kag kafetola kadiriswa kadimo kadilweng kabonya kabonako kaa jw Jva JREs JPG JPEG Jotlhe Jordan Joina Joe Jn JJKA je JBDC JavaTiro javafilter JAR Japanese James Jamaica jaanonggo jaana Jaaaka J3 iya ivf itso itsholo itlhophela Itlhaloso ithuso ithaliliki Iteng items1 itemogetswe itemogela itekanelo ite Italy Italic Italian itaijii iswe ISREF ISPMT ISPHOSO ISPALO IsoCoroperation ISO-8859-9 ISO-8859-8 ISO-8859-7 ISO-8859-6 ISO-8859-5 ISO-8859-4 ISO-8859-3 ISO-8859-2 ISO-8859-15 ISO-8859-14 ISO-8859-13 ISO-8859-11 ISO-8859-10 ISO-8859-1 ISO-2022-KR ISO-2022-JP ISO-2022-CN IsNgwagatlola ISNGWAGANGWAGA ISNEPAGALO ISNA ISMOTSWAKO ISLOLEA ISKAGO isistswe ISESENGKAGO ISERR IRR iro Irikgolo ireng Iraq iragalo IPMT Iphithile IPA IO-ditirelo investment invere Inttmet intsi intro Intrenet INTRATE Intercharge integer INT installation install INSRT InsoCoroperation inotlelo Initialization ingangiano INet ineetse Indonesian index Indeo Inafatso Inafaditswe IMSUM IMSUB IMSQRT IMSIN IMSETLHAGISWA importwizard imported Import IMNNETE IMNGANGISANO IMLOG2 IMLOG10 IMLN IMKOPANYA imili IMEXP IMDIV IMCOS IMAP IMABS ileibole Ikwadiso ikopanye ikholomo ikgolaganye Ikgatoloser ikgatolosa ikgatholoswa ikgatholositswe ikemetseng ikemelo ikarolo ikaelelang ikaekeka ikaegile Ignore IF Idiragatsi ictionary icon iCalender-Faele ibatli ia hyu Hyphernation HYPGEOMDIST Hyperlink Hyperboloc hyperbolc hypebbolic HYP Hütsch huso Hungul Hue HTTPS Hönnig Hong Honduras HLEBAGODIMO hitori Histori hirigana hiola Hindi hibelo hibela hh hexadipalo HEX2OCT HEX2DEC HEX2BIN hetolelo here Heleletso Hatlalatsa Hataluku harmonic HARMEAN hardware hard Hanunoo halofo-bophara Halofo haepa Gurmukhi Guilder gui Guatermala gtsenyeleta GTB-12345 gray graphicfilter gramma Graayscale gp Goya Gouraud gotwsa gotwa Gotswago gotlhelele gotlhakanya Gosub gosdimo Gosakwalwang Gosabonagale Go-Pelelebala gop gona golofetseng golofala golaganyo golaganyeng Golagantse golagannwa golaganngwe golaganngwa Gola gokona Goidmo Gogelatjhoko godira Godio gobopiwa gobopa Gobakanya gobakantswe goa globdoc glibc2 Gidimo Gforomo getolelwa gethegileng gethegile German geometric GEOMEAN GEKGATO GDI GCD GBK GB-2312-80 GB-2312 Gauta GAUSS gatsisa gatisiwa gatisitse gatisegeng gatise gatisaw gateletse Garisa Garile garew Gare-tshwantshanyo garayscales Garametsa Garakgaola garafatswa gapetekanyetso gapeRouting gaokgonega gaoganya ganwe gannweng ganeditsweng ganeditsw ganang GAMMALN GAMMAINV GAMMADIST gallery2 Gallery Gakolositswe Gakolosa gaiwa gagokgonegego Gagokgonagale gagoelemente gagakgonege gag gaFetileng gaelekane gaekgone Gaea gadikaketsa gadia gadi fyu FVSTHULAGANYO futlhelela FuneBontsi Functions FullName fudusitswe Ftlha FTEST ft FRomela frmdlg French framework Frameset fotlha fosagrtseng Forogotlha formwizard Formula formdlg FORMAT form Fora Fophole foopheto fonts FontName Font FOMOYAPEGO FOMOPEGO Folosa fologa following folder foladareng FOKOTSAMEAN Fokopheto-sireleditswe fokopheo Fokokgolo fokodiwa fokoditsweng fmtui fmcomp FLURU fldui fla fiwang fiwa fitlhwa fitlhelege Fitlah Fisa firs FINV Finnish Finland filters Filder Fifatsa FIELDNAME fetswang fetoleletswe fetolele fetolelang fetolea Fetolagare Fetolabogolo fetoge fetoga Fetoal fetlletswe Fetlengboleng fetiswa fetisetswa Fetilela Fetile fetela FenyaLefoko97 Felothutelo feletse feleng felelwa Felelang feella Fedsa Federal FDIST faxpalo fatso fatshe fasagala Farsi farooganeng farologneng farologane-dira Farogane Fariloganeng FAQ Fapanya FamilyName Fakse Faeroese Faeleya faelee F9 F4 EXT Export exponent EXPONDIST explorer EXP exists exe Evolution eUropa EUC-TW EUC-KR EUC-JP EUC-CN etswang etswako etshwanelago etsatsi etsamaisanang Etsa-B etrics etolela etlositswe etlhokegang etlhare etlhalositsweng etlhalositsweg etlhagelele etlhaeglele Etlankana Etlahgiswa etla etileng ethusang Ethiopic etetsweng eteng Etelapele etbaganyo Estonian essdireng Essasolofelwang Esperanto Esolofetsweng esng eshwanetseng esetseng ese Escudo esatshegediwang esatlhokagaleng esatlhalosiwa Esatlhalosegeng Esasololfelwang Esasireletswang ESALEKANENGTLHWATLHWA ESALEKANENGTLHATLHWA ESALEBAGANENG esalebaganang Esakgonegeng esakgonege esagatisegeng ESAFETOGENGNUM Esafeleng esadirng Esadiriswang Esaakgonegeng Esaaiwang es eru Error ernout erileng ERFC ERF ER Equador EPSI eppm Epilwe epict epgm epelela epe epbm eos2met EOS EOKGWEDI EOF envelp EN-us enotlolo engine3d End Encypts encypted encrypted encoding Encapsulated enang enale emp Emoticons emorago emeleang emelang emeili eltswang elopontsho Eliene eletsa ELETLHA eleng Elekroniki eleemengwe ekwalo ekgone EKgolwane ekgobakantsweng ekgethilweng ekgethegileng ekafela eitsiwe Eire Einar Eina egray egif Egepeta efilweng efe efarologaneng efa eetetsweng Eemetse edriswang editeng Edit edirang edikologilwe ebrew ebopilwe ebokoso ebewe eb Eaitsiweng eadirwa DVARP DVAR Dutshwaragano Dutshwantsho Duteng Durisa duragetse Duplicate dumeltswe dumeletsweng dumelelwang dumelele dumelelang dumelanang Dumeella Dumeal duelwa dueletswe duelegang Dubeletswe du dtsheari Dtsamaiso dtirelo dthubego dteng DTEKANYO dtapptsenya dtapintergrate DSUM DSTDEVP DSTDEV DSETLHAGISWA drawing drawfunc drang dragetse Drachma dra Downlouda downloata download dotaolo Dot Dorolola dorisa Dora Dophetolelo Dom DOLLARFR DOLARADE dokholomo Dodiriswa Dodiragatsi docvw document docshell dochdl doc do DNS dnako DN DMY dmela dlged Dkhplomo dkgetho Di-X diwildcats divisor diURL Ditswapele Ditswantsho ditswanelo Ditswaki Ditshwwantsho ditshwnelo ditshwenyi ditshwaro ditshwari ditshwarakarolo ditshwaraganyo Ditshwantsahnyo Ditshwai ditshenyi ditsharaganokgolo ditshanelo ditshanel Ditshameki Ditseny ditseno Ditselakhutshwane ditsebeng Ditsamaisano Ditsahwaragano Ditrng ditrademarks ditlwatlhwa Ditlwaelo ditlmorago ditlhwatlhwa Ditlhopa ditlholo Ditlhakanya ditlhakano ditlhakakgolotatelano ditlhakakgilo ditlhagisang Ditlhaeletsano ditlankanana Ditlankaa Ditlanka Ditlamorsgo ditlamoragovector ditlamoragotekanyetso Ditlamorago2 ditlamelwana ditla Ditiragatsi dithwaragano dithwanelo Dithulagayo dithulaganyo dithulagano dithsupetsonnye Dithalelo Dithaka ditempalte ditekanyetso diteg Ditebagano ditatlhelo Ditatealno Ditaili ditafoleng di-tabs disyllabase disyllabas distribution disriptsnnye disreadsheets disking disiate Dishiti disete Disenangpalo diseleng disel Disa-thubegeng disasiamang disalekaneng Disakopanngwang dirwe dirwalo Dirosa dirololwang Diro dirnag Diriwang dirisiwang dirisisweng diriseditswe dirise dirisaw dirisae dirileng diriistsweng dirgatswa diretswengmo direlwang direla direkito direge direga diragatswang diragatse diragape diragalang diragaetse Dira-A Dipusetso diptlo Dippoelo dipostara Dipono dipolygon dipolane Dipoelotsa Dipoeletso Dipoela Dipoel diplo Dipioelo Dipie Diphtolelo diphposi Diphomolo Diphimolo Diphetolo Diphetoleleo Diphetolelelo Diphetoleelo diphetogong Diphetigo Dipheleeltso Diphatlholo diphatleng dipharologno diphaposi Diphalane diperesente dipeeletsa dipampiri Dipalontsi DipaloMofuta dipalogotlhekgolo Dipallette dipalelo Dipal Dipahrologano Diopelo dintshitsweng Dintlhkgolo Dintlhapheleletso Dinotlolo dinotlelotobetso dingingorego dingangsano dingangisno dineo dineelano Dine Dinawa Dimmepe Dimeti dimenung Dimension dilogo dilo Dilibrary dilhaka dilhagiso dilepe Dileobole Dileible dikwedi DIKOUSU dikopong dikoloswang dikoloswa dikolositswe DIKOLOSETSATLASE Dikolose dikolomo Dikologolwe DikologilweDikhutlonnetelele dikologile DIKOLOAS dikhutswafatso Dikhutsana Dikhukhwane dikhoutu dikhomo dikhoma Dikholomonnye dikholomong Dikhibidu dikgweetso dikgwagetsong Dikgtho dikgotlang dikgopolo dikgonne Dikgodiso dikgobakanyo dikgigelothoko dikgetsho Dikgeth dikgebo Dikgapelothoko dikgaganyo Dikemelo dikarolwan Dikaratanaga Dikalatshwana dikakanyo Dikakany Dikagato Di-imeili diimeile DiID DIHTTP digradientsa Digolaganyi digatising Digaoganyo Difraction difoldara Difolaga difele Dietetsweng dieo dienjene Diediragatsi didumeeltswe Didriswa didownload Didoriswa Didoiriswa didisetswa Didirswa Didirisweng didirisw Didiragtsi Didiragatswa didiragats didiragasti didigit dididiswa didictionary Dictionaries dicriptsdigolo Dicomputha dicomponent dicokies di-clipboard DiCharts Dichart dichanele dibukatshwaong dibtli Dibraces dibeek dibatli Dibaluni Diaxe Diatesrese dialo diaele dhi DEVSQ devive devece devditlankana Devanagari delimiters delimeter Delete Degress Degres decypts Decmal DEC2OCT DEC2HEX DEC2BIN DDL ddidiragatsi DDEML DDB DCOUNT Dcharts dbui dbpilots DBONNYE DBONA DBOGOLO DBLEINA dbhthuso dbgui dBase Date Database Darusalam Danish Daisy Da Czech Cyrrilic Cyrilic Cycan curency CUMPRINC CUMIPMT Cube CSV croll CRITBINOM crash COVAR COUPNCD could COTH COT Costa COSH COS correlation CORREL Coropetation Copuright Coptic coordinates contnr contangenyt contains contained contacts consonats consonants Conponent configuration Cone concatentation CONCATENATE conangent computeng comper Comment Comma Comercial COMBINA COMBIN Column Colonnnye Colombia Col coefficients coefficient coefficent coding code CMYK cm CLOB Clippart Clipchart Clipart Client classical Clark Circumflex CI chte Chrome chrdlg cho-tshuma Chnese CHITEST Chinse Chile chi-khutlonne CHIINV CHIDIST Cherokee chateng Chata Chart CHAR Cha CELE CEILING CDOUNTA CDE-Calendara-Faele Catalan Caribean Canadan Can calendara caching byu bytswe Byelorussian BW Bustsa Busitse busedfitswe busdiwa busditswe Burow Bulgarian bule Bukwa bukhutshwane bukeng Bukatiro Bukathwao Bukapontsho buk buisiwa buisa Buhid Bua btlegang btla bseditswe Brunei browser Brochure Bregas Brazil Braille brackets Bpphirima bpiwa bphara boyoan botswang botswa botselo Botsalano Bototshwaragana botothwaragano Botlse botla Bothaba Botengphetolo botelele Bosweuphatlha BosweuBontsho bosona bosha Bosetlhana bosadireng Bordeax borara Bopomfo Bopofomo bopiwe bopilweng Bophirma bopega bope bopbedi boontsha bookkeeping booemong Booalo boo bonyw bonw bontsikarolo BONTSIDIPALO bontshitseng bontshe bontshadiphetogo Bontsah Bontsa bonto-lekanang bonthswa bontha bonsi BONNYEVESE Bonno bongwaga boneng bonang BonagalangTiro bonagaditsweng bomnagalang bomadimabe boloko bolokilwr bolokesege bolokegile bolka Bolivia boletadikgolagano Boleta bolen bolele boleg boleeele bolalo BokmAYI bokhutlong bokgethelo Bokao bokamosong Bokamos Bokai boka bojjanong Bojanong Boikkgethelo boikgehelo Boikarabelo bohong bogodmo bogodim bogelo Bogaufi Bogarel Bogarekabisitswe Bogara bogar boemong boemng boeeltswa Bodara bobrdi Bobolo BobiTsamaiso BobiTiro Bobei Bobeditobetso Bobedi-lekhubu bobedika Bobedi-Gogilwe boalonye boalonnye boalo-2 boalo-10logathrim boalo-10 Boagisani boa bnagape Blocks BLOB BINOMDIST Binary BIN2OCT BIN2HEX BIN2DEC bimap bilweng bilwe bila BIGS5-HKSCS bibliography bgolo Bfelo bfe BETAINV BETADIST BESSELY BESSELK BESSELJ BESSELI belweng Belize BEKELETSATSI beilwng begilwe Beamer bbi Bayantle Bauer batshwarkarolo Batsharakarolo batlwa batlisisa batlhagisi batlelwa batlegang batlega batle batlatatelano Batlana batlamofuta Ba`tla Batl Bathswarakaroo bathswarakarolo Batho batal Bata Baswagadi bastyp Basque basicide BASIC bareetsi bapa balwe balwagotlhe balwa-fela Balo balelwe balelwa Balela balamokwalo BALALOLEA Balagape BALAFA bakile bakgwetsi bakannwa BaitseanapeSetlhopha Bahrain badilweng badilwe-fela badilwe babakantsweng baba Baamogedi Baaknya baakantwe baakannwa baakangwa baakanaya baabne ay axs awt aWord avi AVERAGEA AVEDEV automaticaly AutoCAD Austria Australia Audio AU attelano atshwao atshwanelwa atshwanang atshegetswa atsenngwa atsamaisana atlhokega atlhare atlhaloswa atlhagiswa atlatswa Atl atisitswe atiro ATANH ATAN2 ATAN AT asupeditsweng assignment asset Assami ASP ASINH ASIN ASII aSeithaliki ASCII Asaitsiweng ASAFETOGENGPCD ASAFETOGENG-MATSATSI ASAFETOGENG aroganya ARMOLINC Argentina are arcsne arcsine archiving Arccortangent arbilwe arabiwa arabileng ar Apple appl AportisSetlankana AporstisSetlankana AporrtisSetlankana Aplo aphoos aphetolelo apei Ape annwe Annonation animations Andale Anchor analysis an AMORDEGRC amolemeng amogetweng amogetsweng amogelwa amoetswe amina Amiga amemo amafelo amabedi ama already alonge Alofatso Algothm algorithm Algerian algebra Aleph Albanian al akgoreletswa akgo akgna akgaogantsweng ake aka ajalo aikgatholosa AIFF Ah agiwa agisanya Agilwepele agileditswe ageletseng Ageletasa agegileng age agare Afrikaans Afrika afetotswe afarologaneng afaeleng Aesaitsiweng Aesadiring aerese aemo aele Adobe Administration adirisitsweng adikgolaganong adidiriswa ADDIN adaptiw adapta activex ACOTH ACOT ACOSH ACOS Tiragalo ACCRINTM ACCRINT accel ABS abpilot Aboriginal abla Abgodimo ab aakanya A2 A0 2D dict-tn-20070206.orig/tn/wordlists/wordlist.scannell.in0000644000175000017500000014270510562150027021406 0ustar dokodoko# wordlist.scannel.in - Tswana (tn) words from web crawling. # # Copyright (C) 2004 Kevin P. Scannell and # Thapelo Otlogetswe # # 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 # aba abang abela abelana abelela abelwa abelwang abelwe abetswe abetsweng abilweng abiwa abiwang abo adima adime adimilweng afe Aforika aga agang agelela agelwa ageng agilwe agilweng agiwa agiwang agwe akabetse akanngwang akantse akantseng akantsweng akanya akanyang akanye akanyetsa akareditsweng akarediwa akarediwang akarediwe akaretsa akaretsang akaretswa ake aketsa akga akgela akgola alafa alafiwa ama amana amanang amane amang ame amega amegang Amerika amiwa Ammaaruri amogana amogela amogelang amogele amogeleng amogelesega amogelesegang amogelwa amogelwang amogetse amogetseng amogetswe amogetsweng amologanngweng amusa ana anaanela anama aname anameng anamisiwa ane anega anegela anela angwa angwang ano anya anyana ao apara apare apareteiti apaya apayang apee apeela apere apola araba arabe arabela arabele arabile arabiwa Aretikele arogantswe aroganya arola arolwa ata atamela aterese atile atisa atla atlarela atlega atlegile atlenegisa atlhame atlhola atlholelwa atlholwa atlhotswe atologileng atolosa atolosiwa ba baagi baaging baakantseng baakanya baakanyetsa baanelwa baba babadi babalela babalesegile babalesegileng babatlisisi babedi Babelona babereki Babitsi babogedi babotlana babueledi babuisi badile badimo badimong badiredi badirelwa badiri badirisi badirising badisa badumedi Baebele Baebeleng baemedi baemeding baeng baengele baesekele baeteledipele bagae bagaetsho bagaka bagale bagolo bagolong bagolwane bagomotsi Bahebere bahiriwa bahumanegi bahumi baikepi Baile baithutedi baithuti baithuting Baitse baitshepi baka bakaedi bakang bakaulengwe bakeng bakeresete Bakgalagadi Bakgatla bakgweetsi bakhuduthamaga baki bakiwang bakopi Bakorinthe bakwa bakwadi Bakwena bala balaodi balatedi balekane balekeletsi Balekgotla balela balelwa balemi balemirui baleofi Balete balwa balwetse bana banake baneng Bangwato bangwe banka bankeng banna banneng banni bannye bantle bantlenyane bantsho bantsi banyalani banyana bao baokamedi baoki bapa bapala Bapanya bapatsa bapile bapileng bapisa bapisiwa bapola baranodi bararo baratani barataro bareetsi barekedi bareki Barolong Baroma barutabana barutabaneng baruti barutisi barutwa barutwana basadi Basarwa basetsana basiami basimane basimaneng basimanyana Basotho basupi basweu baswi baswing bata bathapi bathapiwa batho bathong bathusi batla batlamedi batlang Batlatsatona batle batlega batlegang batlela batleng batlhabani batlhami batlhanka batlhankedi batlhano batlhatlheledi batlhoki batlhophi batlhotlhomisi batlile batlileng batlisisa Batlisisang batlisise batlisisiwa batliwang Batlokwa batlwa batsadi batsading batsamaisi batsayakarolo batsereganyi batshabi batshegetsi Batshweneng batsofe Batswana baya bayang bebofatsa bedi beela beeletsa beelwa beetsweng bega begela begelela beile beilwe beilweng beiwa beke bekeng bela belaela belaele belaetse belega belege belegwa beng bereka berekang bereke berekela besa bese beseng betelelwa betla betsa betse betsega betsho bewa bewang bewe bidiwa bidiwang bile bilediwa bileng biletsa bina binang bine bipa bisa bitsa bitsang bitse bitswa bitswang bo boa boagi boago boaka boakaretsi boalo boalothulaganyo boammaaruri boanedi boatla boatlhamo boatlhodi bobe bobedi bobegakgang Bobegakgangbontsi bobegi bobi bobipo boboa boboko bobona bobone bobopi bobotlana bodiba bodibeng bodimo bodiphatsa bodiragatsi bodiredi bodiredipuso bodiredipusong bodiri bodirisi boditsweng bodiwa bodulo bodumedi bodumeding bodutu boe boela boele boelela boeletsa boelwa boemedi boemelong boemo boemong boena boene boeteledipele boetse bofa bofe bofefo bofelo bofelong boferefere bofitlha bofofu bogadi bogale bogaleng bogare bogareng bogasi bogela bogelela bogelwang bogisa bogisiwang bogobe bogodimo bogodu bogola bogole bogolo bogologolo bogolosegolo bogosi bogosing bogwebi bogwera bohibidu bohumanegi bohutsana boifa boife boifeng boikaelelo boikanyegi boikanyego boikanyo boikarabelo boikemisetso boikepo boiketlo boikhutso boikhutsong Boiki Boikitsiso boikobo boikokobetso Boikotlhao boikuelo boima boineelo boipelego boipelo boipiletso boipuso boitapoloso boitekanelo boitekanelong boitemogelo boitemogo boithatelo boithutedi boitlhamedi boitlhophelo boitseanape boitshegang boitshepo boitsholo boitshupo boitshwarelo boitshwaro Boitsweletso boitumelo boitumelong bojalwa bojanala bojang bojotlhe boka bokae bokaelo bokaelong bokamoso bokana bokao bokaong bokaulengwe Bokeresete bokete bokgabale bokgabong bokgakala bokgoba bokgobeng bokgoni bokgoning bokhuduthamaga bokhutlo bokhutlong bokhutshwane bokoa bokolela bokone bokopano bokwa bokwadi bolala bolang bolao bolaodi bolaong bolawa bolaya bolayang boleele bolela bolelang bolele bolelela bolelelang bolelele bolelelwa bolelelwe boleletse boleletswe bolelwa bolelwang boleng boleo boleong Bolepamagodimo boleta boletse boletswe boletsweng boleyong boloka boloke bolokesegileng bolokilwe bolokilweng bolokiwa boloko bolokologi bolokwa bolola bolone bolong boloto bolotsa bolotsana bolwetse bomadimabe Bomalome bomang bomankge bomatla bomethalethale bommaagwe bommasepala bomme bommenejara bomo bomolaotheo bomorafe bomosola bona bonagala bonagalang bonako bonala bonalang bonale bonamo bonana bonang bonatla bone bonela boneng bonetetshi bong bongaka bongwana bongwanaka bongwe bongwefela bonnake bonnana bonnete bonno bonnye bonnyeng bonolo bonosi bontle Bontleng bontlha bontlhabongwe bontlhanngwe bontlhopheng bontsha bontshang bontshe bontshitse bontshiwa bontsho bontsi bontsing bontsintsi bonwa bonwang bonwe bonweng bonya bonye bonyeng bookelong boona bopa bopaki bopama bopang bope bopelokgale bopelonomi bopelotelele bopelotshetlha bophara bophasalatsi bophelo bophelong bophepa bophirima Bophuthatswana bopilwe bopilweng bopiwa bopiwang boranyane boraro borataro borethe borobabobedi borobalo borokgwe boroko borokong Borolong borotho borre borukhutlhi borulaganyi boruni borutegi borutelo borwa bosa bosadi bosaitekanele bosakhutleng bosasweng bosekaseki bosenyi bosetlhogo bosi bosiamisi bosigo bosigogare bosigong boso bosula bosupa bosupi boswa bosweu botaki botala boteng botennye bothakga bothata bothati bothitho botho bothokgami bothong botlalo botlana botlhaba botlhabatsatsi botlhale Botlhalenyana botlhami botlhano botlhaswa botlhe botlhodi botlhofo botlhokatiro botlhoki botlhoko botlhokwa botlhokwatlhokwa botlhole boto botoka botokololo botsa botsala botsalano botsalanong botsalo botsamaisi botsamaising botsana botsang botsayakarolo botse Botsereganyi botsetse botshabelo botshe botshelo botshelong botshepegi botshwakga botshwantshi botshwene botso botsofe botsogo botsolotsa botsona botswa Botswana botswerere bouta boutela boutlwelo boutlwelobotlhoko boutu boyona bua buang bue buela bueng buile buileng builwe builweng buisa buisana buisane buisang buisanya buisanye buise buisega buisetsa buisetse buisitseng buisiwa buiwa buiwang buiwe buka bukana bukaneng bukeng bula bule bulega bulegileng bulela bulelwa buletsweng bulwa busa busang busediwa buseletsa busetsa di dia diabe diane dianelalebopo dianelaphologolo diaparo diaterese diathikele diatla diatleng dibaga dibalate dibanka dibata dibatana dibe dibeke dibekeng dibela dibeng dibese dibete dibetsa dibogelwa diboko dibopiwa diboutu dibuka dibukana dibukathuto Dibukatsatsi dibukatshedimosetso Dibukatshupetso didiba didimala didimetse didimetseng didirisiwa didiriso didiriswa diele dieleng dielo dielong difatlhego dife difilimi difolaga diforomo digase digela digole dijo dijong dika dikabelo dikadimo dikaedi dikaelo dikaelong dikago dikagong dikahisetori dikai dikakanyetso dikakanyo dikakgelo dikala Dikaloso dikamano dikanedi dikanelo dikao dikapolelo dikapuo dikarabo dikarata dikarateng dikarolo dikarolong dikarolothuto dikarolothutong dikarolwana dikatlanegiso dikeledi dikeletso dikelo dikemedi dikerafiki dikerafo dikereiti dikereiting dikereke dikete diketekete diketleetso diketo dikgadima dikgaisano dikgaka dikgakgamatso dikgakololo dikgala dikganelo dikganetsano dikgang dikgannyeng dikgaogano dikgaolo dikgaolong dikgaso dikgatiso dikgatlhego dikgato dikgatong dikgetse dikgetsi dikgobalo dikgoka dikgolagano dikgole dikgolo dikgololosego dikgolwane dikgomo dikgonagalo dikgonego dikgong dikgono dikgopolo dikgoreletsi dikgoro dikgosi dikgotlapeomolao dikgotlatshekelo dikgotlhang dikgwa dikgwebo dikgwedi dikgweding dikgwetlho dikhampani dikhampase dikhampaseng dikhanselara dikhansele Dikhatekori Dikhathunu dikhonferense Dikhopi dikhoutu dikhumo dikhutlo dikhutsana dikhutshwafatso dikhutshwane dikhutshwe dikile dikitsiso dikobo dikobong Dikoketso dikoko dikokoano dikolo dikologa dikoloi dikolong dikoma dikomiti dikomota dikonteraka dikonyana dikopano dikopi dikopo dikotla dikotlhao dikotsi dikungo dikuno dikuranta dikwalo dikwalong Dikwalwa dikwena dilaesense dilalelo dilalome dilekanyo dilepe diletso diletswa dilo dilong dilwana dimakasine dimapo dimela dimilione dimmapa dimo dimonamone dimpa dimpho dinaane dinaga dinageng dinaka dinako dinakong dinala dinaledi dinama dinamagadi dinamane dinamune dinao dinaong dinatla dinato dineo dinepe dingaka dingalo dingangisano dingongorego dingwaga dingwageng dingwao dingwe dinku dinnye dino dinoka dinoko dinomoro dinonofo dinonyane dinopolo dinotshe dinta dintho dintle dintlha Dintlhakakaretso dintlhakgolo dintlhana Dintlhapopo dintlheng dintlhwa dintlo dintshe dintsho dintsi dintwa dinyana diofisi diofising dipadi dipadiso dipaka dipalangwa dipalo dipalopalo dipampiri dipapatso dipapetla dipapetlana dipapisa dipaterone dipatlisiso dipatlisisong dipe dipeeletso dipegelo dipego dipeipi dipelaelo dipelo dipelong dipeo diperesente Diphalane Diphaphatha diphaposi dipharagobeng dipharologano dipharologantsho dipharologanyo diphasalatso diphatlha diphatlhatiro diphatsa diphatseng diphefo diphelelo diphetogo diphiri diphitlhelelo diphofa dipholesi dipholo diphologolo diphologolong diphoso diphousetara diphuka diphuthego dipina dipitse dipitso dipodi dipoelo dipoelong dipoelothuto Dipoelothutong dipogiso dipolane dipolanete dipolelo dipolelong dipolelopate dipolelwana dipolotiki diponagalo dipone dipono dipontsho dipopego Diporofaele diporofense diporofenseng diporojeke dipota dipotsane dipotso dipotsolotso dipuisano dipuisanong dipula dipuo dipuodintsi dipuong dipuopedi dipuso dipusoselegae dira diradio dirafala dirafalang diragadiwa diragadiwang diragala diragalang diragale diragatsa diragatsang diragatseng diragatswa diragatswang diragetse diragetseng dirala diralwa dirana dirang diranta dire direga diregang direkoto direkotong direla direlang direle direlwa direlwang direng direthe diretse diretseng diretswe diretsweng dirile dirileng dirilwe dirilweng dirisa dirisana dirisanang dirisang dirise dirisediwa dirisediwang diriseng dirisetsa dirisetse dirisetswa dirisetswang dirisitse dirisitswe dirisitsweng dirisiwa dirisiwang dirisiwe diriswa diriswang diriwa diriwang dirope dirori diruiwa dirutwa dirutweng dirwa dirwang dirwe disa disaense dise Diselammapa disele disentimetara disitse ditaekeramo ditaelo ditaelong ditaletso ditaola ditaolo ditebego ditebelo Ditebogo ditedu ditegeniki ditekanyetso ditekanyetsokabo ditekanyo diteko ditemalo ditemana ditemaneng diteme ditementsi ditemepedi diteng diterama Ditetlelelo ditetlo dithaba dithabalakane dithamaga dithamalakwane dithanodi dithanolo dithapelo ditharabololo dithata ditheibole dithekeniki dithekenoloji ditheo ditheong ditherisano ditherisanong dithitokgang dithobane dithoko dithole dithoromo dithota dithoto dithotse dithulaganyetso dithulaganyo dithulaganyong dithupa dithusathuto dithuso dithutiso dithuto dithutong dithwe ditilo ditiragalo ditiragalong Ditiragatso ditirelo ditirelong ditiriso ditiro ditirong ditirotheo ditlamego ditlamelo ditlamelwa ditlamo ditlamorago ditleliniki ditlha ditlhabi ditlhabololo ditlhaelo ditlhagiso Ditlhagisong ditlhaka ditlhakakgolo ditlhako ditlhaloganyo ditlhaloso ditlhamane ditlhamo ditlhangwa ditlhapi ditlhare ditlhareng ditlhase ditlhatlhobo ditlhatshana ditlhobolo ditlhogo ditlhogong ditlhogwana ditlhokego ditlhoko ditlhokwa ditlhong ditlhopha ditlhophana ditlhopheng ditlhopho ditlhophong ditlhotlho ditlhotlhomisi ditlhotlhomiso ditlhotlhwa ditlhotshwana ditlhwatlhwa ditlolo ditlwaelo ditogamaano ditokololo ditokololong ditona ditoro ditoropo ditoropong ditsala ditsamaiso ditsamaisong Ditsapelo ditsebe ditsebeng ditsela ditseleng Ditsha ditshedi ditshego ditshekatsheko ditshekiso ditsheko ditshelo ditshenyegelo ditshiamelo ditshika ditshipi ditshitshinyo ditsholofelo ditsholofetso ditshoswane ditshupetso ditshupo Ditshutiso ditshwaelo ditshwaelong ditshwanelo ditshwanelong ditshwantshetso ditshwantsho ditshwantshong ditshwene ditshwetso ditso ditsompelo ditsong ditswalo ditswammung ditswathutong ditsweletso ditswerere dituelelo dituelo ditulo ditumalano ditumammogo ditumanosi ditumediso ditumelano ditumelo diura diureng diyunibesithi duela duelang duele duelela duelele duelelwa duelelwang duelelweng duelwa duelwang duelwe dula dule duleng duma dumaduma dumalana dumalane dumedisa dumedise dumela dumelana dumelane dumelang dumele dumelela dumelelana dumelelane dumelelwa dumelelwe dumeleng dumelesegang dumeletswe dumeletsweng dumelwa dumetse dumisa ee Efa efe ela elang ele eleditse eleketeroniki elela eleletsa eletsa eletsang eletse eletsegang elwa ema emang eme emela emelang emele emelela emelwa emeng emetse emetseng emetswe emetsweng emisa emise emisetsa emisitswe emisiwa emoga ena ene eng engwa engwe eno eo epa epe epela epiwa esele esi etela etele etelela eteletse eteletseng eteletswe etelwa etetse etleetsa etsa etse etsho etsisa etswe fa faele fala fale falola falotse fana fano fapaana fapaaneng fapaanya faphegileng faretswe farologana farologanang farologane farologaneng farologanya farologanyang farologanye farologanyeng fatlha fatlhosa fatshe fe fedile fedisa fediseng feditse feela Fekese fela fele felela felelang felele feleletsa feleletse feleletseng felelwa feleng feletsa feletse feletseng feletswe felo fenngwa fensetere fentse fenya fepa Ferikgong feta fetang fete fetela feteletseng feteng fetile fetileng fetisa fetisediwa fetisetsa fetisitswe fetisitsweng fetisiwa fetoga fetogang fetoge fetogela fetogile fetogileng fetola fetole fetolela fetolelwa fetolwa fetotse fetsa fetse fileng filimi filwe filweng fisa fisang fitlha fitlhe fitlhegileng fitlhela fitlhelang fitlhele fitlhelela fitlhelelang fitlhelele fitlheleleng fitlhelelwa fitlhelelwang fitlhelelwe fitlheletse fitlheletsweng fitlhelwa fitlhelwang fitlhetse fitlhetswe fitlhile fiwa fiwang fiwe fodisa fofa foka fokodiwa fokotsa fokotsang fokotsega fola folaga fole fologa fologela folosa foo foreimi foromo foromong fosa fosagetseng fositse fuduga fuduge fudugela fudusa fudusiwa futshe ga gaabo gabedi gabone Gaborone gadima gadimela gae gaeno gaetsho gagamatsa gagametseng gago gagwe gaisa gaisana gaisanela gaisanelang gaisang gakala gakatsa gake gaketse gakgamaditswe gakgamadiwa gakgamala gakgamalela gakgamatsa gakgamatsang gakgamatse gakgametse gakologelwa gakologelwe gakolola gakolole gakololwa galaletsa galase gale gama gamarega gamaregile gammogo gana ganana ganang gane ganela ganelela ganeletse ganelwa ganetsa ganetsanya gangwa gangwe ganiwa ganne ganong gantsi gantsintsi gantsinyana ganwa gapa gape gararo gare gareng gasa gasang gase gasiwa gata gataka gatela gatelela gatelelwa gatisa gatisitswe gatisitsweng gatisiwa gatwe gaufi Gauteng go gobo godile godileng godimo godimodimo godingwana godisa godisang godisiwa godisiwang goeleditswe goeletsa goga gogang goge gogela gogwa gola golagana golagane golaganeng golaganngwa golaganya golaganyang golang gole golega golela goletse golo golola gololesegile gololesegileng gololosegileng gololwa gomotsa gompieno gona gone gongwe gonne gonnye Gonong gontse gontsi gope gopola gopolang gopole gopotsa gopotse gore goreng goroga goroge gorogela gorogile goromente gorosa gosomana gotlhe gotlhelele gotlhola gotsa gotse gouta gwanta gwasa gwetlha gwetlhang Gwi halofo hee hema hisetori holong huduga huma humanegileng humile humileng humisa hupa hupile hutshe ijesa ijoo ikadile ikaega ikaegile ikaegileng ikaegilwe ikaelela ikaelelang ikaeletse ikaeletswe ikaeletsweng ikakanya ikakanyetsa ikana ikantse ikanya ikanye ikanyega ikanyegang ikarabela ikatisa ikela ikemela ikemetse ikemetseng ikemiseditse ikemisetsa ikepela iketla iketleeditse iketlile iketlo ikgantsha ikgatlha ikgogela ikgogomosa ikgolaganya ikgolaganye ikgomotsa ikhumisa ikhutsa ikhutse ikisa ikitse ikobela ikonomi ikopa ikopanya ikopela ikotlhaela ikuela ikutlwa ikutlwe ikutlwela ikwadisa ikwalela ikwatlhaya ila ile ilediwa ileng iletswa iletswang ilwe ima ina inaakanya inama inaya ineela ineele ineetse ineng inong intaseteri inthanete intsha intshitse intshwarela intshwarele ipaakanya ipaakanyeditse ipaakanyetsa ipaakanyetse ipatlela ipaya ipeela ipela ipelafatsa ipelela ipha iphetola iphimola iphitlha iphitlhela iphitlhile iphotlhere ipitsa ipoeletsa ipolaya ipolela ipolelela ipoleletse ipona iponatsa ipone iponela ipotsa ipusang ipusolosetsa isa isago isagong isagweng Isaka isang ise isegang iseng isetsa isitse isiwa isiwe isong itapolosa itatlhela itatola itatswa itaya itebaganya itebala itebatsa itebetse iteile iteilwe iteka itekanela itekanetse itekanetseng itekanya itelekela itemogela itemogele itemogelo itepa itepatepanya itewa ithata itheile ithekela ithoma ithusa ithuta ithutang ithute ithutela ithuteng ithutile ithutileng ithutilweng ithutiwa itidimalela itidimaletse itira itire itirela itiretse itirile itisa itise itisitse itlama itlamile itlhaganela itlhaganelela itlhalosa itlhamela itlhamelang itlhoboga itlhoboge itlhobogile itlhokomela itlhokomolosa itlhoma itlhophela itlhophele itlhophelo itlhophetseng itlhophetsweng itlosa itlwaetsa itoma itsa itsamaela itsane itsaya itse itseela itsege itsegeng itseng itsetsepela itsewe itseweng itshasa itshekileng itshekologileng itshela itshepa itshepang itshidila itshireletsa itshoka itshokela itshola itsholela itsholelo itshupa itshupile itshwara itshware itshwarela itshwarele itshwarelela itshwere itsile itsise itsisitswe itsisiwe itsiwe itswela itulela itumedisa itumedisang itumediseng itumedisiwa itumela itumele itumelela itumelelang itumelele itumeletse itumetse iwa iwe ja jaa jaaka jaana jaanong jalo Janenyana jang je Jehofa jela Jerusalema jeseng Jeso Jesu jewa jo Joele Johane jona jone jono joo jotlhe jwa Jwaneng ka kabelano kabelelo kabelo kabinete kabo kabong kadimo kae kaedi kaela kaelang kaelo kaelong kaelwa kaelwang kagiso kago kailweng kaiwa kaiwang kakanyo kakanyokgolo kakaretso kake kakeng kakgelo kala kalafi kalafo kalo kalokalo kamano kamanong kamego kamogelo kamoreng kampana kana kanakana kanakang Kanana kanedi kaneding kanelo kang kankere kanoka kante kantoro kantorong Kanye kao kapa kapodisa kapodiso kara karabo karaki karata karateng kare kareng karolo karolong karolothuto Karolothutong karolwana karolwaneng Kasete katisa katiso katlego katlholo katoga katse kaya kayang ke Kedisaletse keetane Kelapile keledi keleka keletso keletsong kelo kelotefo kelotlhoko kemedi Kemisetso kemo kemong kemonokeng keng kerafo kerafong kereiti kereiting kereke kerekeng Keresemose kete keteka keteke Ketelelapele ketla ketleetso kgaba kgabaganya kgabaganyo kgabagare kgabetsakgabetsa kgabile kgabisa kgabo kgabola kgadile kgaisano kgaitsadi kgaitsadia kgaitsadie kgaka kgakala kgakalakgakala kgakalo kgakgamalo kgakgamatso kgakge kgakololo kgala Kgalagadi kgalalelo kgalaletso kgale kgalema kgalemela kgalemo kgalwa kgama kgamelo kganela kganelwa kganetsano kganetso kgang kgannyeng kgantele kgaodiwa kgaoga kgaogana Kgaoganang kgaogane kgaoganngwa kgaogano kgaogantswe kgaoganya kgaoganye kgaoganyo kgaola kgaole kgaolo kgaolong kgaolwa kgaotsa kgaotse kgapela kgapetsa kgapetsakgapetsa kgapha kgaphela kgaphetswe kgarakgatshega kgaratlha kgaratlhela kgaratlhelang kgaratlho kgarebe kgaso kgatako kgatelelo kgatelopele kgathalelwe kgathalesege kgatiso Kgatleng kgatlha kgatlhang kgatlhanong kgatlhantsha kgatlhe kgatlhegela kgatlhegelo kgatlhego kgatlhegong kgatlhisang kgatlhwa kgato kgatong kgelelo kgetha kgethegileng kgethilweng kgethiwa kgetholola kgethololo kgethololwa kgetla kgetsana kgetsaneng kgetse kgetseng kgo kgoba kgobalo kgobelelo kgobokantsweng kgobokanya kgobokanyo kgodiso kgodisong kgodu kgoeletso kgofa kgogedi kgogela kgokagano kgokaganyo kgokgontsha kgolafalo kgolagano kgolaganong kgole kgolegelo kgolegelong kgolo kgologolo kgolokwe kgololesego kgololosego kgololosegong kgolong kgolwane kgoma kgomaretse kgomo kgomola kgomotso kgona kgonagala kgonagalang kgonagale kgonagalo kgonang kgone kgonega kgonegang kgonege kgonego kgoneng kgonne kgonnye kgono kgontsha kgontshang kgonwa kgopa kgopo kgopolo kgora kgore kgoreletsa kgoreletsang kgoro kgorong kgorwana kgosana kgosi kgosing kgothatsa kgotla kgotlakatlholo Kgotlakgolo kgotlapeomolao kgotlapeomolaong kgotlatshekelo Kgotlatshekelokgolo kgotlatshekelong kgotlelelo kgotleng kgotlhang kgotlho kgotsa kgotsofaditse kgotsofala kgotsofalo kgotsofatsa kgotsofatsang kgotsofetse kgotswa kgwa kgwanyakgwanya kgwe kgwebisano kgwebo kgwebong kgwedi kgweding kgweetsa kgwele kgwetlho khamera khampani khampase khampaseng khansele Khanseleng kharikhulamo kharikhulamong Khatleloko Khempase Khiro Khonferense Khonferenseng khopi Khouta khoutu khudu khuduga khuduthamaga khumanego khumo khunologo khupamarama khurumetsa khutla khutleng khutlotharo khutsa khutsana khutshwane khutshwe kile kileng kitla kitlaneng kitsiso kitso kitsong ko koafatsa koba kobamelo kobamo kobile kobiwa kobo kokelo kokelong kokelwaneng koketsego koketso koko kokoano Kokoanong kokoanopeomolao kokoanya kokoanyo kokonelwa kokota kokotela kolobe kolobediwa kolobetsa kolobetso kolobile koloi koma komakoma komelelo komiti komota konokono konosetsa konteraka koo kopa kopana kopanang kopane kopanela kopanelo kopaneng kopanetsweng kopang kopanngwa kopano kopanong kopantswe Kopantsweng kopanya kopanyang kopanye kopanyo kope kopela kopelo kopi kopile kopiwa kopiwang kopiwe kopo kopong kopore kotara kotlhao kotlo kotsi kotsing kumako kuranta kutlo kutlobotlhoko kutlwano kutlwelo kutlwelobotlhoko kutlwisiso kwa kwadile kwadileng kwadilwe kwadilweng kwadisitsweng Kwadiso kwadiwang kwala kwalang kwalela kwalele kwaleng kwaletswe kwalo kwalolola kwalolole kwalong kwalwa kwalwe Kwana kwano kwena la Labobedi Labone Laboraro laeborari laela laelana laele laelwa laesense laetse laetswe laetsweng lala lale lalediwa laletsa laola laolang laolwa laolwang laotswe laotsweng lapa lapeng lapile lapisa lapisitswe latela latelana latelanang latelang Latelanya latele lateleng latelwa latelwang latlha latlhe latlhega latlhegelwa latlhegetswe latlhegile latlhegileng latlhela latlhele latlhelwa latlhetse latlhile latlhisa latofadiwang latola latsa latse latswa laya le leago leano leanong leba lebagana lebagane lebaganeng lebaganya lebaganye lebaganyeng lebaka lebakanyana lebakeng lebala lebale lebaleba lebaleng lebana lebaneng lebang lebanye lebati lebatsa lebe lebega lebegang lebege lebela lebele lebelela Lebelelang lebelele lebelelwa lebeletse lebeletseng lebeletswe lebeletsweng lebelo lebenkeleng lebese lebetse lebile lebilwe lebisa lebisang lebisitse lebisitswe lebisiwa lebisiwe lebitla lebitleng leboa leboga Lebogang lebogela lebogo leboko lebokong Lebolelamading lebone lebopo lebota ledi lediri leele leeto lefa lefapha lefapheng lefatshe lefatsheng lefe lefela lefelo lefelong lefetiso lefifi lefisiwang Lefitiko lefitshwana lefoko legaba legadima legae legaeng legala legano leganong legetla legodimo legodimong legodu legofi legogo legolegwa legolo Legone legong legora legotlo lehuma leina leinane leinaneng leineng leino leitlho leka lekala lekalekana lekalekanang lekalekane lekalekanya lekaleng lekana lekanang lekane lekaneng lekang lekanngwa lekanya lekanye lekanyeditsweng lekanyediwa lekanyeng lekanyetsa lekatane lekawana lekeleditswe lekelela lekeletsa lekgarebe lekgetho lekgetlong lekgolo lekgotla lekgotlapeomolao lekgotleng lekile lekoko lekola lekolwane lekwalo lekwalong lela lelala lelang lelapa lelapeng lele leleele leleka lelela leleme leleng leletsa leletse leloko lelwapa lelwapeng lema lemile lemoga lemogang lemoge lemogile lemogileng lemogiwa lemogwa lemorago lemosa lemotsha lemotshega lenaane Lenaanefoko lenaaneng Lenaanethuto Lenaanethutong lenaga lenaneo lenaneong lenao leng lenga lengangale lengole lengwa lengwe leno lentle lentsho lentswe lentsweng lenyalo lenyalong lenyatso leo leofa leofile lepa lepalepana lepe lephata lephateng lepodisi lerapo leratla lerato lere Lereo lerole leruri lesa lesaka lesakaneng lesakeng Lesang lese lesea lesedi lesego leselo lesika lesilo lesire leso lesome lesomenngwe lesomo leswa leswe leta letela letetse Lethosa letile letiro letla letlalo letlang letlapa letlatlana letle letlelela letlelelang letlelelwa letleletswe letlha letlhabaphefo Letlhakane letlhakore letlhakoreng Letlharapa letlhoko letlhomeso letlhoo letlole letlotla letlotlo letsa letsapa letsatsi letsatsing letse letsela letsele letsema letseng letseno letshogo letsholo letshwao letso letsogo letsogong letsomo letsopa letswa letswalo letswele lewatle litara litheresi lo loago loagong loapi loaping lobaka lobakanyana lobakeng lobati lobating Lobatse lobela lobelo lobone lobopo lobopong lobota loeto loga logaga logaganeng logaganya logageng logolo logong logora lokologileng Lokolola lokwalo lokwalong lolama lolamang lolameng lole lolea loleele loleme loma lomaganeng lomaganngwa lomaganya lomepe lomiwa lona lonaka lonao lone longwa longwe Lontone loo lookwane lopa lopang lopiwang lora lorato lorole losea losika losikeng loso losong lotlhe lotseno lotso lwa lwala lwalang lwale lwantsha lwela Lwetse maabane Maaforika maaka maano maatla maatlafatso mabadi mabaka mabakeng mabala mabapi mabedi mabela mabele mabelo mabenkele mabenkeleng maboa mabogo mabogong maboko mabole mabolelo mabono Mabopane mabotlolo madi madiba madila mading madinyana madirelo madirelong madiri madisong maduo mae maeba maele maemedi maemo maemong maeto maetsi Maetsisi mafapha mafapheng mafaratlhatlha mafatlha mafatshe mafatsheng Mafatshwa mafelo mafelong Maferaneng Mafikeng mafisa mafoko mafokong mafolofolo magae magaeng magala magaleng Magare magareng magatwe magetla magetleng magodimo magodu magolo magosi magwafa mahala maikaelelo Maikaelelomagolo maikaelelong maikano maikarabelo maikemisetso maikemisetsong maikepo maikuelo maikutlo maina mainane Maipolelo Maipolelong maiteko maitemogelo maitemogelong maitiso maitisong maitlamo maitlhomo maitseboa maitseboeng maitseo maitshetlego maitsholo maitsholomantle maitshwarelo maitshwaro maje makaelagongwe Makakabele makala makaleng Makepe makgabe makgakga makgaolakgang makgarebe makgasa makgoba makgolo makgotla makgwafo makgwakgwa makhubu makhutshwane makoa makoko makolwane Makomonisi makopanyi Makotopong makwalo mala malao malapa malapeng malata malatodi malatsi malatsing malatsinyana maleba malebana Malebo maleele maleka maleng maleo malepa maloba maloko malomaagwe malome malwapa malwapeng malwetse malwetsi Mamelodi mametlelelo mametlelelong Mametse Mamothamane manaane manaaneng manaanethuto Manaanethutong manane mananeo mananeong mang mangana manganga mangole Mangope mangwe manno mannong mannye manoko manokonoko manong manontlhotlho mantle mantsho mantsi mantswe maoto maotong maotwana maphakela maphata maphataphata maphateng maphikophiko maphodisa mapodisi mapodising Mapolotiki maragaraga marago maragong marama marang maranyane marapo marara mararaane mararo marata marataro marekisetso marekisetsong Mareko mareledi mareo marobalo maroo maropeng marothodi Marotsi marung masa masakaneng masalela masea Masedi masego maseka masela masepala masesane masetla masigo masika Masilo Masilonyana masimo masimong Masire masisi masole masome maswabi maswe masweu Matebele Matete mathata mathateng mathe Matheka matla matlakadibe matlakala matlalo matlapa matlapana matlha matlhagatlhaga matlhakore matlhale matlhalosi matlhano matlhaodi matlhare Matlhareng matlho matlhoko matlhong matlhotlhapelo matlo matloboithusetso matlole matlong matlotlo matlwana Matome matona matsalaagwe matsalo matsapa matseno matsetseleko matshediso matshelo matshelong matsholo matsholotshireletso matshosetsi matshwanedi matshwao matshwaopuiso matshwenyego matsogo matsorotsoro matswakabele maungo maya me mebala mebaraka mebedi mebele mebila mebileng mebuso medi mediriso mediro medumo medumopuo meepo meepong meetlo Meetlong mefama mefoko mefuta mefutafuta mefuteng megala megare megatlana megolo megopo megopolo mekamekana mekgatlho mekgatlhong Mekgatlhopotlana mekgwa mekgweng mekhutshwane mekwalo mela melaetsa melao Melaotlhomo melato melawana melebo meleele melelwane melelwaneng melemo meletlo melodi melomo melora mengwe meno mentle mentsi menwana meono mephato meraba merabaraba merafe merakeng meraro merero mererong meriti merogo merwalo mesese Mesia mesima mesola metara methale methalethale metheo metlae metlha metlhala metlhano metlheng metlholo metlotlo metsa metsamao metse metsemagae metsemegolo metseng metseselegae metsesetoropong metshameko metshamekong metsi metsing metso metsotso metsotswana metswedi metsweding mewa mma mmaabo mmaago mmaagwe mmaba mmabaoki Mmabatho mmadi Mmadikgomo Mmadinotshe Mmaetsho Mmakgosi mmala Mmaletsatsi Mmalo mmalwa Mmama Mmamakwa Mmamosadinyana Mmamotsetsi mmangwana mmangwane Mmanoka Mmantswa mmapa mmapeng Mmapula mmaraka mmarakeng Mmasegwagwa mmasepala mmata mmatla mmatlela mmatota Mmatseleng mmaya mme mmele mmeleng mmenyana mmepe mmereko mmetsa mmetse mmila mmileng mmiletsa mmino mmitsa mmogo mmoki mmolaya mmolelela mmolelele mmoleletse Mmoloki mmona mmonang mmone Mmoni mmontsha mmopa mmopi mmotlana mmotorokara mmotorokareng mmotsa mmu mmueledi mmuisano mmuisi mmung mmuo Mmusakgotla mmusetsa mmuso mmusong mo moagi moago moaka moakanyetso moanelwa moano moatlhodi Moatlhodimogolo modi Modimong Modimothebe modirakopo modiredi modiri modirisi modiro modisa Modise Modulasetilo modumedi modumo Moeding moemedi moeng moengele moeteledipele moeti mofatlha mofenyi mofuta mogadibo mogae mogaka Mogakgo mogala mogale mogaleng mogang Mogapi mogatla mogatsa mogatse mogobeng Mogodimodimo Mogoditshane mogodu mogogoro mogokgo mogolo mogologolo mogolokwane mogolole mogolwane mogoma mogopo mogopolo mogopong Mogorosi mogote Mogwase mogwe mohumagadi mohumi moithuti moithuting moja mojako mojakong mokaedi mokapelo mokaragana Mokeresete mokete Mokgadi Mokganedi Mokgatla mokgatlho mokgatlhong mokgoro mokgorong mokgosi mokgwa mokgwaro mokgwasa mokgweetsi mokgweng mokhanselara Mokhuduthamaga mokhutshwane moko mokoko mokola mokolwane mokong mokopi Mokotedi mokwadi Mokwadisi mokwaledi mokwalo mokwalong mokwatla mokwatleng Mokwena mola molaetsa molala Molalatladi molaleng molamu Molane molao molaodi molaong molaotheo molaotheong molaotlhomo Molaotlhomong molapo molapong Molatlhedi Molatlhegi molato molawana molawaneng Molebatsi molebo moleele Molefe molekane Molelemedi molelo molelong molelwane molema molemeng molemo moleng moleofi Molepolole moletlo moletlong molodi molomo molomong molora Molosi molotsana molwetse mona monana monate mong Mongwaketse mongwe monna monnamogolo monneng monnye monongwaga monono montle montsho montsi monwana Monwedi monyenyo monyo moo mooki moono mopati mopeleto Moperesiti mophane mophato mophatong Mopitlwe moputso moraba morabaraba morabeng morafe morago moragonyana moraka morakeng Moranang moratiwa moratwa Morebodi moreetsi moreki morekisi Moreri morero morerong morethetho moretlwa moretologa moribo moriti moriting moro Morobi morogo moroko morokotso Morolong morongwa Morongwanyana mororo moroto Morotsi morula Moruleng morumo Moruni morutabana morutabaneng moruti morutisi morutseng morutwa morutwana morwa morwadi morwadie morwalela morwalo mosadi mosadimogolo mosading mosadinyana Mosarwa moselomaswe mosenatoro mosepele mosesane mosese mosetsana mosetsanyana mosi Mosidinyana mosima mosimane Mosimanegape mosimanyana Mosimegi mosimeng Mosireletsi moso mosola mosong Mosupatsela mosupi moswang mosweu moswi motantsho mothale mothamo mothapi mothapiwa motheo motheong Mothibi motho mothofatso mothong mothusi Motimedi Motingwa motlaagana motlaaganeng Motlagorileng motlakase motlamedi motlha motlhaba motlhala motlhana motlhang motlhanka motlhankedi Motlhankedimogolo motlhankeding motlhatlhelwa motlheng Motlhodi motlhofo motlhokomedi Motlhologadi motlobo motlobong motlogolo motlopi Motlotlegi motlotlo motlotlong motogo motona motsadi Motsamaisi motsamao motsana motsaneng motse motsemogolo motseng motsetse motshameko motshamekong Motsheganong motshegare motsheo motshitshi motsholalelapa motsing motso motsomi motsotso motswako Motswana motswedi Motsweding motswere mowa moweng moya mpa mpampetsa mpeng mpetsa mpha mphe mphitlhela mpho mpitsa na naane nabo naga nagana nageng naka nako nakong nakwana nala naledi nama namagadi namana namane nameng Nametso namile namileng namolo nanabela nang nao nare natefisa natla natso naya nayang nayo ne neela neelana neelanang neelane neelang neele Neelo neelwa neelwang neetse neetswe neetsweng neile neilwe neilweng nele nene neng neo nepagalo nepagetseng nepo nesa netefatsa netefatse netefatseng netse newa newang ngadile ngaka ngakeng ngala ngangisano ngaparela ngata ngatana ngogola ngoka ngongorega ngongorego ngwaga ngwagakgolo ngwageng ngwana ngwanaka ngwanake ngwananyana ngwaneng ngwanyana ngwao ngwedi ngweding ngwetsi nka nkabo nke nkga nkgo nkgonne nkila nkitla nkitse nko nkoko nkokoagwe nkong nna nnaka nnake nnana nnang nne nneele nnela nneng nnete nnetse nngwe nnile nnileng nno nnotsididi nnyaa nnyaya nnye noga noka nokeng noko nole nolofatsa nomore nomoro nona nong nonne nonneng nonofetseng nonofile nonofileng nonofo nonotsha nonotshwa nonyane nopola nopolo nosa nosetsa nosi nta ntata ntate ntatemogolo nte ntekwane ntena nthata ntheetse ntho nthobetse nthusa nthuse nthuta ntlafatsa Ntlale ntle ntlha ntlhakgolo ntlhana ntlheng ntlhopheng ntlo ntloboithusetso ntlogela ntlong ntlwana ntlwaneng ntsala ntsalae ntsaya ntse Ntseana ntseng ntsetse ntsha ntshana ntshang ntshe Ntshegeng ntshetsa ntshitse ntshitseng ntshitsweng ntshiwa ntsho ntshosa ntshwe ntsi Ntsimane ntswa ntswe ntsweng ntwa ntweng nwa nwe nwela nya Nyaa nyala nyalana nyalane nyalang nyale nyalo nyalwa nyalwe nyana nyatsa nyelediwa nyelela nyeletsa nyeletse nyenya nyetse nyetswe nyonya oba obama obamela obamele ofe ofisi ofising oka okama okamela okeditsweng okediwa oketsa oketsega oketsegang oketsegileng okola okomela okwa ole ona one ono oo opa ope opela opele opelela opelwa ota otla otlang otlhaiwa otlhe otsela paakanyo Pabalelo pabalesego pagama paka pakajaanong pakeng pala palama palame palamente palela palelwa palelwang palelwe paletse paletswe palo palogare palogotlhe palong palotlotlo pampiri pampiring pampitshana papamatsa papatso papetla papetlana pataganeng patelediwang patelesega patelesege pateletsa pateletso pateng patlelong patlisiso patlisisong Paulo pedi pega pegelo pegelong pego Pegong peipi Pekwa pela pelaelo pele pelegi peleta pelo pelokgale Pelompeta pelong pelotlhomogi pena pene penologa peo peomolao peomolaong pepeneneng Pesalema petelelo petse pha phakela phakelela phala Phalane Phalantle phamola Phanele phaposi phaposiborutelong phaposing Pharagatlha pharakano pharologano pharologanyo phasaladitswe phasaladiwa phasalatsa phasalatso phate phatla phatlalala phatlalatsa phatlalatseng phatleng phatlha phatlhatiro phatlho phatlola Phatshwana phatsima phatsimang Phatsimo Phatwe phefo phekelo phela phelang pheletso phenyo phepa phepafalo phepafatsa phepafatso phetelela phetiso phetogo phetolo Phikwe phimola phimolwa phimolwe phiri phirima phirimane phitlhelelo phitlho phogwana phoka phoko phokotsego phokotso pholesi pholisi pholo phologolo phologotswana pholong phoso photha photi phousetara Phukwi phuphung phutha phuthega phuthego phuthegong phuthela phuthile phuthologa phuthologileng phuthologo phutholola phuti piletso pina pinagare Piti pitsa pitsana Pitsane pitse pitseng pitso pitsong Plaatje po podi Poelano poeletso poelo poelothuto poifo poko polanete polao polaseng polelo polelong polelonolo Polokego polokelo polokesego poloko poloto ponagalo ponelopele pono pontsheng ponyo popego popegopuo popo popomatsa popota poraefete poraemari Porofaele porofaeleng porofentshe porojeke poso pota Potchefstroom Potefolio potile potlako potlana potologa potso potsolotso puisano puisanong puisanyo puiso pula puo puong puso pusong pusoselegae pusoselegaeng ra raela raelwa rakana rakgadi Rala ralala raletse ramolao rangwane ranola ranolela ranoletswe ranolwa Rantshobotho rapama rapame rapela rapele rapelela Rara rarabolola rarabololeng rarabololwa rarolola rata ratana ratanang ratane ratang rategang ratela rateng ratile ratwa ratwang raya rayang re rebola rebole reboletsweng rebolwa rebotswe rebotsweng reetsa reetse refosanya reile reka rekang reke rekela reketse rekile rekisa rekisang rekisetsa rekisiwa rekisiwang rekota rekoteng rekotiwa rekoto rekotong rekwa relela remeletse rena reng rera rerisana retelelwa retologa retologela reye ribolola rile rileng roba robala robalana robale robatsa robedi robega robegile robetse robetseng robong robongwe roga rogwa roka rola rolela roletsweng roma romela romele romelela romelwa romelwang rometsweng romile romilwe romo rona rone rongwa roroma rotha rothe rothisa rotlhe rotloediwa rotloediwang rotloetsa rotloetsang rotoga rotola rra Rraagwe Rraetsho rre rua rulagana rulaganeng rulaganngwa rulaganngwang rulagantse rulagantswe rulagantsweng rulaganya rulaganyeditswe rulaganyeditsweng rulaganyetsa rulaganyetsang rumisanang runa ruri ruta rutang rute rutegile ruteng rutha rutile rutileng rutilwe rutiwa rutwa rutwang rwala rwale rwalela rwalwa rwele rweleng rwesa sa Saatane Sabata sadisa saena saeniwa saennwe saense saentshe saenwa saila sakeng sala salang sale salela saleng saletse sanetasi Satalaete Satane Satelaete se seabe Seabo Seaforika Seaforikanse seane Seaparo seatla seatleng seba sebaka sebakanyana sebakeng sebaseba sebata sebe sebele sebete sebetsa sebilo Sebina Seboba sebodu Sebokeng seboko Sebolayakgama sebopego sebopegong Sebopela sebopiwa sebui sediba Sedibana sedibeng sedidi sedifatsa sedifetseng sedika Sedimonthole sedimosetsa sediri sedirisiwa sediriswa sedirwa seditse sedumedi seele seelo seemo seemong seeng Seesemane Seesimane Seesimaneng Seetebosigo sefane sefapaano sefatlhego sefatlhegong sefe sefela sefofane sega Segadimo segakolodi segalo segalona Segametsi seganka Segerika segetswe segiwa sego segokgo segole segolo segolobogolo segologolo segolwane Segomotso segompieno segopotso segotlo segotlong segwa Sehebera sehuba sejanaga seka sekaelo sekai sekaka sekakeng sekao sekapuo sekaseka sekasekang sekaseke sekasekeng sekasekiwa sekasekiwang sekasekwa seke sekele sekeleng sekeng sekepe Sekeresete sekete sekgala sekgamu sekgamung sekgele Sekgoa sekgoreletsi sekgoropeng Sekgotsheng sekgwa sekgweng Sekhurumelo sekisiwa sekobo sekolo sekolong Sekoma Sekontari sekwa sekwalo sela selalelo sele selebalo seleele selefatshe selefera selegae selegodimo selekano selekanyo selekanyong selelo selemo Selepamagodimo selepe selo seloago Seloka seloko selotlele selwa sematla seme semelo semmuso semolao semolaotheo semorafe semowa semoya sena senama senana senatla seng sengwe sengwenyana senka Senkepeng senkgwe senngwa Senno sennye seno senola senolwa senolweng Senoto sentle sentlhaga sentse sentsha senya senyang senye senyega senyegile senyegileng Senyete senyetsa seo Sepa sepalangwa Sepane sepe Sepedi sephiri sephiring sephuthelo sepodisi sepolotiki sera seralwa serame serapeng serati seretse seriti seriting serodumo seromamowa serope seruiwa serutwa sesa sesadi sesepa Sesigo sesiro sesole Sesotho sesupo Seswati setaele sete Setebele Setefikeiti setegeniki Setempe sethakga sethalo setheo setheong setho sethoboloko Sethosa sethwe setifikeiti setilo setilong setlamo setlankana Setlatlwe setlega setlege setlha setlhabelo setlhako setlhangwa setlhare setlhareng setlhatshana setlhoa setlhogo setlholo setlhongwa setlhopha setlogolo setlolo setona setopo setori setoto setse setseng setsenwa setsha setshego setshwakga setshwano setshwantsho setshwantshong Setsiba setso setsong setswalo Setswana Setswaneng setswe setswerere setu setulo setulong Sevenda seyalemowa Sezulu sia siama siamang siame siamela siamelang siameng siametse siametseng siamisa siamise siamisiwe sika sila simologa simologile simolola simololang simolole simololwa simolotse sireletsa sireletsang sita sobokantsweng sobokanya sola solofeditse solofela solofele solofelwa solofelwang solofetsa solofetsang solofetse solofetswe solofetsweng Solomone somarela somola sona sone sosobanya sosologileng sotla sotlang sotlega sotlhe sotlwa sotlwang sule suleng supa supang supe supegetsa supetsa supile supileng supilwe supilweng supiwa supiwang suta Sutasuta sutela sutisa sutisiwa sutlha swa swang swe sweditse swela swele sweng swetsa swetsang swetse swetswa swetswe swetsweng taboga tabogela tabogile taelo tafole tafoleng taka tala taletso tanka taola taolo taolong tata tatelano tatlhegelo Tautona Tebagano tebang Tebanyo tebego tebelelo tebelo tebelopele tebo tebogo tefo teilwe tekano tekanyetso tekanyetsokabo tekanyetsong tekanyo tekatekano tekatekanong tekatekanyo tekatlhaloganyo tekelelo tekeletso teko telele tema temakgang temana temaneng temo temogo temokerasi temoso temothuo temothuong tempele tena tenega tenegile tenego teng terama terameng terena tetla tetlanyo tetlelelo tewa thaba Thabang thabeng Thabo thaka thala thaletsweng Thamaga thamo thanodi thanoding thanolo thanya thapa thapama thapelo thapelong thapilwe thapilweng thapiwa thapo tharabololo thari tharo tharong thata thataro thatathata thato thebe thebolo theeletsa Theetso theilwe theilweng theiwa thekeniki thekenoloji thekisi thekiso theko thekololo thelelo theo therisano thetha thiba thibela thibelang thibele thibelela thibelo thibile thipa thoba thobalano thobane thobo thokgameng thokgamo thoko thola tholo thopa thopilweng thotloetso thoto thuba thubaganya thubakanyo thubega thula Thulagano thulaganyetso thulaganyo thulaganyong thulamela thulametse thulana thuma thupa thusa thusana thusang thuse thusitse thusiwa thusiwe thuso thusopotlako thutalefatshe thutapuo thutlwa thuto thutong tidimalo tiileng tiisa tiiseditse tiiseng tikela tikologo tikologong tila tima timela timetsa timetse tiragalo tiragalong tiragatso tiragatsong tirelo tirelong tirisano tirisanommogo tiriso tirisong tiro tirong tironyana tirwa tla tlaa tlaare tladi Tladinyane tladitse tladitswe tladitsweng tladiwa tlakisa tlala tlalatlala tlale tlaleletsa tlaleletsang tlaleletso tlaletso tlama tlamega tlamela tlamelang tlamele tlameleng tlamelo tlamelwa tlamelwang tlamo tlamparela tlang Tlapeng tlase tlatsa tlatse tle tlela tlelase tlelaseng tlele tlelwa tleng tletse tletseng tlhaba Tlhabakane tlhabana tlhabang tlhabe tlhabela tlhabele tlhabeletsa tlhabile tlhabisa tlhabiwa tlhabologang tlhabologo tlhabolola tlhabololang tlhabololeng tlhabololo tlhabololong tlhabololwa tlhabolotswe tlhabolotsweng tlhaela tlhaelang tlhaeletsa tlhaeletsana tlhaeletsano tlhaelo tlhaetse tlhaga tlhagang tlhagelela tlhagelelang tlhageng tlhagisa tlhagisang tlhagise tlhagisitseng tlhagisitswe tlhagisitsweng tlhagisiwa tlhagisiwang tlhagiso tlhagisong tlhagiswa tlhago tlhagola tlhaka tlhakana tlhakane tlhakanela tlhakanelo tlhakanetse tlhakanngwa tlhakanya tlhakatlhakana tlhakatlhakane tlhakatlhakanya tlhakatlhakanye tlhako Tlhakole tlhala tlhale tlhalefa tlhalo tlhaloganngwa tlhalogantse tlhaloganya tlhaloganyana tlhaloganyang tlhaloganye tlhaloganyeng tlhaloganyesega tlhaloganyesegang tlhaloganyo tlhaloganyong tlhalosa tlhalosang tlhalose tlhalosetsa tlhalosetse tlhalosetso tlhalositswe tlhalositsweng tlhalosiwa tlhalosiwang tlhaloso tlhama tlhamalalela tlhamalalo tlhamaletse tlhamaletseng tlhamane tlhamela tlhameng tlhametsweng tlhamilwe tlhamilweng tlhamiwa tlhamiweng tlhamo tlhamolola tlhamololo tlhangwa tlhangwe tlhano tlhanola tlhaola tlhaole tlhaolele tlhaoletsweng tlhapa tlhape tlhapi tlhapile tlhapileng tlhapisa tlhase tlhasela tlhaselo tlhasetse tlhasetswe tlhatlega tlhatlhanya tlhatlhela tlhatlhelo tlhatlhelwa tlhatlhoba tlhatlhobe tlhatlhobeng tlhatlhobiwa tlhatlhobo tlhatlhobong tlhatlhojwa tlhatloga tlhatlogela tlhatlosa tlhatloso tlhatsa tlhatswa tlhatswe tlhatswetsa tlhe tlhoa tlhoafaletse tlhoafalo tlhobaela tlhoboga tlhobogile tlhobolo tlhodia tlhodile tlhodileng tlhoga tlhogo tlhogong tlhogwana tlhoka tlhokafala tlhokafalang tlhokafale tlhokafetse tlhokafetseng tlhokagala tlhokang tlhoke tlhokega tlhokegang tlhokege tlhokego tlhokile tlhokisa tlhoko tlhokomela tlhokomelang tlhokomele tlhokomeleng tlhokomelo tlhokomelwa tlhokomologa tlhokwa tlhokwang tlhola tlholana tlholang tlhole tlholego tlholeng tlhologeletswe tlholwa tlholwang tlholwe tlhoma tlhomagana tlhomagane tlhomaganya tlhomameng tlhomamisa tlhomamise tlhomamisetsa tlhomamisitswe tlhomamisitsweng tlhomamisiwa tlhomamiso tlhomamo tlhomang tlhome tlhomile tlhomilwe tlhomilweng tlhomiwa tlhomiwang tlhomogela tlhomola tlhoname tlhongwa tlhopha tlhophe tlhophile tlhophileng tlhophilwe tlhophilweng tlhophiwa tlhophiwang tlhopho tlhophololo tlhophong tlhotlha tlhotlhe tlhotlheleditsweng tlhotlhelediwa tlhotlhelediwang tlhotlheletsa tlhotlheletsang tlhotlheletso tlhotlhololo tlhotlhomisa tlhotlhomisi tlhotlhomiso tlhotlhwa tlhotsa tlhotse tlhotseng tlhotswe tlhwaafalo tlhware tlhwatlhwa tlile tlileng tlisa tlisang tlise tlisetsa tlisitse tlisiwa tlisiwang tliswang tlo tlodile tlodiwa tloga tloge tlogela tlogelang tlogele tlogelo tlogelwa tlogetse tlogetseng tlogetswe tlogetsweng tlogile Tlokwe Tlokweng tlola tlolaka tlolang tlole tlolela tlolomolao tlolwa tlosa tlosiwa tloso tloswa tlotla tlotle tlotlegang tlotlela tlotlo tlotlofoko tlotlong tlotlontswe tlotlwa tlotse tlwa tlwaela tlwaelegang tlwaelegileng tlwaelesegang tlwaelesegileng tlwaelo tlwaetse tlwaetseng tobeletso tobetsa togamaano tokafaditsweng tokafadiwa tokafadiwang tokafala tokafatsa tokafatse tokafatso tokafetseng tokologo tokololo tolamo tomagano Tomaganyo tomoga tona Tonakgolo tonanyana topo toro torong toropo toropong tota totobalo totobatsa totobetseng tsa Tsakane tsala tsalana tsale tsalela tsaleng tsalo tsalwa tsamae tsamaela tsamaelana tsamaelanang tsamaelane tsamaelang tsamaile tsamaisa tsamaisana tsamaisanang tsamaisane tsamaisang tsamaisiwa tsamaisiwang tsamaiso tsamaisong tsamaisopuso tsamaong tsamaya tsamayang tsame tsapa tsatsi tsatsing tsaya tsayang tse tsebe tsebeng tsebetsebe tsee tseela tseele tseelwa tseelwang tseelwe tseetse tsela Tselanngwe tsele tseleganya tseleng tsena tsenang tsene tsenela tsenelela tseneletseng tseneng tsenngwa tsenngwe tseno tsentse tsentseng tsentswe tsentsweng tsenwa tsenwe tsenya tsenyang tsenye tsenyeletsa tsenyeng tseo tsepama tsepameng tsepamisa tsepamiso tsere tsereganya tsereganyo tsereng tserwe tserweng Tsetsana Tsetsena tsetseng tsetswe tsetsweng tsewa tsewang tsewe tseye tseyeng tshaba tshabela tshabile tshabisa tshaeno tshameka tshamekang tshameke tshamekela tshamekisa tshasa Tshedifatso tshedile tshedileng tshedimosetso tshega tshegatshega tshege tshegeditse tshegeditsweng tshegediwa tshegediwang tshegela tshegetsa tshegetsang tshegetseng tshegetso tshegisa tshegisang tshegofatso tshekatsheko Tshekedi tshekiso tsheko tshela tshelang tshele tshelela Tshelo tshelwa Tshenolo tshenyegelo tshenyo tshepa tshepe tshepo tshesane tshetlha tshetlhana Tshetlho tshetse tshiamelo tshiamiso tshiamo tshiamololo tshika tshikeng tshikinya tshilwana tshimo tshimologo tshimologong tshimololo tshimong tshingwana tshipi tshireletsego tshireletso tshisinya tshitshintsweng tshitshinyo tshobokanyo tshoga tshoganetso tshoganyetso tshogile tshoka tshokane tshokologong tshola tshole tsholeditse tsholela tsholeletsa tsholetsa tsholetse tsholo tsholofelo tsholofetso tshologa tsholola tshololwa tsholwa tshomarelo tshosa tshosang tshosediwa tshosiwa tshosobanyo tshosologo tshotlego tshotlo tshotse tshotseng tshotswe tshotsweng tshupa tshupanako tshupane tshupelo tshupo tshutiso tshwaela tshwaelo tshwaetso tshwana tshwanang tshwanela tshwanelang tshwanelo tshwanelong tshwanelwa tshwanelwang tshwaneng tshwanetse tshwanetseng tshwanetswe tshwanetsweng tshwanong tshwantsha tshwantshanya Tshwantshanyang tshwantshanyo tshwantshiso tshwantshiwa tshwantsho tshwara tshwaragana tshwaragane tshwaraganelo tshwaraganeng tshwaraganetsweng tshwaragano tshwaraganya tshwaraganye tshwarang tshware tshwarela tshwarelwa tshwarisa tshwaro tshwarwa tshwarwang tshwarwe tshwaya tshwene tshwenngwa tshwenya tshwenyang tshwenye tshwenyega tshwenyege tshwenyegile tshwere tshwereng tshwerwe tshwerweng tshwetso tshweu tsi tsia tsiboga tsibogela tsibogele tsibogelo tsibosa tsididi tsiditsana tsietsa tsietso tsile tsileng Tsimong tsiya tsoga tsogang tsoge tsogela tsogile tsogo tsogong tsoma tsona tsone tsosa tsose tsosetsa tsositse tsosiwa tsosolosa tsotlhe tswa tswakanngwa tswakanya tswala tswale tswalela tswalwa Tswana tswang tswe tsweetswee tswela tswelang tswele tsweledisa tsweledisiwa tsweledisopele tswelediwa tswelediwang tswelela tswelelang tswelele tswelelo tswelelopele tsweletsa tsweletsang tsweletse tsweletseng tsweletso tsweletsong Tsweletsopele tsweletswa tswetse tswetswe tu tuelo tulo tumalano tumalanong tumanosi tumedi tumelano tumelelano tumelelo Tumelelotiriso tumelo tumelong tumile tumileng Tumisang twantsho twatsi twe tweng umaka umakilweng umakiwa umakiwang ura utlwa utlwala utlwalang utlwale utlwalela utlwaletse utlwana utlwane utlwang utlwe utlwela utlwelela utlweng utlwile utlwileng utlwiwang utolola utswa utswile utulola wa weditse weditswe weditsweng wediwa wee wela welang wele wena wetsa wetse wetsho ya yang ye yo yole yona yone yoo yosi yotlhe yunibesithi yunibesithing Yuropa dict-tn-20070206.orig/tn/COPYING.LGPL0000644000175000017500000006347610562150027015156 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-tn-20070206.orig/tn/VERSION0000644000175000017500000000001110562150027014406 0ustar dokodoko20060123 dict-tn-20070206.orig/tn/ChangeLog0000644000175000017500000000143410562150027015122 0ustar dokodoko2006-01-23 Dwayne Bailey * Release 20060123 * wordlists/wordlist.openoffice.in: various entries fixed to ensure we can build aspell * wordlist.in, wordlists/wordlist.scannel.in, myspell/README_tn_ZA.txt: move scannel list and mark it correctly as GPL * COPYING.*: add GPL and LPGL Copyright to cover all wordlists * Makefile: fix to read wordlists from the wordlists/ directory. No longer need to fake the langauge and region codes * aspell/info.in: fix special characters * myspell/tn_ZA.aff: correct the TRY line 2004-05-12 Dwayne Bailey * Added: - Integrated existing Tswana aspell version 0.50-0 dictionary into the build system. - Created MySpell builds * Released: Version 20040329 of MySpell dict-tn-20070206.orig/tn/COPYING.GPL0000644000175000017500000004313110562150027015024 0ustar dokodoko 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. dict-tn-20070206.orig/tn/Makefile0000644000175000017500000000117710562150027015014 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=tn LANGNAME=Tswana LANGNAMELOW=tswana 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=fr #REGION_FAKE=FR CHARSET=iso-8859-15 include ../utils/Makefile.language dict-tn-20070206.orig/utils/0000755000175000017500000000000010562173203014066 5ustar dokodokodict-tn-20070206.orig/utils/configure0000755000175000017500000000476110562150175016010 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-tn-20070206.orig/utils/README.myspell-mozilla-xpi0000644000175000017500000000044110562150175020677 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-tn-20070206.orig/utils/install.js.in0000644000175000017500000000172510562150175016507 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-tn-20070206.orig/utils/munch.c0000644000175000017500000005112010562150175015346 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-tn-20070206.orig/utils/README0000644000175000017500000001036710562150175014760 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-tn-20070206.orig/utils/unmunch.c0000644000175000017500000003021110562150175015707 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-tn-20070206.orig/utils/Makefile.language0000644000175000017500000001543510562150175017323 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-tn-20070206.orig/utils/munch.h0000644000175000017500000000461610562150175015363 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-tn-20070206.orig/utils/proc0000755000175000017500000027234010562150175014772 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-tn-20070206.orig/utils/unmunch.h0000644000175000017500000000267610562150175015732 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-tn-20070206.orig/utils/hunmunch.c0000644000175000017500000005127510562150175016074 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-tn-20070206.orig/utils/hununmunch.c0000644000175000017500000003074110562150175016432 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-tn-20070206.orig/utils/csv2acor.py0000755000175000017500000000676710562150175016210 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-tn-20070206.orig/utils/hunmunch.h0000644000175000017500000000461510562150175016075 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-tn-20070206.orig/utils/README.aspell0000644000175000017500000000025410562150175016231 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-tn-20070206.orig/utils/Makefile0000644000175000017500000000053410562150175015533 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-tn-20070206.orig/utils/.cvsignore0000644000175000017500000000001610562150175016066 0ustar dokodokomunch unmunch dict-tn-20070206.orig/utils/hununmunch.h0000644000175000017500000000267510562150175016444 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-tn-20070206.orig/utils/munch0000755000175000017500000004566010562150536015145 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-tn-20070206.orig/VERSION.aspell0000644000175000017500000000000510562150176015254 0ustar dokodoko0.50