Finite-State Methods and Natural Language Processing
Editat de Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäkien Limba Engleză Paperback – 7 dec 2006
Preț: 322.82 lei
Preț vechi: 403.53 lei
-20% Nou
Puncte Express: 484
Preț estimativ în valută:
57.13€ • 67.00$ • 50.09£
57.13€ • 67.00$ • 50.09£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540354673
ISBN-10: 3540354670
Pagini: 332
Ilustrații: XIV, 312 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540354670
Pagini: 332
Ilustrații: XIV, 312 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:2006
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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 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.