Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Finite-State Methods and Natural Language Processing [[electronic resource] ] : 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers / / edited by Anssi Yli-Jyrä, Andras Kornai, Jacques Sakarovitch, Bruce Watson
| Finite-State Methods and Natural Language Processing [[electronic resource] ] : 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers / / edited by Anssi Yli-Jyrä, Andras Kornai, Jacques Sakarovitch, Bruce Watson |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 147 p. 44 illus.) |
| Disciplina | 006.3/5 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Natural language processing (Computer science)
Computer programming Programming languages (Electronic computers) Artificial intelligence Mathematical logic Computer logic Natural Language Processing (NLP) Programming Techniques Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-642-14684-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorials -- Learning Finite State Machines -- Special Theme Tutorials -- Developing Computational Morphology for Low- and Middle-Density Languages -- Invited Papers -- fsm2 – A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata -- Selected Operations and Applications of n-Tape Weighted Finite-State Machines -- OpenFst -- Special Theme Invited Talks -- Morphological Analysis of Tone Marked Kinyarwanda Text -- Regular Papers -- Minimizing Weighted Tree Grammars Using Simulation -- Compositions of Top-Down Tree Transducers with ?-Rules -- Reducing Nondeterministic Finite Automata with SAT Solvers -- Joining Composition and Trimming of Finite-State Transducers -- Special Theme Extended Abstracts -- Porting Basque Morphological Grammars to foma, an Open-Source Tool -- Describing Georgian Morphology with a Finite-State System -- Finite State Morphology of the Nguni Language Cluster: Modelling and Implementation Issues -- A Finite State Approach to Setswana Verb Morphology -- Competition Announcements -- Zulu: An Interactive Learning Competition. |
| Record Nr. | UNISA-996466215903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Finite-State Methods and Natural Language Processing [[electronic resource] ] : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / / edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki
| Finite-State Methods and Natural Language Processing [[electronic resource] ] : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / / edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XIV, 312 p.) |
| Disciplina | 006.3/5 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Natural language processing (Computer science) Algorithms Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Natural Language Processing (NLP) Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN |
1-281-38797-5
3-540-35469-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465914203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||