Applications of Weighted Automata in Natural Language Processing

  • Knight K
  • May J
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We explain why weighted automata are an attractive knowledge representation for natural language problems. We first trace the close historical ties between the two fields, then present two complex real-world problems, transliteration and translation. These problems...

Cite

CITATION STYLE

APA

Knight, K., & May, J. (2009). Applications of Weighted Automata in Natural Language Processing (pp. 571–596). https://doi.org/10.1007/978-3-642-01492-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free