搜索结果: 1-8 共查到“文学 Automata”相关记录8条 . 查询时间(0.095 秒)
Pushdown Automata in Statistical Machine Translation
Pushdown Automata Statistical Machine Translation
2015/9/14
This article describes the use of pushdown automata (PDA) in the context of statistical machine translation and alignment under a synchronous context-free grammar. We use PDAs to compactly represent t...
Finite-State Registered Automata for Non-Concatenative Morphology
Non-Concatenative Morphology Registered Automata
2015/9/1
We introduce finite-state registered automata (FSRAs), a new computational device within the
framework of finite-state technology, specifically tailored for implementing non-concate...
Squibs and Discussions Comments on “Incremental Construction and Maintenance of Minimal Finite-State Automata,” by Rafael C. Carrasco and Mikel L. Forcada
Incremental Construction Minimal Finite-State Automata,
2015/8/31
in a recent article, Carrasco and Forcada (June 2002) presented two algorithms: one for incremental
addition of strings to the language of a minimal, deterministic, cyclic automaton, and one for
inc...
Incremental Construction and Maintenance of Minimal Finite-State Automata
Incremental Construction Maintenance of Minimal Finite-State Automata
2015/8/27
Daciuk et al. [Computational Linguistics 26(1):3–16 (2000)] describe a method for constructing incrementally minimal, deterministic, acyclic finite-state automata (dictionaries) from sets of strings. ...
Multitiered Nonlinear Morphology Using Multitape Finite Automata: A Case Study on Syriac and Arabic
Multitape Finite Automata Syriac and Arabic
2015/8/25
This paper presents a computational model for nonlinear morphology with illustrations from
Syriac and Arabic. The model is a multitiered one in that it allows for multiple lexical representations cor...
Incremental Construction of Minimal Acyclic Finite-State Automata
Minimal Acyclic Finite-State Automata deterministic
2015/8/25
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finitestate automata from a set of strings. Traditional methods consist of two phases: the first to...
Finite state automata and simple recurrent networks
Finite state automata simple recurrent networks
2015/6/19
Finite state automata and simple recurrent networks.
Becoming Automatous: Automata in The Old Curiosity Shop and Our Mutual Friend
Becoming Automatous Automata Old Curiosity Shop Our Mutual Friend
2010/11/12
An automaton is a mechanical dissembler, appearing to possess that which by definition it cannot – autonomy. In the Victorian material imagination, this liminal figure appears as an analogy for both n...
