Datasets:

WINGNUS
/

ACL-OCL

	{
	"paper_id": "C92-1010",
	"header": {
	"generated_with": "S2ORC 1.0.0",
	"date_generated": "2023-01-19T12:34:31.596027Z"
	},
	"title": "",
	"authors": [],
	"year": "",
	"venue": null,
	"identifiers": {},
	"abstract": "Most of tile research on parsing natnral [allguages has beetl concerned with I\",nglish, or wil, h other languages nlOrl)hologically similar Io English. Parsing agglntinat.ive word st, ructures ha.s altracted relatively little attcnl;ion most probal~ly becanse agghlfinatiw? lallgllages COlll~aill word s/ructtlres of considerable complexity, and parsing WOrdS ill Stlch languages I'(?(llliros morphok~gical analysis techniques. Ill this pal)er, we pi'eSell(r the design and implementation of a morphological root-driven parser tor Turkish word structures which has been mcorporatoed into a spelling checking kerllel for on-line Tiirkish texl, The agghltmative Ilatllre of the language and the resulting ('Olll[)l<?x Wol'd ['ornlatiollS, V;ll'iOllS pholleLic llall/lOlly l'tlleS alld sill)tie eKcepLiOllS [)reselll, cel'taill difficulties llOl usually on('ountered in the spelling checking of laagua,ges like English and make this a very challenging probhnH. 'l'heso approaches to tnorphologicaL parsing of Turk",
	"pdf_parse": {
	"paper_id": "C92-1010",
	"_pdf_hash": "",
	"abstract": [
	{
	"text": "Most of tile research on parsing natnral [allguages has beetl concerned with I\",nglish, or wil, h other languages nlOrl)hologically similar Io English. Parsing agglntinat.ive word st, ructures ha.s altracted relatively little attcnl;ion most probal~ly becanse agghlfinatiw? lallgllages COlll~aill word s/ructtlres of considerable complexity, and parsing WOrdS ill Stlch languages I'(?(llliros morphok~gical analysis techniques. Ill this pal)er, we pi'eSell(r the design and implementation of a morphological root-driven parser tor Turkish word structures which has been mcorporatoed into a spelling checking kerllel for on-line Tiirkish texl, The agghltmative Ilatllre of the language and the resulting ('Olll[)l<?x Wol'd ['ornlatiollS, V;ll'iOllS pholleLic llall/lOlly l'tlleS alld sill)tie eKcepLiOllS [)reselll, cel'taill difficulties llOl usually on('ountered in the spelling checking of laagua,ges like English and make this a very challenging probhnH. 'l'heso approaches to tnorphologicaL parsing of Turk",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Abstract",
	"sec_num": null
	}
	],
	"body_text": [
	{
	"text": "Morphological cbussilicat, ion of natttral languages according to their word Stl'tI('ttlrt+s idaces languages like Turkish, Finnish, and lhmgarian Io a class called \"ag ghfl+inalive langua.ges\". [n sllch hmguages, words are COlllbillaLiOll of several Iilorphel]les. There is a root and several suffixes are conlbined lo this root in order to modil},' or extend its meaning. Whal characterizes agglut, inative languages is thai stem fornlation hy at\" fixation 1o previously derived st.oms is extremely productive. A given stellL ew'n Ihough itself qlnt0 corn ph+x, call generally serve as basis for evell lllol'l' ('o111 l)lex words. Consequ.ntly, agglutinative languages contain words of considerable COnll~lexity, and parsing such languages necessitates a thorough morphological analysis.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "Morphological parsing has allracted relatively ]itl,le attention ill con'tputational linguistics. Tile reason is that nearly all parsing research has been concerned wMl English, or wit.h languages morl)hologicaII ) similar to English. ,qillce in such languages words contain only a fi~w nalldJer of affixes, or none at all. alhnost all of the parsing mod<+ls [br Ill(!lll consider recognizing those affix<+s +Is being trivial and thus do nol require a mOt'l+hological nnalysis, hi agghni native langaages, words C(/lll,ail111o direct indication Of t/lOrl;llel/le bOtlltdarios whMi at,, i. gellela[ (IOpOll dent on tit(? inorpho]ogieal and pllon(Jh)gical conlex[+ A morphological parser requires a nlorphold/OaOloglest[ COlllpollellt which l/lediat, es I)olwl?ell I[he Sill[kl('t \u2022 1[' o1' 111 of a [llorp]lellll! as ellco/llllel'l?d ill Ihe il/ptll text aud the lexical form in which the t]torl)h<~me is stor<.d ill tile lllOl'phellle illVelltory, ie, a i[WallS of i'e('oglliZing variallt forms of [l/Ol'phelllOS as tll~! SaltlO. alld a nlorl)hotactic component which specilies which corn hi.rot,ions of Inorl)henws at,\" Iwrn:itt,'d [7] \\lorphotogical parsing algorithms ma+x he divided it/to Ix',() classes as ollir .slrtpl~la 9 ;llt(I rool-df'iv~ It ;nlal+ ysis met.hods. FIolh approaches hawr beell Ilse/l frOlll very early on in l.he history of morphologicM parsing, For instance, I)ackal'd's parser flw ancien\| Greek [15) . aud Brodda and Karlsson's for Finnish [3] used affix slripping. Sagval[, on tile other hand, devised a rootdriwnl morpllological analyzer for Russian [17] . In addition, other tool; driwm morphological parsers for tile agglutinative langmtges Quechna [9, 10] , Finnish [l 1], and Turkish [6] were developed independently ill the early 1980's+ All of these Ihree pars(~rs proceed from left to righl,. Iltlot, s ~tre SOllgh\| ill the lexicon that, mat.oh imtial suhstl'ings of the word, and t, he gram Iltatica[ category o[ the root del, ermines what (:lass of sutlixes may follow. When a suttix in the permilted class is found to match a furttler substring of t,he word, grammatical mfornlation in 1he lexical entry fl)r that sulflx del,ernlines once again what class of suffixes may follow. If the end of tile word can be reached hy il.eration of this process, and if the last sullix analyzed is one which illay elld ;i word. t,]le parse is successful [7] .",
	"cite_spans": [
	{
	"start": 1133,
	"end": 1136,
	"text": "[7]",
	"ref_id": "BIBREF6"
	},
	{
	"start": 1422,
	"end": 1426,
	"text": "[15)",
	"ref_id": "BIBREF14"
	},
	{
	"start": 1467,
	"end": 1470,
	"text": "[3]",
	"ref_id": "BIBREF2"
	},
	{
	"start": 1579,
	"end": 1583,
	"text": "[17]",
	"ref_id": "BIBREF16"
	},
	{
	"start": 1680,
	"end": 1683,
	"text": "[9,",
	"ref_id": "BIBREF8"
	},
	{
	"start": 1684,
	"end": 1687,
	"text": "10]",
	"ref_id": "BIBREF9"
	},
	{
	"start": 1717,
	"end": 1720,
	"text": "[6]",
	"ref_id": null
	},
	{
	"start": 2380,
	"end": 2383,
	"text": "[7]",
	"ref_id": "BIBREF6"
	}
	],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "Another Icft-t+o-right parsing algol'itllni for autolnttlic analysis of Turkish words was proposed and ap plied by I(iiksal ill his Ph.l), thesis II2} Ills algo rithm called 'qdentified Maxillllllll Mat, ch (IMM) AI golithnl\", tries to find the Ill;IXinllllll h'ngth subslring, which is present, in a reel dict.ionary, h'OI]l the left of tim word. If a soltltriOll is ollLailled, ie., the rool IllOl+ ])ht?lllU iS identilledL the retnainhlg I)art of the word is considered as th( search (?[elllellL. This part is looked tbr in the suffix ItlOrl)henle forms dictionary aml the nlorphemes are idl!ntified one by one. '['he process StOpS whell there is no relllaillillg part. []owevet ill SOllle casi.s, ;llt[iotlgll it nolat+ioll is ohtained furl, her consistency analysis proves that this solution is tLot the corrccl one. In such cases Ill. previotts pseudo solution is reduced by one character alld all t,he search procedure is initiated once [ll()l'C.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "ish words have tim following short.coming: They do not consider the fact that in Turkish, words contain l, rPlllelldOllS alllOlln[, of selnantic illfOrlllat, iOll that has to })e taken into account. Ill these parsers, it is only the granlniatical category of the stein that detrrmine *lie suffixes that may follow, l\|owever, niost of the sultixes in Turkish, especially the derivational oaes, call be at.taclled only to a linlited number of reels or sleltlS Inostl} duo to Sel/lallliC reasollS.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "Another shortcolnhig of the previous parsers for Turkish is ihat they allow ille iterativr ilsage of derNaiional su[fixes. Although, bi6ksal [12], prevelltS the COIISeC/liiVe \|lsagl, of the Sallle ltlOl'i)hellle lwicc, lie slill l)arsos the word G(3ZI,(II,2('{iI,('YI,~('.i)L{31,; correctly, so do llankalner [7] . It is tl'lli\" l]lat. SOltle Turkish sutlixes can form aa iteraiive loop. but usually th,' number of iteratioli is not too high. rl'he above word ran I)e parsed correctly Ul; to lhe point G(3Zl,{'l((i:l~!L{'tl,; (the occultation of oculists), but the words GOZI,UI, ",
	"cite_spans": [
	{
	"start": 309,
	"end": 312,
	"text": "[7]",
	"ref_id": "BIBREF6"
	}
	],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "(B,C,C~,D,F,G,(L H,J,K, L,M.N,P,R,S,,q,, q, V, Y, Z) are consonants.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "Turkish word formation uses a number of phonetic harlrlony rules. Vowels and COltSOllants change in certain ways when a suffix is apl)ended to a root, so that sucll harnlony constraints are not violated.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Introduction",
	"sec_num": "1."
	},
	{
	"text": "Ahnost all suffixes in Turkish ilse one of two basic vowels and their allophones. We have denoted these sets of allophones with braces around the main vowels A and 1. as {A} and {I}. The allophones of {At are A and E, where {It represents I, i, U, or {r. The vowels O and (} are only used in root inorl)hemes (especially in the first syllable) of Turkish words. ~",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Vowcl Change iti Suffixes",
	"sec_num": "2.1.1."
	},
	{
	"text": "The vowel harltlOllV rtlies require thai vowels in a silt L fix challge according to certain rules whell they are affixed to a stem. The first vowel in thr suftix changes according to the last vowel of the sl.em. Succeeding vowels ili tile suffix change according to the vowel prereding it. If we denole the preceding vowel (lie it in the sten, or in the suffix) by v then {At is resolved as A if r is A, 1. O. or U. otherwise it is resolved as E. OiL the other band, {I} is resolw~d as [ if e is A or 1. as iifeisEori, as U if t: is O or U. and as 0 if v is (3 or U. For examl)le the word \"YAPMAYACAI,7.TINIZ\" can be broken htto sutiixes as: 1( can bc seen that the vowels ill the correct spelling of the word obey the rules almve, while a spelling like \u2022 \";APMAYACEI<TiNiz violates the harlnony rules because all {A} in the sullix call not resolve to all I'] as tile prereding vowel is all A, It shouh] be nlenlioned in passing i,hai t, here are also SOllle suffixes, sucli as - brief infornlation on tile dictionary used in this imlllenlentaliou.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Vowcl Change iti Suffixes",
	"sec_num": "2.1.1."
	},
	{
	"text": "YAI'/M {A)/[Y]:'{ A )C{A} { t'~)4/{l)}S {I}/N {I}Z i [qom",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Vowcl Change iti Suffixes",
	"sec_num": "2.1.1."
	},
	{
	"text": "The dictionary is bmsed oil the Turkish \\Vriting Guide [2, 3] as the source. Some words in the dictionary haw, to lie marked ~s having certaiu semantic and structural properties such as being a verbal root or a nomiua] root, being a proper noun, not obeying to vowel harmony rules, deformiug under certain conditions, and so on. the whole word is searched in the dictionary, If it is found then the word has no suffixes and therefore its spelling is correct. Otherwise, we remove a letter from tile right and search tile restllting substring. We continue this by removiug letters from the right until we find a root. If no root can be found although the first letter of the word is reached, tile word is reported as misspelled.",
	"cite_spans": [
	{
	"start": 55,
	"end": 58,
	"text": "[2,",
	"ref_id": null
	},
	{
	"start": 59,
	"end": 61,
	"text": "3]",
	"ref_id": "BIBREF2"
	}
	],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "The maximum length substring of the word that is present in tile dictionary is riot always its root. If fin't.her analyses show that the word is misspelled, a new root is searched m the dictionary, this time removing letters from the end of the previous root.. If a Ilew root can be found the same operations are repeated, otherwise tile word is reported &s misspelled.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "Root determination presents some dittieulties wheu the root of the word is deformed. For the root words which have to be deformed during certain agglutinations, a flag indicating that property is set in the dictionary. For example, the root of the word ,~EHRE (to the city) must be found as ~jgltiR (city). In order to determine it correctly, when the substring SEHR is not found in the dictionary, considering that it illay be a deforined root by vowel ellipsis, the vowel I is inserted between the consonants 11 and R, and the word ~EHIR is searched in the dictionary. When it is fotmd, tile flag corresponding to vowel ellipsis is checked. Since it is set for this word, the root of the word S,'I';IIRE is dcterlnined as ~EIIiR, and remainins analyses are contiuued. If that word were written as .~EHiRE, we should report it ms incorrect although ~EltiR + dative ease suffix form looks correct. For all other root defin'mations, the real root of the word can be fotnld by u/aking such cheeks and some necessary chauges (see [20] ).",
	"cite_spans": [
	{
	"start": 1027,
	"end": 1031,
	"text": "[20]",
	"ref_id": null
	}
	],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "For some roots both of the refills above are valid. SomP words of foreign origin do uot ohey vowel harmony rules during agglutination (e.g., KONTIIOL (control)). Before ttae w)wel harmony cheeks are doue, the tlag correslJonding to that property must I,e checked, If it is sol for the root of the word, du, vowel harmony check must he apl)lied inversely Thus, the first vowel in I, he sulllxes part must be in disharmony with the last vowel of the root (e.g,, I(ONTIIOI,LEI/, (controls)). As another interesting ('aS(', SOI]le roots that ii]ay he used ill tWO illeanings.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "[,e, \|lie holnol]ylllS, obey vowel fiarulony ruh!s whel/ tile3' are used with a eertaiu lllealling, whih' they do lie[ ob,'y thelll when tile)' are used in tit(! other meaning. For example, both SOLA (to Om left) and SOl,I); (t(} the Itote sol) pass the vowel harmony cheek sine,, tileir refit ~OI, has two iPl{!anil]gs ;is \"left\" slid \"'tlitisical u(}t,e. \"8",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "The suffixes must I}e deierinin,xl before the conso llaUl }larlUolly checks are doue. Becanse of this. I hese checks are done during niorl}hological anal)sis, after eacli sulfix is isolated.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "It' a woM does not pass any of ll]e nlorphophoiil!ulic checks, consideriug the possihility that lhe root may have i)eell determined wrollgly, a liew root is searched ill the dictionary. [f a word has receiw~d more than one derivationM sutfixes then mauy switches between parsers will be necessary. For example, the root of tile word BEYAZ-LA~TIRMAYANLARI}AN (from those which do not cause to hecome white) is found as the noun BEYAZ (white) in our dictionary. Then comes the suffix L{A},5, which makes a verb from a noun, tfierefor,\" a switch t.o the verb parser ha~s to be ulade. ",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Dictionary",
	"sec_num": "3.1."
	},
	{
	"text": "This spelling checker has been i,nl)lenumted in at l~ilkent University, using tile C i)rogramnfing language. Its current version takes nearly 600 Kbyl,es including t, he dictionary.",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Performance Results",
	"sec_num": "4."
	},
	{
	"text": "The checker can be inserted to different word processiagapplieat.ions or can be used separately. We haw' integrated it to GNU-I!EMACS text edit, or for use on IgI'EX document.s, ht this form, the program is avail able for use within the university and around a nun> her of sites oa luternot. It is also I~ossible to obtain solnp statistical hiforniatiou 1) 3\" running the progranl willi -s option. Parsing agglutinative word structures necessitates rather nontrivial phonological and morphological analyses which present special difficulties in the development of parsers for such languages, not usually encountered in parsers for other languages. As a resub, the number of parsers developed for agghitinafive languages, and particularly for Turkish, is quite limit.ed, and they have certain shortcomings. We have solved most of the problelns encountered in the previous parsers by lnaking a detailed and careful research on Turkish word formation rules and their exceptions [20] . These results may hopefully be helpful for future researchers on Turkish linguistics. We should note t.hat ewm though it is claimed that word formarion rules in Turkish are well-defined and Turkish is a very regular language, as used today it shows many irregularities that cause the ln'oblem of parsing I.his language to become a very hard and interesting problem Many grammar books haw~ been referred to collect, Turkish word format.ion rules, hi those books, after each rule is defined, usually it is reminded that tliel'e lllay occur sonte exceptions to that, rule ill SOllle condit,ions, hut mostly those conditions can not be \"well\" defined, For example, in all Turkish grammar books, it is said that \"When a Turkish word ending wit.h one of the consonants P, ~', T, K receives a suffix beginning with a consonant, that final consonant is soft,cued, bul t, here are some such words whose final consonant does not change.\" ]lowever, none of the books says what the common propert.y of those words which do not obey t,o that rule is, because most probably it is not known yet. Ill order t,o inchlde that rule correctly in the parser, all words having the indicated prol)erty have been examined, the list of t,he irregular ones have been obtained, and speeial checks have hi!ell dolle t,o catch those irregularit.ies. Ill order t.o obtain reliabh? resuhs front the spelling checker, all of the known rifles and theh' except, ions have been inlplellll!tlt,Od",
	"cite_spans": [
	{
	"start": 975,
	"end": 979,
	"text": "[20]",
	"ref_id": null
	}
	],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Performance Results",
	"sec_num": "4."
	},
	{
	"text": "The spelling checker ,'4OllletillleS i'e[)ol'LS correcI woFds aS illcorreet, ()lie reason ell, his is the absellce of SOllle words in ore' dictionary. Although the dict, ionary is reasonably complete, there still remains many technl cal terms and proper names which are not included. Adding more and nlore words will obviously increase tile flmelional performance of the checker. Another reason is that, most of the derivational sultixes are not mchtded rote'die rules. If( stem that is derived by such a suffix is not present ill the dictionary, it is reported as misspelh~d. Additionally. for th( deriw~lionel sullixes that. are included in our rules, the lis~ of the roots that they can be a[lixed to may no( he full~ determined. This problem can also be solved by examining the dictionary As far as execution pertbrmance goes. our iml)hmtentation is very S;atisfa\u00a2lory giving an ahnost. 1000 words/second word analysis throughput [19] .",
	"cite_spans": [
	{
	"start": 934,
	"end": 938,
	"text": "[19]",
	"ref_id": "BIBREF18"
	}
	],
	"ref_spans": [],
	"eq_spans": [],
	"section": "Performance Results",
	"sec_num": "4."
	},
	{
	"text": "AcrEs DE COLING-92, NAh'TES, 23-28 AOOT 1992",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "",
	"sec_num": null
	},
	{
	"text": "PRec. Of COLING-92, NANTES, AUG. 23-28, 1992",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "",
	"sec_num": null
	},
	{
	"text": "PRec. OF COLING-92, NM, rrES, Auo. 23-28, 1992",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "",
	"sec_num": null
	},
	{
	"text": "PRec. OF COLING-92, NAI~rrES, AUG. 23-28, 1992",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "",
	"sec_num": null
	},
	{
	"text": "Ac31~s DECOLING-92, NANTES, 23-28 Aour 1992",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "",
	"sec_num": null
	},
	{
	"text": "Plot. OF COLING-92, NANTES, AU6. 23-28, 1992",
	"cite_spans": [],
	"ref_spans": [],
	"eq_spans": [],
	"section": "",
	"sec_num": null
	}
	],
	"back_matter": [],
	"bib_entries": {
	"BIBREF0": {
	"ref_id": "b0",
	"title": "Tiirkiye '1 iirkwsmde bigiml)irimh'r",
	"authors": [
	{
	"first": "O",
	"middle": [],
	"last": "Adah",
	"suffix": ""
	}
	],
	"year": 1979,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Adah, O., \"Tiirkiye '1 iirkwsmde bigiml)irimh'r\", TI)K, Ankara, 1979.",
	"links": null
	},
	"BIBREF1": {
	"ref_id": "b1",
	"title": "I'I)K, Ankara, 198(i",
	"authors": [
	{
	"first": "",
	"middle": [
	"T"
	],
	"last": "Bal~guoglu",
	"suffix": ""
	}
	],
	"year": null,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Bal~guoglu. T.. '\"l'{irkqenin grameri\", 'I'I)K, Ankara, 198(i.",
	"links": null
	},
	"BIBREF2": {
	"ref_id": "b2",
	"title": "An exl)erm.'alt with morphological analysis of FilmislF', Papers from the hlst, itude of l,inguistics",
	"authors": [
	{
	"first": "B",
	"middle": [],
	"last": "Brodda",
	"suffix": ""
	},
	{
	"first": "F",
	"middle": [],
	"last": "I.~arlsson",
	"suffix": ""
	}
	],
	"year": 1980,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Brodda, B., I.~arlsson, F., \"An exl)erm.'alt with morphological analysis of FilmislF', Papers from the hlst, itude of l,inguistics, University of St,eel,: holm. Publicat.ion ,1{1. Stockhohn. 1980.",
	"links": null
	},
	"BIBREF3": {
	"ref_id": "b3",
	"title": "Yal~ancflar i,~in 'l'iirkw-ingilizee agklamah Tfirk W dersleri",
	"authors": [
	{
	"first": "K",
	"middle": [],
	"last": "An",
	"suffix": ""
	}
	],
	"year": null,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "('an, K., \"Yal~ancflar i,~in 'l'iirkw-ingilizee agklamah Tfirk W dersleri\", METU, Ankara. I {}87",
	"links": null
	},
	"BIBREF4": {
	"ref_id": "b4",
	"title": "Tiirkiye Tiirkwsmde kSk-ek Ifih'..,mehM\", T1)K, Ankara",
	"authors": [
	{
	"first": "",
	"middle": [],
	"last": "I)emircan",
	"suffix": ""
	}
	],
	"year": 1977,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "I)emircan, (:5.. \"'Tiirkiye Tiirkwsmde kSk-ek Ifih'..,mehM\", T1)K, Ankara. 1977.",
	"links": null
	},
	"BIBREF5": {
	"ref_id": "b5",
	"title": ":l'urkish generativ,~ morphology and morphological parsing",
	"authors": [
	{
	"first": ".",
	"middle": [
	"I"
	],
	"last": "Llankamer",
	"suffix": ""
	}
	],
	"year": null,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "[61 llankamer, .I., \":l'urkish generativ,~ morphology and morphological parsing\", a pal)or presented al ,\u00a2,eeolld Int.erlLational (',onferellce on Turkish Linguistics, !.stanbul. 198.1.",
	"links": null
	},
	"BIBREF6": {
	"ref_id": "b6",
	"title": "Morphological parsing and the lexicon",
	"authors": [
	{
	"first": "D",
	"middle": [],
	"last": "Llankamer",
	"suffix": ""
	}
	],
	"year": null,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "llankamer, d., \"Morphological parsing and the lexicon\", edit,ed by William Marslen-Wilson. MIT Press.",
	"links": null
	},
	"BIBREF7": {
	"ref_id": "b7",
	"title": "Tiirkgmin elderi",
	"authors": [
	{
	"first": "V",
	"middle": [],
	"last": "Llatiboglu",
	"suffix": ""
	},
	{
	"first": "Ankara",
	"middle": [],
	"last": "Ti)k",
	"suffix": ""
	}
	],
	"year": 1981,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "llatiboglu, V.. \"Tiirkgmin elderi\". TI)K, Ankara, 1981.",
	"links": null
	},
	"BIBREF8": {
	"ref_id": "b8",
	"title": "1)., \"llser's referem'e nlalltial [or t, he (\"s Qut'chua adaptat.ion progranf'. Oc casional Publications in Academic Computing",
	"authors": [
	{
	"first": "R",
	"middle": [],
	"last": "",
	"suffix": ""
	}
	],
	"year": null,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "l{aspm'. R,, \"~Veb,,r. 1)., \"llser's referem'e nlalltial [or t, he (\"s Qut'chua adaptat.ion progranf'. Oc casional Publications in Academic Computing.",
	"links": null
	},
	"BIBREF9": {
	"ref_id": "b9",
	"title": "Trogrammer's reference manual for tile C's Quechua adaptatiml progranf'. Occasional Publications ill Academic Computing",
	"authors": [
	{
	"first": "It",
	"middle": [],
	"last": "Kasper",
	"suffix": ""
	},
	{
	"first": "",
	"middle": [],
	"last": "Weber",
	"suffix": ""
	}
	],
	"year": 1982,
	"venue": "",
	"volume": "9",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Kasper, It., Weber, 1)., 'Trogrammer's refer- ence manual for tile C's Quechua adaptatiml progranf'. Occasional Publications ill Academic Computing, Nmnber 9, Summer Instil, uric of Lin- guistic, Inc., 1982,",
	"links": null
	},
	"BIBREF10": {
	"ref_id": "b10",
	"title": "University of tlelsinki, l)epartment of General Linguistics, l>ublication No, 11, tlelsinki",
	"authors": [
	{
	"first": "K",
	"middle": [],
	"last": "Oskenniend",
	"suffix": ""
	}
	],
	"year": 1983,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "b:oskenniend, K., \"'l'wodevel morl)hology\", Uni- versity of tlelsinki, l)epartment of General Lin- guistics, l>ublication No, 11, tlelsinki, Finland, 1983,",
	"links": null
	},
	"BIBREF11": {
	"ref_id": "b11",
	"title": "Autmmttic morphological analysis ofTurkislf', PILl). Thesis, llaeettepe Uniw~rsity",
	"authors": [
	{
	"first": "",
	"middle": [],
	"last": "Ksksal",
	"suffix": ""
	}
	],
	"year": 1975,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "KSksal. A, \"Autmmttic morphological analysis ofTurkislf', PILl). Thesis, llaeettepe Uniw~rsity, Ankara, 1975.",
	"links": null
	},
	"BIBREF12": {
	"ref_id": "b12",
	"title": "lax & yaec",
	"authors": [
	{
	"first": "T",
	"middle": [],
	"last": "Mason",
	"suffix": ""
	},
	{
	"first": "D",
	"middle": [],
	"last": "Brown",
	"suffix": ""
	}
	],
	"year": null,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Mason, T., Brown, D., \"lax & yaec\", edited by l)ale Dougherty, O'Reilly & Associates, Inc., lISA, May [990",
	"links": null
	},
	"BIBREF13": {
	"ref_id": "b13",
	"title": "Tfirkiye Tiirkqesinde sSzciik t, iiretme ve bilc",
	"authors": [
	{
	"first": "S",
	"middle": [],
	"last": "Zel",
	"suffix": ""
	},
	{
	"first": "",
	"middle": [],
	"last": "Ti)k",
	"suffix": ""
	},
	{
	"first": "",
	"middle": [],
	"last": "Ankara",
	"suffix": ""
	}
	],
	"year": 1977,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "()zel, S,, \"Tfirkiye Tiirkqesinde sSzciik t, iiretme ve bilc.~tmne', TI)K. Ankara, 1977,",
	"links": null
	},
	"BIBREF14": {
	"ref_id": "b14",
	"title": "C, omputer-assisted morphological analysis of Aucient (;reek",
	"authors": [
	{
	"first": "D",
	"middle": [
	"; C"
	],
	"last": "Packard",
	"suffix": ""
	},
	{
	"first": ";",
	"middle": [],
	"last": "Linguistics",
	"suffix": ""
	},
	{
	"first": "Pisa",
	"middle": [],
	"last": "Linguistics",
	"suffix": ""
	},
	{
	"first": "S",
	"middle": [],
	"last": "Leo",
	"suffix": ""
	},
	{
	"first": "Firenzc",
	"middle": [],
	"last": "Olschki",
	"suffix": ""
	}
	],
	"year": 1973,
	"venue": "Proceedings of the lnt,ernational Cont;~:rence on Compul",
	"volume": "343",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Packard, D., \"C, omputer-assisted morphological analysis of Aucient (;reek\", C, omputational and Mathematical Linguistics: Proceedings of the ln- t,ernational Cont;~:rence on Compul, ationa] Lin- guistics, Pisa Leo S. Olschki, Firenzc, 343 355, 1973.",
	"links": null
	},
	"BIBREF15": {
	"ref_id": "b15",
	"title": "SSzciik ~;ekimi",
	"authors": [
	{
	"first": "Z",
	"middle": [],
	"last": "Sagay",
	"suffix": ""
	}
	],
	"year": 1978,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Sagay, Z., \"SSzciik ~;ekimi\", Bili,~im'78, Ankara, 1978.",
	"links": null
	},
	"BIBREF16": {
	"ref_id": "b16",
	"title": "A system for automatic inflectional analysis implement.ed for R,ussian, Data Lmguis tica 8",
	"authors": [
	{
	"first": "A",
	"middle": [],
	"last": "Sagvall",
	"suffix": ""
	}
	],
	"year": 1973,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Sagvall, A., \"A system for automatic inflectional analysis implement.ed for R,ussian, Data Lmguis tica 8, Ahmluist and Wiksell, ,qt,ockhohn, 1973",
	"links": null
	},
	"BIBREF17": {
	"ref_id": "b17",
	"title": "A finite state machine lot Turkish syllabh~ structure analysis",
	"authors": [
	{
	"first": "A",
	"middle": [],
	"last": "Solak",
	"suffix": ""
	},
	{
	"first": "K",
	"middle": [],
	"last": "Oflazer",
	"suffix": ""
	}
	],
	"year": 1990,
	"venue": "tn Proceedings of 0w Fifth hlt.ernational Sylnpositlm 01( COllll)tll;er all(/ Informal;ion ,qciellces",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Solak, A., Oflazer, K,, \"A finite state ma- chine lot Turkish syllabh~ structure analysis\", tn Proceedings of 0w Fifth hlt.ernational Syln- positlm 01( COllll)tll;er all(/ Informal;ion ,qciellces, Nev,whir , Tftrkiy% 1990.",
	"links": null
	},
	"BIBREF18": {
	"ref_id": "b18",
	"title": "lmtAementation details and I)erformance results of a spelling checker for Turkish",
	"authors": [
	{
	"first": "",
	"middle": [
	"A"
	],
	"last": "Solak",
	"suffix": ""
	},
	{
	"first": "K",
	"middle": [],
	"last": "Flazer",
	"suffix": ""
	}
	],
	"year": 1991,
	"venue": "m Proceedings of the Sixth International Symposium on (:omput,er and Information Sciences, Side, Altt.alya, Tiirkiye",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Solak. A,, ()flazer, K.. \"lmtAementation details and I)erformance results of a spelling checker for Turkish\", m Proceedings of the Sixth Interna- tional Symposium on (:omput,er and Information Sciences, Side, Altt.alya, Tiirkiye. Oct. 1991",
	"links": null
	},
	"BIBREF19": {
	"ref_id": "b19",
	"title": "l)esign and inllflementation of ;, spelling checker R)r Turkish",
	"authors": [
	{
	"first": "A",
	"middle": [],
	"last": "Solak",
	"suffix": ""
	}
	],
	"year": 1991,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Solak, A, \"l)esign and inllflementation of ;, spelling checker R)r Turkish\", M.S, Thesis, Bilkent Universit.y, Ankara, 1991.",
	"links": null
	},
	"BIBREF20": {
	"ref_id": "b20",
	"title": "Studies in Turkish Linguist, ics",
	"authors": [
	{
	"first": "R",
	"middle": [],
	"last": "Underhill",
	"suffix": ""
	},
	{
	"first": "\"",
	"middle": [],
	"last": "Turkislf",
	"suffix": ""
	}
	],
	"year": 1986,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "7--21",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "Underhill, R,, \"Turkislf'. Studies in Turkish Lin- guist, ics, edited by Dan Isaac Slobin and Karl Zimmer. 7 --21, 1986.",
	"links": null
	},
	"BIBREF21": {
	"ref_id": "b21",
	"title": "Tiirk(ie sSzlfik",
	"authors": [],
	"year": 1988,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "\"Tiirk(ie sSzlfik\", \"I'DK, Ankara, 1988.",
	"links": null
	},
	"BIBREF22": {
	"ref_id": "b22",
	"title": "Yeni yazlm kdavuzu",
	"authors": [],
	"year": 1981,
	"venue": "",
	"volume": "",
	"issue": "",
	"pages": "",
	"other_ids": {},
	"num": null,
	"urls": [],
	"raw_text": "\"Yeni yazlm kdavuzu\", l!;lewmth Edition, TIll(, Ankara, 1981.",
	"links": null
	}
	},
	"ref_entries": {
	"FIGREF0": {
	"uris": null,
	"text": "nm~ on. ~, wilt indicate lhe I;ng]ish meatlh/g tff a iVlbl'll ill Turkish ill p,~l'etlllwsl!s following il. ~ I'h,' proglrssivo lense suffix {]}YO[( is an exceptioll. <[ ] iudicates an opti,mal IllOi'l)heilie that nniM Iw inseried before it sulllx to satisfy cel'l&in harniony rules. In this case. [Y] indi<atrs Illltl liw COllS~lllillll ~l\" IIitl~,l I~i\" ilisl I'ted if Ihr last lel ICl of (lie $Lflll is ,~. vowel, otherwise il is dl'Op\|)ed: e.g., OI'~U (read) . ()[<.1%'AC:\\],{ is/lie will lead), bul 7()R (ask) --54C)[}A(':\\1< fs/i,,' ~ill ask) i'[hr iu<, ;tilol)holies <if {K } al'r K and (i 'l'he I~l~ alloph,mrs of {It} ale \|) alld ]'.",
	"num": null,
	"type_str": "figure"
	},
	"FIGREF1": {
	"uris": null,
	"text": "[{l;].'~, whose vowels llOVOr ch~lllgP. ~,]L,2, Consonallt; }lili'lll(llly Another basic asperl of Turkish pllonology is consonant harniony. It is based on the classilicalion of 'hlrkis[i (1OllSOllalllS illlO two lllaill groiips, voit'fless a.d ,o,c<:d. Th,, voiceh>ss COliSOliaFlls arc (', F, T. 1t, $. K. 1 >, ~. 'fh<' reluainmg ronsolianls are voiced lnterosied readers call find tile complete lisi of con-SOllant harlnony lqlh's in l.;oksal [12], and Solak [20J To give ~ll/ examl)h', one of thr rules says that if a sulIix begins with ore, of t.h( consonants I). (:, (;. Ibis COllSOllalll changes iillo T, ('. I{ l'eSlWCl [rely, if\" a %oiceless COllSOllalll is iH'(,~('nt as the final I)h(HieillO o[' the pr(wious illl)rpllonl0, e.g.. ~l'()I,])a (Ol/ l'o~id), bill I:(]AK'IA (ou plalw), ~oiii(' lilOrl)henles are allixcd wiill ihc insertion ot either N. ,q, ~. \"l\" when Iwo vowels llal)pcn Io follmv each otll0r (e.g. ilAIIt:ES;i (his/l~er garden), II,tll(.:l::Yi (aecusali;e of garden), il.:i,5_l,;l/ (two each)j, or when there is anoLher nloi'phenie following (e.g. BAII(!IC,q_'iNDI'; (in his/iwr ga,'d,~.), or in Colltexl of sonic lirOllOtlllS (c.g,, BUNA (to tiffs), I<I;;NDiNI)EN (\|'rein yourself)) and thr prononiial sut/ix I,~i (,,.g. SI':NiNV;ii (accusaliv,' of .yours)). lit OII1' ('xanll)]l' HI)O%'/', the flllllr(' It,liSt, sii\|l]x {'~']{A}( :{ Ai{IC} ........... I'le,' till' ~4i ...... YAt'MA ..... I since thr [asl ph()llrnir is a vowel \"f is ms('rl,'d. 2.1..3. D(~forniatioll of ll.(mts No/'nlally 'lurkish rliols arc nilI t[oxi>d. ][owovel-, tllerc ~tl'P SOlllO ('il'4or, whrr\u00a2 f4Ollll' i~honenws ~ll'(' ch,qllgod by aSSilnilalion or variolls olher (icforlllaliOl/S [12] An ex(:eptioilal cas,' related io ih,' tlexion of IOOIs iS observed ill ])l,lSOlla] i)rOllOllllS BI\",N (1) alid ql;N (you)]laving ,lalivo~ lIANA (to ine)and SAN:\\ (Io yell t rcspeciivc[~. 'l'hrsr ar(\" individual cases and Clill hi, Ircated as excc[lli(lllS. ,% lil,)ll syslelnatic ,qlipsis OrClii's when il. su[[ix {1} k(.)ll ('Olll(?S all,el i it(' ~elbal reels alld SlOlllS ('li(I.iiig wil[i I,ho llholieillc {A} In SilC[i cases, ttlc wid,, \\()1\\('1 ;ii Ih,' end of lhe sielil is i/arrow~,d, c,g, YAP -','AI>IYOlt (s/h,'/ii is doin-; [ii]). but Alia \u2022 AI'IIYOII (s/ho/it is ,.earchmg). AIIOl[lcq' rool deforlualion o(('tlrs ;is (i vowel ellipsis. ~,Vlien a sut[ix brginnin<e> wilh a vowel COllies afler SCllllt, ilOtlllS, gener;i]l) dcsigiiating paris of thr hu ma. body. wim'h has . vowd {i} i. ils lasl syllabi,', Ihis vm~el drops, e.-. IIl'ltl:X (lieS,,) -BVIINUM (mS nose). '-;imilarty. who. lh(\" passiw.uess suffix {I}L is affixed to some ;crl~s. whose lasl vowel is {I}, tNi <, vowel also drops. ~,.~. ('AC, II/MAb; (io call) --('A(;ItlI,MAK (io Iw calh,d). Other root delk)rl.a ('l{,,f+q 5olak [20] fra delailed ilffOil,,aiion oil ,'at, h of th,' ~ullixes tions and their exceptions call be found ill Solak [20].2.2. Turkish morphologyTurkish roots can be classified into two main classes: ,ominal and verbal. The verbal class comprises the verbs, while l/Olllillal chess COlllprises llOIlllS, \|)rOllOilllS and adjecl.iw's, etc. Tile sulfixes that can be receiw~d by either of these groups are different, i.e., a suffix which C~lll bt, a\|Iix(!d to ~1 llOlllillRl l'oot ci%11 llot b(! affixed to a w.'rbal root wil, h tile same semantic function. Turkish suffixes can bc classified as derivalio~lal and co~ljuyallonaL l)eriwttional sutfixes change thr meaning and sometinies lhe class of tim stenls they are affixed, while a conjtlgated verb or noun renmins x'~ such after the atlixation. Conjugational suffixes call b. affixed to all of the roots in \|,he class thai [,hry belong. On t, hc el, her hand, 1hr nuniber of roots that ,,ach derivational suffix can }>e affixed changes. The nominal model 'lhr shnplili,~d models for nominal and verbal grainlllgll'S rail be giVI211 ~lS tollows: 6 The nomimd niodel: nommal root + phu'al suffix + possessive sutflx + case suffix -I relalive suffix Tim wwlml model: verbal root -[ voic(\" sultixes + negation sulfix + corn pound verb suffix t-Illaili It'llse suttix -i-qllestioll suffix + secoitd I.l!llsl? suffix + Iwrsoll sutllx 3. Implementation \\\\',' have ilnph,lnrnted n rool-driwul lnorphological analyzer lbr '['urkish ;tlld llSe,,I il as a spelltn 9 chccklui ,4' e 7~t;I that can be integrated t.o <li[fiercnt a.I;pli\u00a2iations Oil a variely of plattbrnis.The progranl takes a list of Turkish words as inpul, and thcli checks then10lit? I)y one ill the order t, hey appear. If the Slmllhlg of aii hipul word if. iileorrecl, il is oulput as inissI>elh'd Each word is allalyzcd individually wil, h 11o at, telllion to the Selllalltics or \|,o the coillcxl. If a r, ord is spellrd corrrcll3 Inil is l,h~, wrOllgj ':.oi'd ill lhe \u00a2Ollll'Xl. w(> liave 11o inl,elll,ion for, and way of tlagging it. ;is ci'rOllOOllb, '['hils, as in all oliwr Sl)elling prog~i'alllS, th(> lexl is CXalnilied wilh leSliecl Lo words, liol willi rcspccl Io SClilC-iices. hi addition, w~, (1o 1101 )'{'t give ally stiggr'stion aboul the iliOSl likely correci words afler dole<ling a nlisspelh~d word. ie, spelling corl'rClirm is ilol dent, Word anal.~sis is handh'd in four step as syllabificaliou chrrk, reel dclcrniilial, ion, niorphol)llonenlie check. and morphological analvsis. I)uring lhese steps a dic-liOllal' 3 of Turkisli root words, and a set o[' rllles for 'lurkisli syllable structure, njorlihophonenlics, and inorpholog;y arc nsed coucurrenily.All these steps will I~e ,'\u00d7plain,'d i. llw following sections, after a ill Illose m.dol~ an, I I lie e \u00d7cept irma] ,:;tses ~liJoill [ heill ACRES DE COLING-92, N^t, rrEs, 23-28 hot'",
	"num": null,
	"type_str": "figure"
	},
	"FIGREF2": {
	"uris": null,
	"text": "",
	"num": null,
	"type_str": "figure"
	},
	"FIGREF3": {
	"uris": null,
	"text": "UNIX ellvirol]lllellL, Oil SUN St}AI{C workstations,",
	"num": null,
	"type_str": "figure"
	},
	"FIGREF4": {
	"uris": null,
	"text": ")Ill' resilll.s indicate thai the llIlitti)er of distinct words withiil a document is relaliwdy small, and more par ticularly, the percentage of distinct words l.o total words processc(l hicreases as the [eligill of the docu Inelll decreases. Approxiniately 40% of the ufissl)e]led word:, are delecled by syllal)ifiealion check and flu' resl ale detected by other checks. The nul'lll)er of disimct words all]?cl the execulion linie ill()re than Ihc lotai nuuiber of words, as expoclod, because a word is fully aualyzod only ouce If it occtlrs again in Ihe text, the resillt o1\" the pt'~,ViOllS check is used, Iu geiiera]. Ihc slwlling ch,wker can process lit Ill00-::;000 words (roughly 7-6 pages) per s,'eond, depending on Ihe docuutent. The functioilal perforlnance of the. spelling checker ('au hi, title trilled ])V analyzing the word [isl and inserting the additional al)l)ropriale flags 5. Conclusions lit tlfi~ paper, we have presenled a lnorl)hological parser for all agghlthi;ttive lallguagc. Turkisli. all(] its checking of this language.",
	"num": null,
	"type_str": "figure"
	},
	"TABREF1": {
	"text": "For examph~. if the word YAPMAI( (to make) were typed as YP-.\\I,\\I,2 or YAPMKA. the word would not be matched by the expression and its spelling wouhl be reported incorrect. On tile other hand, ifil, wew written as YAPMEI(, where a vowel harmony error is made, it would pass the syllabification cheek, but would lie reporled as misspelled during morl/holJhonemic checks.",
	"num": null,
	"type_str": "table",
	"content": "<table><tr><td>For examph ~, tile word BUII.UN (nose)</td></tr><tr><td>have to be niarked as being a nolllilla[ root, and de-</td></tr><tr><td>forming by vowel ellipsis. For this reason, for each</td></tr><tr><td>word in Ihe dictiouary a series of flags represeuting</td></tr><tr><td>certain properties of that word are heht. Tllus. each</td></tr><tr><td>elitry of tim dictionary Colltains a word in Turkish</td></tr><tr><td>and a series of flags showing certain properties of that</td></tr><tr><td>wor( [.</td></tr><tr><td>Nearly 2:1,500 words..'ach having 7 h, lters on the</td></tr><tr><td>averagiN are listed ill otir Ctil'roilt diclionary, 41 flags</td></tr><tr><td>per e.'ord 7 have been lised so far, bill later it iliay</td></tr><tr><td>h\u00a2\" liecessary to iise illore, [leCallSO of this, two long</td></tr><tr><td>inl.egers (whose bits rel/reselll flags. 17)r a toial of 64</td></tr><tr><td>flags) arv assigned for every word.</td></tr></table>",
	"html": null
	},
	"TABREF2": {
	"text": "Afier tile root of the word is found, tile rest of tile word is considered as its suli]xes. The first, vowel in the sutfixes part must be in harmony with tile last vowel of the root, while tile succeediug vowels must be in harnmny with the vowel preceding them.",
	"num": null,
	"type_str": "table",
	"content": "<table><tr><td colspan=\"2\">For example, both METN[ (accusative of text) and</td></tr><tr><td colspan=\"2\">METiN][ (accusative of strong) are correct although</td></tr><tr><td colspan=\"2\">the root of both words is MET[N (text, strong) be-</td></tr><tr><td colspan=\"2\">catlse this word call be used in twodifferent meanings.</td></tr><tr><td>3.4. Morphophonemic</td><td>Check</td></tr><tr><td colspan=\"2\">Turkish words obey vowel and COllSOll~lllt harmouy</td></tr><tr><td colspan=\"2\">rules during agglutination (see sections :3.2.1 and</td></tr><tr><td colspan=\"2\">3.2.2). The vowel harmony check may be done jnst</td></tr><tr><td colspan=\"2\">after tile root determination, but other morphophone-</td></tr><tr><td colspan=\"2\">mic checks should be done during morphological anal-</td></tr><tr><td>3sis,</td><td/></tr></table>",
	"html": null
	},
	"TABREF3": {
	"text": "",
	"num": null,
	"type_str": "table",
	"content": "<table><tr><td>there, or ~tgain pass hltck to the previous ()lie, since</td></tr><tr><td>the da.ss of a stem can change when it, receives certain</td></tr><tr><td>suffixes. \"['lie switches between parsers C~l] SOllletinles</td></tr><tr><td>he very complicated. Some suffixes can have two dif-</td></tr><tr><td>ferent usages. In such eases both possibihties haw~ to</td></tr><tr><td>he considered.</td></tr><tr><td>is used</td></tr><tr><td>Io separate tile suffixes of a word from left to right,</td></tr><tr><td>;111(I I/ace is tlsed to p;q'se tilose su{[ixes tlsil]g Illorpilo-</td></tr><tr><td>logical rules of Turkish granllrlar.</td></tr><tr><td>The models given in various books on Turkish gram</td></tr><tr><td>mar [I. 2, 1. 5. 14} and previous research on Turkish</td></tr><tr><td>COml)utational linguistics [12. 16] have been ul,ilized</td></tr><tr><td>in for generating the rufi's used in the parsers. Addi-</td></tr><tr><td>tionally, all of tim known exceplioua] cases ]lave also</td></tr><tr><td>been considered (see [20]). Although all the eonju-</td></tr><tr><td>gational suffixes flaw? been included into the rules,</td></tr><tr><td>only a mlallsubset of the derivalional suttixes have</td></tr><tr><td>heen ha]idled, The reasons lot Ihis sre dial majorily</td></tr><tr><td>of Ihe derivatioual sullixes may he receiw~d by only a</td></tr><tr><td>small group of roots, and deternfining such groups is ;i</td></tr><tr><td>rat her dilficult an(I time-consuming job, and depends</td></tr><tr><td>on wmous sen(antic criteria. The derivational sutfixos</td></tr><tr><td>that may I)c. alfixed to all of Ill,? roots ill a {'lawn and</td></tr><tr><td>those which can he affixed to large I]{rcentage, Illll</td></tr><tr><td>UOi all, of the roots in their clas~ are inclu{led in lhe</td></tr><tr><td>rules. That makes it i)ossible to , limioate a number</td></tr><tr><td>of words from the dictionary.</td></tr><tr><td>'l~ho two p~ll'Sers ~11'(, allerllalively llscd. First parser</td></tr><tr><td>Io I}e limed is deternlined accordilig to Ill,. class of/It{'</td></tr><tr><td>root, hilt its the parsfilg COll]illlWs it IlHty be IleC(?S:-;&try</td></tr><tr><td>1(} s\\\\ilt.h frolll o11{, plll'S(?r I(} ill]other ~llld eOl/til]ll{'</td></tr><tr><td>8 i'IIC WOlf[ ~(}l, iN l)l'OtlOlllll?Cd slighl b' dilfel'elll ill Ihc I;~tlCl',</td></tr></table>",
	"html": null
	},
	"TABREF4": {
	"text": ")epending on the sulfixes, switches between the parsers are possihle. When the cud of the word is reached, if no errors ('all he tfUllld then the spelfillg of the word is correct. If any error is found in itny of the parsers or during ulorphophonenlic checks, a new root is searched. If another reel is found same operations are doile. If no suceessfld parsing can b,> done although lilt! Iirst. letter of the word is reached, the word is added into the OUtl)ut hist.",
	"num": null,
	"type_str": "table",
	"content": "<table><tr><td>Parsillg</td></tr><tr><td>contimles there until I.he suffix M{A} is nlatched.</td></tr><tr><td>This sulfix can either make a w~rh a noun or negate</td></tr><tr><td>it First cousideriug the possibility that it is used</td></tr><tr><td>as a derivationM suffix, tile noun parser is invoked.</td></tr><tr><td>'file rmnaiuing part of the word can not be parsed</td></tr><tr><td>by 1his parser. So accepthlg M{A} as the negation</td></tr><tr><td>suffix, tile verb parser is returned to ;hid parsing con-</td></tr><tr><td>tinues there. Later comes the sullix [Y]{A}N, which</td></tr><tr><td>is a sulfix i.fiat illakes ;t lIOill] fronl a verb, so ~lgS.ill</td></tr><tr><td>a switch to the noun parser is made. Continuing in</td></tr><tr><td>this p~trser, the word is parsed correctly.</td></tr><tr><td>Some Turkish roots call take the sullixes helonging</td></tr><tr><td>to both nominal or verhal chLsses. [:or such roots if</td></tr><tr><td>parsing is unsuccessfld in the first parser chosen, the</td></tr><tr><td>other olle UlnSt alsG be tried. For exalnphL (fie root of</td></tr><tr><td>the word A(]LAR (hungry I)eOl)fi~) is At7. 'Ellis root</td></tr><tr><td>may either he used as a verb (open) or as a uoun</td></tr><tr><td>(hungry). If parsing is first attempted with tile ver-</td></tr><tr><td>bal parser it will he unsuccessful. So we backtrack</td></tr><tr><td>aud use the nominal parser. With the nominal parser</td></tr><tr><td>the word can be parsed successfully.</td></tr><tr><td>Figure 1 shows the block diagram of the word anM-</td></tr><tr><td>ysis. Smumurizhlg, first, the syllable structure of the</td></tr><tr><td>word is checked. If it is wrong the word is added</td></tr><tr><td>into the output list of misspelled words, otherwise</td></tr><tr><td>the root is detemfined. If no root can be found the</td></tr><tr><td>word is reported as misspelled. If a root is tbund,</td></tr><tr><td>lirst Ihe vowel Ilarmony check is done. Then, ac-</td></tr><tr><td>cording to lhe ('lass of the root, ol]e of the parsers is</td></tr><tr><td>actiwlted Ill Ihe parsers, an the sutIixes ;(re isolated</td></tr><tr><td>OI/C Ily oue, ilecessary luorphophollenlic cfieeks a, re</td></tr><tr><td>done. l</td></tr></table>",
	"html": null
	}
	}
	}
	}