Using Ranked Semirings for Representing Morphology Automata

DOI10.1007/978-3-642-04131-0_1zbMath1191.68386OpenAlexW308797052MaRDI QIDQ5188609

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_1

zbMATH Keywords

weighted finite-state automatarepresentation of morphological analysers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

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

Cites Work

• Minimization algorithms for sequential transducers
• Unnamed Item

This page was built for publication: Using Ranked Semirings for Representing Morphology Automata