Sciweavers

FSMNLP
2005
Springer
14 years 6 months ago
Principles, Implementation Strategies, and Evaluation of a Corpus Query System
Abstract. The last decade has seen an increase in the number of available corpus query systems. These systems generally implement a query language as well as a database model. We r...
Ulrik Petersen
FSMNLP
2005
Springer
14 years 6 months ago
Parsing with Lexicalized Probabilistic Recursive Transition Networks
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
Alexis Nasr, Owen Rambow
FSMNLP
2005
Springer
14 years 6 months ago
WFSM Auto-intersection and Join Algorithms
The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. ...
André Kempe, Jean-Marc Champarnaud, Franck ...
FSMNLP
2005
Springer
14 years 6 months ago
Algorithms for Minimum Risk Chunking
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
Martin Jansche
FSMNLP
2005
Springer
14 years 6 months ago
Klex: A Finite-State Transducer Lexicon of Korean
This paper describes the implementation and system details of Klex, a finite-state transducer lexicon for the Korean language, developed using XRCE’s Xerox Finite State Tool (XF...
Na-Rae Han
FSMNLP
2005
Springer
14 years 6 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
FSMNLP
2005
Springer
14 years 6 months ago
Finite-State Registered Automata and Their Uses in Natural Languages
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
Yael Cohen-Sygal, Shuly Wintner
FSMNLP
2005
Springer
14 years 6 months ago
An FST Grammar for Verb Chain Transfer in a Spanish-Basque MT System
Abstract. We are working on the construction of a Spanish-Basque (eseu) machine translation tool using the traditional transfer model based on shallow and dependency parsing. Spani...
Iñaki Alegria, Arantza Díaz de Ilarr...
FSMNLP
2005
Springer
14 years 6 months ago
A Programming Language for Finite State Transducers
This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both si...
Helmut Schmid
FSMNLP
2005
Springer
14 years 6 months ago
German Compound Analysis with wfsc
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
Anne Schiller