Dependency structure analysis as combinatorial optimization

DOI10.1016/0020-0255(94)90021-3MaRDI QIDQ1328543zbMATH OpenOpenAlexFDO

Authors Kazuhiko Ozeki

Publication date 5 March 1995

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(94)90021-3

zbMATH Keywords

automatic recognition of spoken languageoptimal word sequencesword lattice

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Recommendations

• Computational complexity of probabilistic disambiguation
• An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
• Logical Aspects of Computational Linguistics
• On efficient parallel computations for some dynamic programming problems
• Implementation and Application of Automata

Cited in

(2)

• scientific article; zbMATH DE number 3943859 (Why is no real title available?)
• An assessment of assignment schemes for dependency graphs

This page was built for publication: Dependency structure analysis as combinatorial optimization

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