September 30th, 2007, Borovetz, Bulgaria
Finite State methods are widely used in the area of NLP. Recent advances in the area provided highly efficient and scalable techniques for various difficult problems like representing ultra large dictionaries, complex contextual rewrite rules, approximate search in huge dictionaries and many others.
The goal of the workshop is to study the problems encountered in applying Finite State methods in the NLP area in general and more specifically for error detection and correction, text rewriting and dictionary representation. We hope that the workshop will allow researchers to present current research and development in addressing this challenge.
|10.00 - 10.15||Opening remarks|
|10.15 - 11.00||Clemens MARSCHNER: Efficient Matching Using Overlay Transducers|
|11.00 - 11.45||Ivan PEIKOV: Rule Definition Language and a Bimachine Compiler|
|11.45 - 12.00||Coffee break|
|12.00 - 12.45||Kalin GEORGIEV: Compression of Minimal Acyclic Deterministic FSAs Preservingthe Linear Accepting Complexity|
|12.45 - 14.00||Lunch break|
|14.00 - 14.45||Andreas W. HAUSER and Klaus U. SCHULZ: Unsupervised Learning of Edit Distance Weights for Retrieving Historical Spelling Variations|
|14.45 - 15.30||Stoyan MIHOV, Petar MITANKIN, Annette GOTSCHAREK, Ulrich REFFLE, Klaus U. SCHULZ and Christoph RINGLSTETTER: Tuning the Selection of Correction Candidates for Garbled Tokens using Error Dictionaries|
|15.30 - 15.45||Coffee break|
|15.45 - 16.30||Petar MITANKIN: Approximate Word Matching with Synchronized Rational Relations|
|16.30 - 17.00||Discussion and closing remarks|
Authors are asked to submit papers in electronic form (PS or PDF) to: email@example.com
There will be no page limitation, however, a default value for the length is 5-15 pages. For longer papers, a clear motivation is needed. Papers may represent ongoing and unfinished work.
All papers presented at the workshop will be published in the workshop proceedings.