搜索结果: 1-2 共查到“应用语言学 Minimal Finite-State Automata,”相关记录2条 . 查询时间(0.125 秒)
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,
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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. ...