Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization
From MaRDI portal
Publication:3073636
DOI10.1007/978-3-642-18098-9_19zbMath1297.68174OpenAlexW1505124665MaRDI QIDQ3073636
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
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Natural language processing (68T50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transitive closure and related semiring properties via eliminants
- A unified framework for disambiguating finite transductions
- Algebraic structures for transitive closure
- The design principles of a weighted finite-state transducer library
- GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
This page was built for publication: Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization