Method for Improving the Fast Match in Continuous Speech
Original Publication Date: 1985-Apr-01
Included in the Prior Art Database: 2005-Feb-18
The amount of acoustic information delivered by a short word may not be sufficient without the context of the following word. A fast match algorithm uses confluent links (CLINKS) and boundary links (BLINKS) as a sort of alphabet of acoustic data; this improvement extends a short word by a few clinks of the following word, thus improving recognizability thresholds. Before discussing details, it is useful to describe briefly the clink lattice used in the fast match in a typical phonetic graph which has a series of confluent nodes. Preceding the first confluent node is the LEFT CONNECTION, and following the last confluent node is the RIGHT CONNECTION. Corresponding to a particular right connection and a particular left connection is a sequence of CLINKS called a BLINK.