fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies

DOI10.1007/978-3-642-04131-0_4zbMath1192.68412OpenAlexW117670275MaRDI QIDQ5188619

Thomas Hanneforth

Publication date: 5 March 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04131-0_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (2)

Cycle-aware minimization of acyclic deterministic finite-state automata ⋮ fsm2

Cites Work

• Unnamed Item
• Efficient string matching
• Incremental Construction of Minimal Acyclic Finite-State Automata
• Using Ranked Semirings for Representing Morphology Automata

This page was built for publication: fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies