LEADER 06082nam 22008415 450 001 996465914203316 005 20200705162440.0 010 $a1-281-38797-5 010 $a3-540-35469-7 024 7 $a10.1007/11780885 035 $a(CKB)2550000000015567 035 $a(SSID)ssj0000317657 035 $a(PQKBManifestationID)11246699 035 $a(PQKBTitleCode)TC0000317657 035 $a(PQKBWorkID)10293588 035 $a(PQKB)11500921 035 $a(DE-He213)978-3-540-35469-7 035 $a(MiAaPQ)EBC3068158 035 $a(MiAaPQ)EBC4976825 035 $a(Au-PeEL)EBL4976825 035 $a(CaONFJC)MIL138797 035 $a(OCoLC)1027172747 035 $a(PPN)14903766X 035 $a(EXLCZ)992550000000015567 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFinite-State Methods and Natural Language Processing$b[electronic resource] $e5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers /$fedited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XIV, 312 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v4002 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-35467-0 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Characterizations of Regularity -- Finnish Optimality-Theoretic Prosody -- Contributed Papers -- Partitioning Multitape Transducers -- Squeezing the Infinite into the Finite -- A Novel Approach to Computer-Assisted Translation Based on Finite-State Transducers -- Finite-State Registered Automata and Their Uses in Natural Languages -- TAGH: A Complete Morphology for German Based on Weighted Finite State Automata -- Klex: A Finite-State Transducer Lexicon of Korean -- Longest-Match Pattern Matching with Weighted Finite State Automata -- Finite-State Syllabification -- Algorithms for Minimum Risk Chunking -- Collapsing ?-Loops in Weighted Finite-State Machines -- WFSM Auto-intersection and Join Algorithms -- Further Results on Syntactic Ambiguity of Internal Contextual Grammars -- Error-Driven Learning with Bracketing Constraints -- Parsing with Lexicalized Probabilistic Recursive Transition Networks -- Integrating a POS Tagger and a Chunker Implemented as Weighted Finite State Machines -- Modelling the Semantics of Calendar Expressions as Extended Regular Expressions -- Using Finite State Technology in a Tool for Linguistic Exploration -- Applying a Finite Automata Acquisition Algorithm to Named Entity Recognition -- Principles, Implementation Strategies, and Evaluation of a Corpus Query System -- On Compact Storage Models for Gazetteers -- German Compound Analysis with wfsc -- Scaling an Irish FST Morphology Engine for Use on Unrestricted Text -- Improving Inter-level Communication in Cascaded Finite-State Partial Parsers -- Pivotal Synchronization Languages: A Framework for Alignments -- Abstracts of Interactive Presentations -- A Complete FS Model for Amharic Morphographemics -- Tagging with Delayed Disambiguation -- A New Algorithm for Unsupervised Induction of Concatenative Morphology -- Morphological Parsing of Tone: An Experiment with Two-Level Morphology on the Ha Language -- Describing Verbs in Disjoining Writing Systems -- An FST Grammar for Verb Chain Transfer in a Spanish-Basque MT System -- Finite State Transducers Based on k-TSS Grammars for Speech Translation -- Abstracts of Software Demos -- Unsupervised Morphology Induction Using Morfessor -- SProUT ? A General-Purpose NLP Framework Integrating Finite-State and Unification-Based Grammar Formalisms -- Tool Demonstration: Functional Morphology -- From Xerox to Aspell: A First Prototype of a North Sámi Speller Based on TWOL Technology -- A Programming Language for Finite State Transducers -- FIRE Station. 410 0$aLecture Notes in Artificial Intelligence ;$v4002 606 $aArtificial intelligence 606 $aMathematical logic 606 $aNatural language processing (Computer science) 606 $aAlgorithms 606 $aComputer logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 0$aNatural language processing (Computer science). 615 0$aAlgorithms. 615 0$aComputer logic. 615 14$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aNatural Language Processing (NLP). 615 24$aNatural Language Processing (NLP). 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 676 $a006.3/5 702 $aYli-Jyrä$b Anssi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKarttunen$b Lauri$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKarhumäki$b Juhani$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465914203316 996 $aFinite-State Methods and Natural Language Processing$9772363 997 $aUNISA