有限状态方法与自然语言处理： FSMNLP 2005/会议文集/Finite-state methods and natural language processing

Keep connected to what's happening in the world of books by signing up for Amazon.com Books Delivers, our monthly subscription e-mail newsletters. Discover new releases in your favorite categories, popular pre-orders and bestsellers, exclusive author interviews and podcasts, special sales, and more.

The LNAI series reports state-of-the-art results in artificial intelligence re-
search, development, and education, at a high level and in both printed and
electronic form. Enjoying tight cooperation with the R&D community, with
numerous individuals, as well as with prestigious organizations and societies,
LNAI has grown into the most comprehensive artificial intelligence research
forum available.
The scope of LNAI spans the whole range of artificial intelligence and intelli-
gent information processing including interdisciplinary topics in a variety of
application fields. The type of material published traditionally includes
proceedings (published in time for the respective conference)
post-proceedings (consisting of thoroughly revised final full papers)
research monographs (which may be based on PhD work)

Invited Lectures
Characterizations of Regularity
Finnish Optimality-Theoretic Prosody
Contributed Papers
Partitioning Multitape Transducers
Squeezing the Infinite into the Finite: Handling the OT Candidate Set with Finite State Technology
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
Finite State Machines
and a Chunker Implemented as Weighted
Volanschi
Modelling the Semantics of Calendar Expressions as Extended Regular
Expressions
Using Finite State Technology in a
Tool for Linguistic Exploration Erba Miige Erdo~mu~
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
……
Abstracts of Interatioes Precsaminths
Abstracts of BSlofrwer Deense
Auhor Index