Proceedings of the 21st International Conference on Computational Linguistics and the 44th Annual Meeting of the ACL - ACL '06 2006
DOI: 10.3115/1220175.1220179
|View full text |Cite
|
Sign up to set email alerts
|

Minimum cut model for spoken lecture segmentation

Abstract: We consider the task of unsupervised lecture segmentation. We formalize segmentation as a graph-partitioning task that optimizes the normalized cut criterion. Our approach moves beyond localized comparisons and takes into account longrange cohesion dependencies. Our results demonstrate that global analysis improves the segmentation accuracy and is robust in the presence of speech recognition errors.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
147
1
2

Year Published

2008
2008
2021
2021

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 133 publications
(153 citation statements)
references
References 32 publications
(23 reference statements)
1
147
1
2
Order By: Relevance
“…The method for segmentation that we have used is the minimum cut model from Malioutov and Barzilay ( [11]). This algorithm is based on sentence similarity.…”
Section: Probably the Most Well-known Methods Implementing This Ideas mentioning
confidence: 99%
“…The method for segmentation that we have used is the minimum cut model from Malioutov and Barzilay ( [11]). This algorithm is based on sentence similarity.…”
Section: Probably the Most Well-known Methods Implementing This Ideas mentioning
confidence: 99%
“…In practice, this process pruned approximately 35% to 40% of the frames from each document, which typically corresponded to non-topical or disfluent speech. Segmentation: After pruning, the remaining sequence of frames is segmented using a minimum cut algorithm as described in [11]. For the segmentation procedure, the similarity between frames fi and fj is calculated using the cosine similarity measure between their corresponding vectors of topical scores, si and sj.…”
Section: Windowingmentioning
confidence: 99%
“…Our work is also related to text segmentation (Ji et al, 2003) and meeting segmentation (Malioutov et al, 2006;Malioutov et al, 2007;Galley et al, 2003;Eisenstein et al, 2008). Text segmentation identifies boundaries of topic changes in long text documents, but we form threads of messages from streams consisting of short messages.…”
Section: Related Workmentioning
confidence: 99%