From d7fa6d79b31d82ca04e5f59304ae1bbc9af58cef Mon Sep 17 00:00:00 2001 From: graehl Date: Wed, 1 Sep 2010 00:06:21 +0000 Subject: fsa notes git-svn-id: https://ws10smt.googlecode.com/svn/trunk@639 ec762483-ff6d-05da-a07a-a48fb63a330f --- decoder/apply_fsa_models.README | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'decoder') diff --git a/decoder/apply_fsa_models.README b/decoder/apply_fsa_models.README index d487c96d..7e116a62 100755 --- a/decoder/apply_fsa_models.README +++ b/decoder/apply_fsa_models.README @@ -16,6 +16,6 @@ types of chart items: A->t.*,a,b (trie node t) with mutable state t-next for generating successor lazily (vs. all at once) -A->t.B,a,b (t-next of A->t.* points to (B,t')): mutable state b-next for choosing which B->b,? to use. note: such an item can't be queued immediately on its own, but can be added to the pending list of B->b,? +A->t.B,a,b (t-next of A->t.* points to (B,t')): mutable state b-next for choosing which B->b,? to use. note: such an item can't be queued immediately on its own, but can be added to the pending list of B->b,? ; once any B->b,? is completed then we see if any more b-next are already known; if they're exhausted then we add back to pending list? A->a,? - list of all known (b,inside prob) such that A[a,b]. we may also choose to represent this as A->.*,a,a. -- cgit v1.2.3