Finite-state devices such as finite-state automata and finite-state transducers have been known since the emergence of computer science and are recently extensively used in many areas of language technology. The use of finite-state devices is mainly motivated by their time and space efficiency. In this paper we present the Finite-State Machine Toolkit for building, combining and optimizing the finite-state machines, developed at the Language Technology Lab of the German Research Center for Artificial Intelligence
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
A quick translation between binary code and assembler for the purpose of simulation can be done by a...
Finite-state devices such as finite-state automata and finite-state transducers have been known sinc...
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
These proceedings contain the final versions of the papers presented at the 7th InternationalWorksho...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
HFST–Helsinki Finite-State Technology ( hfst.sf.net ) is a framework for compiling and applying ling...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Finite-state methods are finding ever increasing use among linguists as a way of modeling phonology ...
The article presents a short overview to the state of the art and relates the articles in this issue...
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
A quick translation between binary code and assembler for the purpose of simulation can be done by a...
Finite-state devices such as finite-state automata and finite-state transducers have been known sinc...
An optimizing finite-state transducer is a nondeterministic finite-state transducer in which states ...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
These proceedings contain the final versions of the papers presented at the 7th InternationalWorksho...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
HFST–Helsinki Finite-State Technology ( hfst.sf.net ) is a framework for compiling and applying ling...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Finite-state methods are finding ever increasing use among linguists as a way of modeling phonology ...
The article presents a short overview to the state of the art and relates the articles in this issue...
AbstractAn optimizing finite-state transducer is a nondeterministic finite-state transducer in which...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
A quick translation between binary code and assembler for the purpose of simulation can be done by a...