default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th FSMNLP 2005: Helsinki, Finland
- Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki:
Finite-State Methods and Natural Language Processing, 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005. Revised Papers. Lecture Notes in Computer Science 4002, Springer 2006, ISBN 3-540-35467-0
Invited Lectures
- Tero Harju:
Characterizations of Regularity. 1-8 - Lauri Karttunen:
Finnish Optimality-Theoretic Prosody. 9-10
Contributed Papers
- François Barthélemy:
Partitioning Multitape Transducers. 11-20 - Tamás Bíró:
Squeezing the Infinite into the Finite. 21-31 - Jorge Civera, Juan Miguel Vilar, Elsa Cubel, Antonio L. Lagarda, Sergio Barrachina
, Francisco Casacuberta, Enrique Vidal:
A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers. 32-42 - Yael Cohen-Sygal, Shuly Wintner:
Finite-State Registered Automata and Their Uses in Natural Languages. 43-54 - Alexander Geyken, Thomas Hanneforth:
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata. 55-66 - Na-Rae Han:
Klex: A Finite-State Transducer Lexicon of Korean. 67-77 - Thomas Hanneforth:
Longest-Match Pattern Matching with Weighted Finite State Automata. 78-85 - Mans Hulden:
Finite-State Syllabification. 86-96 - Martin Jansche:
Algorithms for Minimum Risk Chunking. 97-109 - J. Howard Johnson:
Collapsing epsilon-Loops in Weighted Finite-State Machines. 110-119 - André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart:
WFSM Auto-intersection and Join Algorithms. 120-131 - Lakshmanan Kuppusamy:
Further Results on Syntactic Ambiguity of Internal Contextual Grammars. 132-143 - Takashi Miyata, Kôiti Hasida:
Error-Driven Learning with Bracketing Constraints. 144-155 - Alexis Nasr, Owen Rambow:
Parsing with Lexicalized Probabilistic Recursive Transition Networks. 156-166 - Alexis Nasr, Alexandra Volanschi:
Integrating a POS Tagger and a Chunker Implemented as Weighted Finite State Machines. 167-178 - Jyrki Niemi, Lauri Carlson:
Modelling the Semantics of Calendar Expressions as Extended Regular Expressions. 179-190 - Kemal Oflazer, Mehmet Dinçer Erbas, Müge Erdogmus:
Using Finite State Technology in a Tool for Linguistic Exploration. 191-202 - Muntsa Padró, Lluís Padró:
Applying a Finite Automata Acquisition Algorithm to Named Entity Recognition. 203-214 - Ulrik Petersen:
Principles, Implementation Strategies, and Evaluation of a Corpus Query System. 215-226 - Jakub Piskorski:
On Compact Storage Models for Gazetteers. 227-238 - Anne Schiller:
German Compound Analysis with wfsc. 239-246 - Elaine Uí Dhonnchadha, Josef van Genabith:
Scaling an Irish FST Morphology Engine for Use on Unrestricted Text. 247-258 - Sebastian van Delden, Fernando Gomez:
Improving Inter-level Communication in Cascaded Finite-State Partial Parsers. 259-270 - Anssi Yli-Jyrä, Jyrki Niemi:
Pivotal Synchronization Languages: A Framework for Alignments. 271-282
Abstracts of Interactive Presentations
- Saba Amsalu, Dafydd Gibbon:
A Complete FS Model for Amharic Morphographemics. 283-284 - José M. Castaño, James Pustejovsky:
Tagging with Delayed Disambiguation. 285-287 - Harald Hammarström:
A New Algorithm for Unsupervised Induction of Concatenative Morphology. 288-289 - Lotta Harjula:
Morphological Parsing of Tone: An Experiment with Two-Level Morphology on the Ha Language. 290-291 - Arvi Hurskainen, Louis Louwrens, George Poulos:
Describing Verbs in Disjoining Writing Systems. 292-294 - Iñaki Alegria, Arantza Díaz de Ilarraza Sánchez, Gorka Labaka, Mikel Lersundi, Aingeru Mayor, Kepa Sarasola:
An FST Grammar for Verb Chain Transfer in a Spanish-Basque MT System. 295-296 - Alicia Pérez, Francisco Casacuberta, M. Inés Torres, Víctor G. Guijarrubia:
Finite State Transducers Based on k-TSS Grammars for Speech Translation. 297-299
Abstracts of Software Demos
- Mathias Creutz, Krista Lagus, Sami Virpioja:
Unsupervised Morphology Induction Using Morfessor. 300-301 - Witold Drozdzynski, Hans-Ulrich Krieger, Jakub Piskorski, Ulrich Schäfer:
SProUT - A General-Purpose NLP Framework Integrating Finite-State and Unification-Based Grammar Formalisms. 302-303 - Markus Forsberg, Aarne Ranta:
Tool Demonstration: Functional Morphology. 304-305 - Børre Gaup, Sjur N. Moshagen, Thomas Omma, Maaren Palismaa, Tomi Pieski, Trond Trosterud:
From Xerox to Aspell: A First Prototype of a North Sámi Speller Based on TWOL Technology. 306-307 - Helmut Schmid:
A Programming Language for Finite State Transducers. 308-309 - Bruce W. Watson:
FIRE Station. 310
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
