Uniformizing rational relations for natural language applications using weighted determinization

DOI10.1007/978-3-642-18098-9_19MaRDI QIDQ3073636zbMATH OpenOpenAlexFDO

Authors J. Howard Johnson

Publication date 11 February 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18098-9_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 1408334
• scientific article; zbMATH DE number 1047903
• scientific article; zbMATH DE number 6741931
• A uniformization theorem for nested word to word transductions
• Applications of weighted automata in natural language processing

Cites work

• A unified framework for disambiguating finite transductions
• Algebraic structures for transitive closure
• Elements of automata theory. Translated from the French by Reuben Thomas
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 1775630 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• The design principles of a weighted finite-state transducer library
• Transitive closure and related semiring properties via eliminants

Cited in

(3)

• scientific article; zbMATH DE number 1408334 (Why is no real title available?)
• scientific article; zbMATH DE number 7376069 (Why is no real title available?)
• A class of rational trace relations closed under composition

This page was built for publication: Uniformizing rational relations for natural language applications using weighted determinization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073636)