119 search results - page 12 / 24 » Arabic Language Modeling with Finite State Transducers |
97
Voted
ISPDC
2003
IEEE
15 years 2 months ago
2003
IEEE
Many formal modelling notations for business processes have been proposed during the last decade. They can be broadly classified into high-level visual notations, with an intuiti...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this ch...
EMNLP
2009
14 years 7 months ago
2009
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
111
click to vote
EMNLP
2009
14 years 7 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...