Sciweavers

9 search results - page 1 / 2
» Per-node Optimization of Finite-State Mechanisms for Natural...
Sort
View
CICLING
2003
Springer
13 years 10 months ago
Per-node Optimization of Finite-State Mechanisms for Natural Language Processing
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
Alexander Troussov, Brian O'Donovan, Seppo Koskenn...
FSMNLP
2005
Springer
13 years 11 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
EACL
2003
ACL Anthology
13 years 6 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
LREC
2010
159views Education» more  LREC 2010»
13 years 6 months ago
Towards Optimal TTS Corpora
Unit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for de...
Didier Cadic, Cédric Boidin, Christophe d'A...
VLDB
2001
ACM
123views Database» more  VLDB 2001»
13 years 9 months ago
User-Optimizer Communication using Abstract Plans in Sybase ASE
imizer Communication using Abstract Plans in Sybase ASE Query optimizers are error prone, due to both their nature and the increased search space that modern query processing requ...
Mihnea Andrei, Patrick Valduriez