Subject: fsmnlp ' 98 preliminary program and call for participation

the preliminary program for fsmnlp ' 98 international workshop on finite state methods in natural language processing is now available . the program and the text version of a registration form follows . more information as well as postscript and pdf forms of the registration form can be obtained from http : / / www . nlp . cs . bilkent . edu . tr / fsmnlp98 - kemal oflazer e-mail : ko @ cs . bilkent . edu . tr http : / / www . cs . bilkent . edu . tr / ~ ko / ko . html bilkent university tel : ( 90-312 ) 266-4133 ( sec ) computer engineering department 266-4000 x1258 ( off ) bilkent , ankara , 06533 turkiye 240-1627 ( home ) fax : ( 90-312 ) 266-4126 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - fsmnlp ' 98 international workshop on finite state methods in natural language processing sponsored by : eacl - european chapter of the association for computational linguistics , tubitak - turkish scientific and technological research council , nato science for stability program - tu-language project june 29 - july 1 , 1998 bilkent university ankara , turkey preliminary program june 29 , 1998 monday 9 : 00 - 18 : 00 tutorial a one - day practical introduction to finite - state computing instructor : ken beesley , xerox research centre europe grenoble , france scope : the course will include an introduction to regular languages , finite-state machines , finite state transducers , the xerox fst interface , and the lexc compiler . participants will get hands-on experience with the software , using exercises in natural-language morphology and phonology . all instruction and documentation will be in english . target : linguists and computer scientists interested in how finite-state technology can be applied to natural language processing . prerequisites : participants should know some basic unix commands and be able to edit text files using an editor like emacs or vi . although we assume no previous experience in finite-state computing , finite-state computing is a kind of computer programming , and participants should have some kind of programming experience . tentative contents - a gentle introduction to finite - state automata finite - state machines regular languages lookup finite - state automata lookup and generation - key finite - state operations union intersection subtraction concatenation iteration composition - finite - state morphology / phonology morphotactics phonological / orthographical variation - xerox extended regular expressions the xfst interface the stack read regex apply up , apply down exercises : esperanto verbs - simple replace rules ( extended regular expressions ) rule exercises : kanpat , brazilian portuguese - review : lexicons , rules , composition , the stack lexicon + rules exercise : bambona - the lexc language and compiler lexicons , continuation classes interface exercises : esperanto nouns , adjectives - lexc plus replace rules exercise : irish lenition - other tools and tricks twolc ( " two - level " rules and morphology ) separated dependencies and composition exercise : esperanto ge - nouns other filtering via composition - a large system : finite - state arabic morphology lexical databases finite - state lexicon ( lexc ) separated dependencies ( replace - rule filters ) variation ( rules ) designing " languages " modifications , tags , character encodings overall lookup and generation www interface ( java ) - questions , review of exercises june 30 , 1998 tuesday 9 : 45 opening remarks 10 : 00 - 11 : 00 plenary talk the proper treatment of optimality in computational phonology lauri karttunen xrce grenoble , france 11 : 00 11 : 30 break regular papers morning session 11 : 30 12 : 30 context-free parsing through regular approximation mark - jan nederhof dfki saarbrucken germany does tagging help parsing ? a case study on finite state parsing atro voutilainen university of helsinki , finland 12 : 30 14 : 00 lunch afternoon session 1 14 : 00 15 : 30 robust parsing using a hidden markov model wide r . hogenhout yuji matsumoto nara institute of tech . japan incremental construction of minimal acyclic finite state automata and transducers richard e . watson ribbit software , canada jan daciuk , university of gdansk , poland bruce e . watson ribbit software , canada treatment of e - moves in subset construction gertjan van noord groningen univ . the netherlands 15 : 30 - 16 : 00 break afternoon session 16 : 00 - 17 : 00 learning finite state models for language understanding david pico enrique vidal polytechnic university of valencia , spain a multilingual natural language interface to regular expressions aarne ranta xrce grenoble , france july 1 , 1998 wednesday morning session 10 : 00 - 12 : 00 implementing voting constraints with finite state transducers kemal oflazer gokhan tur bilkent university , turkey feature structures , unification and finite state transducers remi zajac crl / nmsu usa using genericity to create customizable finite state tools hoffman marcus sandro pedrazzini idsia switzerland constraining separated morphotactic dependencies in finite state grammars ken beesley xrce grenoble , france 12 : 00 13 : 30 lunch 13 : 30 16 : 30 visit to museum of anatolian civilizations - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - fsmnlp ' 98 international workshop on finite state methods in natural language processing june 29 - july 1 , 1998 bilkent university ankara , turkey registration form last name : first name : organization : address : : : telephone : fax : e - mail : web page url : workshop : june 29 - july 1 1998 [ ] tutorial registration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . usd 40 [ ] workshop registration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . usd 60 total usd . . . registration fee includes : copy of the proceedings , reception , coffee and tea during breaks , and visit to the museum of anatolian civilizations . social event : june 27 - 28 , 1998 [ ] visit to cappadocia region known for its lunar landscape , fairy-chimneys and underground cities . includes transportation , one night at a 3 * hotel , breakfast , and dinner , guided tour of all major sites . 99 usd / person * _ _ persons usd . . . accommodation [ ] hotel bilkent ( 4 * hotel on campus with transportation to the workshop site ) . special rates for workshop participants are ( including vat ) : single room usd 65 / night double room usd 80 / night will arrive on _ _ _ _ _ _ _ _ _ _ _ _ _ and depart on _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ hotel bill is payable during check-out . [ ] university dormitory room very close to workshop site , with shared showers and facilities . 1 person per room free of charge ( * * only linens and blankets will be provided . * * ) payment for the workshop registration and cappadocia trip can only be made by credit card . please provide the information below : card type visa [ ] mastercard / eurocard [ ] card number _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ expiration date : _ _ / _ _ my signature below will be considered to have been made on the applicable credit card or charge card bill form for the amount indicated , for registration to fsmnlp ' 98 workshop . amount to be paid : usd _ _ _ _ name of the card holder : signature of the card holder : please send your registration forms by fax to fsmnlp ' 98 registration c / o kemal oflazer fax no : + 90 + 312-266 4126 or by mail to : fsmnlp ' 98 registration c / o kemal oflazer bilkent university department of computer engineering and info . sci . tr-06533 ankara turkey no electronic submissions will be possible as we have been requested to require signatures for credit card transactions .
