| 000 | 04932nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-35469-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125758.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2006 gw | s |||| 0|eng d | ||
| 020 |
_a9783540354697 _9978-3-540-35469-7 |
||
| 024 | 7 |
_a10.1007/11780885 _2doi |
|
| 050 | 4 | _aQ334-342 | |
| 050 | 4 | _aTA347.A78 | |
| 072 | 7 |
_aUYQ _2bicssc |
|
| 072 | 7 |
_aCOM004000 _2bisacsh |
|
| 072 | 7 |
_aUYQ _2thema |
|
| 082 | 0 | 4 |
_a006.3 _223 |
| 245 | 1 | 0 |
_aFinite-State Methods and Natural Language Processing _h[electronic resource] : _b5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / _cedited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki. |
| 250 | _a1st ed. 2006. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
| 300 |
_aXIV, 312 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v4002 |
|
| 505 | 0 | _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 ConcatenativeMorphology -- 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. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aNatural language processing (Computer science). | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aComputer science. | |
| 650 | 1 | 4 | _aArtificial Intelligence. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aNatural Language Processing (NLP). |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 700 | 1 |
_aYli-Jyrä, Anssi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aKarttunen, Lauri. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aKarhumäki, Juhani. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540354673 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540862109 |
| 830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v4002 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/11780885 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c181602 _d181602 |
||