EP 1398759 B1 20090218 - Systems and methods for determining the N-best strings of an automaton
Title (en)
Systems and methods for determining the N-best strings of an automaton
Title (de)
Vorrichtungen und Verfahren zur Ermittlung der N-beste Ketten eines Automaten
Title (fr)
Systèmes et méthodes pour déterminer les N-meilleures chaînes d'un automate à états finis
Publication
Application
Priority
- US 36910902 P 20020329
- US 30109802 A 20021121
Abstract (en)
[origin: US2003187644A1] Systems and methods for identifying the N-best strings of a weighted automaton. A potential for each state of an input automaton to a set of destination states of the input automaton is first determined. Then, the N-best paths are found in the result of an on-the-fly determinization of the input automaton. Only the portion of the input automaton needed to identify the N-best paths is determinized. As the input automaton is determinized, a potential for each new state of the partially determinized automaton is determined and is used in identifying the N-best paths of the determinized automaton, which correspond exactly to the N-best strings of the input automaton.
IPC 8 full level
G06F 3/00 (2006.01); G06F 17/10 (2006.01); G10L 15/00 (2006.01); G10L 15/08 (2006.01); G10L 15/14 (2006.01); G10L 21/00 (2006.01)
CPC (source: EP US)
G10L 15/00 (2013.01 - EP US); G10L 2015/085 (2013.01 - EP US)
Designated contracting state (EPC)
DE FR GB
DOCDB simple family (publication)
US 2003187644 A1 20031002; US 8234115 B2 20120731; CA 2423145 A1 20030929; CA 2423145 C 20101116; DE 60326196 D1 20090402; EP 1398759 A2 20040317; EP 1398759 A3 20041229; EP 1398759 B1 20090218; US 2012296648 A1 20121122; US 8527273 B2 20130903
DOCDB simple family (application)
US 30109802 A 20021121; CA 2423145 A 20030321; DE 60326196 T 20030327; EP 03100794 A 20030327; US 201213562022 A 20120730