Applications of Weighted Automata in Natural Language Processing

DOI10.1007/978-3-642-01492-5_14zbMath1484.68263OpenAlexW1559990457MaRDI QIDQ5072556

Jonathan May, Kevin M. Knight

Publication date: 28 April 2022

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01492-5_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Knowledge representation (68T30) Natural language processing (68T50)

Related Items (10)

Weighted finite automata over strong bimonoids ⋮ Weighted Automata and Weighted Logics ⋮ Singular value automata and approximate minimization ⋮ Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings ⋮ Language theoretic properties of regular DAG languages ⋮ On deterministic weighted automata ⋮ From Tree Automata to Rational Tree Expressions ⋮ Weighted automata ⋮ A Congruence-Based Perspective on Finite Tree Automata ⋮ Characterizing weighted MSO for trees by branching transitive closure logics

Cites Work

• A Mathematical Theory of Communication
• Summarization beyond sentence extraction: A probabilistic approach to sentence compression
• Generalized sequential machine maps
• Head-Driven Statistical Models for Natural Language Parsing
• Information Theory and Statistical Mechanics
• Minimizing Deterministic Weighted Tree Automata
• The Power of Extended Top-Down Tree Transducers
• Design of a linguistic statistical decoder for the recognition of continuous speech
• Finding the k Shortest Paths
• Three models for the description of language
• Mappings and grammars on trees
• Transition network grammars for natural language analysis
• Tiburon: A Weighted Tree Automata Toolkit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Applications of Weighted Automata in Natural Language Processing