Sciweavers

10 search results - page 1 / 2
» fsmnlp 2005
Sort
View
FSMNLP
2005
Springer
14 years 3 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 3 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 3 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 3 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 3 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