↓ Skip to main content

Finite-state methods and natural language processing : 5th international workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005 : revised papers

Overview of attention for book
Cover of 'Finite-state methods and natural language processing : 5th international workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005 : revised papers'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Characterizations of Regularity
  3. Altmetric Badge
    Chapter 2 Finnish Optimality-Theoretic Prosody
  4. Altmetric Badge
    Chapter 3 Partitioning Multitape Transducers
  5. Altmetric Badge
    Chapter 4 Squeezing the Infinite into the Finite
  6. Altmetric Badge
    Chapter 5 A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers
  7. Altmetric Badge
    Chapter 6 Finite-State Registered Automata and Their Uses in Natural Languages
  8. Altmetric Badge
    Chapter 7 TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
  9. Altmetric Badge
    Chapter 8 Klex: A Finite-State Transducer Lexicon of Korean
  10. Altmetric Badge
    Chapter 9 Longest-Match Pattern Matching with Weighted Finite State Automata
  11. Altmetric Badge
    Chapter 10 Finite-State Syllabification
  12. Altmetric Badge
    Chapter 11 Algorithms for Minimum Risk Chunking
  13. Altmetric Badge
    Chapter 12 Collapsing ε -Loops in Weighted Finite-State Machines
  14. Altmetric Badge
    Chapter 13 WFSM Auto-intersection and Join Algorithms
  15. Altmetric Badge
    Chapter 14 Further Results on Syntactic Ambiguity of Internal Contextual Grammars
  16. Altmetric Badge
    Chapter 15 Error-Driven Learning with Bracketing Constraints
  17. Altmetric Badge
    Chapter 16 Parsing with Lexicalized Probabilistic Recursive Transition Networks
  18. Altmetric Badge
    Chapter 17 Integrating a POS Tagger and a Chunker Implemented as Weighted Finite State Machines
  19. Altmetric Badge
    Chapter 18 Modelling the Semantics of Calendar Expressions as Extended Regular Expressions
  20. Altmetric Badge
    Chapter 19 Using Finite State Technology in a Tool for Linguistic Exploration
  21. Altmetric Badge
    Chapter 20 Applying a Finite Automata Acquisition Algorithm to Named Entity Recognition
  22. Altmetric Badge
    Chapter 21 Principles, Implementation Strategies, and Evaluation of a Corpus Query System
  23. Altmetric Badge
    Chapter 22 On Compact Storage Models for Gazetteers
  24. Altmetric Badge
    Chapter 23 German Compound Analysis with wfsc
  25. Altmetric Badge
    Chapter 24 Scaling an Irish FST Morphology Engine for Use on Unrestricted Text
  26. Altmetric Badge
    Chapter 25 Improving Inter-level Communication in Cascaded Finite-State Partial Parsers
  27. Altmetric Badge
    Chapter 26 Pivotal Synchronization Languages: A Framework for Alignments
  28. Altmetric Badge
    Chapter 27 A Complete FS Model for Amharic Morphographemics
  29. Altmetric Badge
    Chapter 28 Tagging with Delayed Disambiguation
  30. Altmetric Badge
    Chapter 29 A New Algorithm for Unsupervised Induction of Concatenative Morphology
  31. Altmetric Badge
    Chapter 30 Morphological Parsing of Tone: An Experiment with Two-Level Morphology on the Ha Language
  32. Altmetric Badge
    Chapter 31 Describing Verbs in Disjoining Writing Systems
  33. Altmetric Badge
    Chapter 32 An FST Grammar for Verb Chain Transfer in a Spanish-Basque MT System
  34. Altmetric Badge
    Chapter 33 Finite State Transducers Based on k-TSS Grammars for Speech Translation
  35. Altmetric Badge
    Chapter 34 Unsupervised Morphology Induction Using Morfessor
  36. Altmetric Badge
    Chapter 35 SProUT – A General-Purpose NLP Framework Integrating Finite-State and Unification-Based Grammar Formalisms
  37. Altmetric Badge
    Chapter 36 Tool Demonstration: Functional Morphology
  38. Altmetric Badge
    Chapter 37 From Xerox to Aspell: A First Prototype of a North Sámi Speller Based on TWOL Technology
  39. Altmetric Badge
    Chapter 38 A Programming Language for Finite State Transducers
  40. Altmetric Badge
    Chapter 39 FIRE Station
Attention for Chapter 7: TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
Altmetric Badge

Readers on

mendeley
13 Mendeley
citeulike
1 CiteULike
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
Chapter number 7
Book title
Finite-State Methods and Natural Language Processing
Published by
Springer, Berlin, Heidelberg, September 2005
DOI 10.1007/11780885_7
Book ISBNs
978-3-54-035467-3, 978-3-54-035469-7
Authors

Alexander Geyken, Thomas Hanneforth, Geyken, Alexander, Hanneforth, Thomas

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Germany 3 23%
Sweden 1 8%
South Africa 1 8%
Unknown 8 62%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 23%
Student > Master 3 23%
Researcher 2 15%
Lecturer 1 8%
Professor 1 8%
Other 3 23%
Readers by discipline Count As %
Linguistics 6 46%
Computer Science 5 38%
Physics and Astronomy 1 8%
Design 1 8%