|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-35469-7 |
| 003 |
DE-He213 |
| 005 |
20221012193832.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540354697
|9 978-3-540-35469-7
|
| 024 |
7 |
|
|a 10.1007/11780885
|2 doi
|
| 050 |
|
4 |
|a Q334-342
|
| 050 |
|
4 |
|a TA347.A78
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 072 |
|
7 |
|a UYQ
|2 thema
|
| 082 |
0 |
4 |
|a 006.3
|2 23
|
| 245 |
1 |
0 |
|a Finite-State Methods and Natural Language Processing
|h [electronic resource] :
|b 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers /
|c edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XIV, 312 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Artificial Intelligence,
|x 2945-9141 ;
|v 4002
|
| 505 |
0 |
|
|a Invited 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.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Natural language processing (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
1 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Natural Language Processing (NLP).
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 700 |
1 |
|
|a Yli-Jyrä, Anssi.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Karttunen, Lauri.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Karhumäki, Juhani.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540862109
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540354673
|
| 830 |
|
0 |
|a Lecture Notes in Artificial Intelligence,
|x 2945-9141 ;
|v 4002
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11780885
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
