Finite-State Methods and Natural Language Processing : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers
by Yli-jyra, Anssi; Kattunen, Lauri; Karhumaki, JuhaniFormat: Paperback
Pub. Date: 2007-02-03
Publisher(s): Springer Verlag
Other versions by this Author
List Price: $109.00
Rent Textbook
Select for Price
Rent Digital
$42.90*
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This book constitutes the thoroughly refereed post-proceedings of the 5th International Workshop on Finite-State Methods in Natural Language Processing, FSMNLP 2005, held in Helsinki, Finland in September 2005.The 24 revised full papers and 7 revised poster papers presented together with 2 invited contributions and the abstracts of 6 software demos were selected from 50 submissions and have gone through two rounds of reviewing and improvement. The papers address various topics in morphology, optimality theory, some special FSM families, weighted FSM algorithms, FSM representations, exploration, ordered structures, and surface parsing.
Table of Contents
| Characterizations of regularity | p. 1 |
| Finnish optimality-theoretic prosody | p. 9 |
| Partitioning multitape transducers | p. 11 |
| Squeezing the infinite into the finite : handling the OT candidate set with finite state technology | p. 21 |
| A novel approach to computer-assisted translation based on finite-state transducers | p. 32 |
| Finite-state registered automata and their uses in natural languages | p. 43 |
| TAGH : a complete morphology for German based on weighted finite state automata | p. 55 |
| Klex : a finite-state transducer lexicon of Korean | p. 67 |
| Longest-match pattern matching with weighted finite state automata | p. 78 |
| Finite-state syllabification | p. 86 |
| Algorithms for minimum risk chunking | p. 97 |
| Collapsing [epsilon]-loops in weighted finite-state machines | p. 110 |
| WFSM auto-intersection and join algorithms | p. 120 |
| Further results on syntactic ambiguity of internal contextual grammars | p. 132 |
| Error-driven learning with bracketing constraints | p. 144 |
| Parsing with lexicalized probabilistic recursive transition networks | p. 156 |
| Integrating a POS tagger and a chunker implemented as weighted finite state machines | p. 167 |
| Modelling the semantics of calendar expressions as extended regular expressions | p. 179 |
| Using finite state technology in a tool for linguistic exploration | p. 191 |
| Applying a finite automata acquisition algorithm to named entity recognition | p. 203 |
| Principles, implementation strategies, and evaluation of a corpus query system | p. 215 |
| On compact storage models for gazetteers | p. 227 |
| German compound analysis with wfsc | p. 239 |
| Scaling an Irish FST morphology engine for use on unrestricted text | p. 247 |
| Improving inter-level communication in cascaded finite-state partial parsers | p. 259 |
| Pivotal synchronization languages : a framework for alignments | p. 271 |
| A complete FS model for amharic morphographemics | p. 283 |
| Tagging with delayed disambiguation | p. 285 |
| A new algorithm for unsupervised induction of concatenative morphology | p. 288 |
| Morphological parsing of tone : an experiment with two-level morphology on the Ha language | p. 290 |
| Describing verbs in disjoining writing systems | p. 292 |
| An FST grammar for verb chain transfer in a Spanish-Basque MT system | p. 295 |
| Finite state transducers based on k-TSS grammars for speech translation | p. 297 |
| Unsupervised morphology induction using morfessor | p. 300 |
| SProUT - a general-purpose NLP framework integrating finite-state and unification-based grammar formalisms | p. 302 |
| Tool demonstration : functional morphology | p. 304 |
| From Xerox to Aspell : a first prototype of a North Sami speller based on TWOL technology | p. 305 |
| A programming language for finite state transducers | p. 308 |
| FIRE station | p. 310 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.