Work

Compilation of weighted finite-state transducers from decision trees

Year: 1996

Type: conference-paper

Abstract: We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is stateable in terms of regular expressions on the input string. Each leaf node can then be treated as a separate rule where the left and right contexts are constructable from the decisions made traversing the tree from the root to the leaf. These rules are compiled into transducers using the weighted rewite-rule rule-compilation algorithm described in (Mohri and Sproat, 1996).

Source: Proceedings of the conference - Association for Computational Linguistics. Meeting

DOI: 10.3115/981863.981892

Authors: Richard Sproat, Michael Riley

Institution: AT&T (United States)

Language: English

Topic: Natural Language Processing Techniques

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2096196871

FWCI: 2.393

Cites: 24

Cited by: 37

Related to: 10