Vai al contenuto principale della pagina
| Titolo: |
Finite-State Methods and Natural Language Processing : 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005, Revised Papers / / edited by Anssi Yli-Jyrä, Lauri Karttunen, Juhani Karhumäki
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Edizione: | 1st ed. 2006. |
| Descrizione fisica: | 1 online resource (XIV, 312 p.) |
| Disciplina: | 006.3/5 |
| Soggetto topico: | Artificial intelligence |
| Machine theory | |
| Natural language processing (Computer science) | |
| Algorithms | |
| Computer science | |
| Artificial Intelligence | |
| Formal Languages and Automata Theory | |
| Natural Language Processing (NLP) | |
| Computer Science Logic and Foundations of Programming | |
| Altri autori: |
Yli-JyraAnssi
KarttunenLauri
KarhumakiJuhani
|
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| 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 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. |
| Sommario/riassunto: | Theseproceedingscontaintherevisedversionsofthepaperspresentedatthe5th InternationalWorkshopofFinite-StateMethods andNaturalLanguageProce- ing, FSMNLP 2005. The book includes also the extended abstracts of a number of poster papers and software demos accepted to this conference-like workshop. FSMNLP 2005 was held in Helsinki, Finland, on September 1-2, 2005. The eventwasthe'fthinstanceintheseriesofFSMNLPworkshops,andthe'rstthat wasarrangedasastand-aloneevent,withtwosatelliteeventsofitsown:theTwo- Level Morphology Day (TWOLDAY) and a national workshop on Automata, Words and Logic (AWL). The earlier FSMNLP workshops have been mainly arrangedin conjunction with a bigger event such as an ECAI, ESSLLI or EACL workshop, and this practice may still be favored in the future. The collocationof the threeeventspromoteda multidisciplinaryatmosphere. For this reason, the focus of FSMNLP 2005 covered a variety of topics related but not restricted to ?nite-state methods in natural language processing. The 24 regular papers and 7 poster papers wereselected from 50 submissions to the workshop. Each submitted regular paper was evaluated by at least three Program Committee members, with the help of external referees. In addition to the submitted papers and two invited lectures, six software demos were p- sented. The authors of the papers and extended abstracts come from Canada, Denmark, Finland, France, Germany, India, Ireland, Israel, Japan, The Neth- lands, Norway, Spain, South Africa, Sweden, Turkey, and the USA. |
| Titolo autorizzato: | Finite-state methods and natural language processing ![]() |
| ISBN: | 9781281387974 |
| 1281387975 | |
| 9783540354697 | |
| 3540354697 | |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910484790103321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |