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 xfst 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.