Abstract
A local text alignment algorithm is introduced in this work for synchronizing transcripts. The proposed algorithm can be used for any transcript alignment process where high computational complexity is a concern. Dynamic programming is typically used to align a set of transcripts: however, the computational complexity of dynamic programming is high. To reduce the computational complexity, a local dynamic programming algorithm is introduced that aligns subsections of the transcripts. Aligning subsections of the transcripts greatly reduces the information needed for accurate synchronization. The information is reduced because it is not necessary to compare all words between the two transcripts. For example, words at the beginning of one transcript would not be compared to the words at the end of the other transcript. The subsection size is dependent on the total number of alignment errors between the transcripts. It is shown that the computational complexity of the proposed local dynamic programming algorithm is greatly reduced while preserving alignment accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
