Example: Weighted acceptor

*slide courtesy of L. Karttunen (modified)

compile

Network

1

6

2

2

2

1

r/0

l/0

c/0

a/0

e/0

1

v/1

e/0

2

2

e/2

t/0

h/1

f/4

2

a/0

• Compute number of paths from each state (Q: how?)

• Successor states partition the path set

• Use offsets of successor states as arc weights

• Q: Would this work for an arbitrary numbering of the words?

Previous slide

Next slide

Back to first slide

View graphic version