Discovering utterance fragment boundaries in small unsegmented texts
We propose an algorithm for inferring boundaries of utterance fragments in relatively small unsegmented texts. The algorithm looks for subsequent largest chunks that occur at least twice in the text. Then adjacent fragments below an arbitrary length bound are merged. In our pilot experiment three ty...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
2016
|
| Sorozat: | Magyar Számítógépes Nyelvészeti Konferencia
12 |
| Kulcsszavak: | Nyelvészet - számítógép alkalmazása |
| Online Access: | http://acta.bibl.u-szeged.hu/58982 |
| LEADER | 01780naa a2200205 i 4500 | ||
|---|---|---|---|
| 001 | acta58982 | ||
| 005 | 20260224081030.0 | ||
| 008 | 190701s2016 hu o 100 eng d | ||
| 020 | |a 978-963-306-450-4 | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Drienkó László | |
| 245 | 1 | 0 | |a Discovering utterance fragment boundaries in small unsegmented texts |h [elektronikus dokumentum] / |c Drienkó László |
| 260 | |c 2016 | ||
| 300 | |a 273-281 | ||
| 490 | 0 | |a Magyar Számítógépes Nyelvészeti Konferencia |v 12 | |
| 520 | 3 | |a We propose an algorithm for inferring boundaries of utterance fragments in relatively small unsegmented texts. The algorithm looks for subsequent largest chunks that occur at least twice in the text. Then adjacent fragments below an arbitrary length bound are merged. In our pilot experiment three types of English text were segmented: mother-child language from the CHILDES database, excerpts from Gulliver's travels by Jonathan Swift, and Now We Are Six, a children’s poem by A. A. Milne. The results are interpreted in terms of four precision metrics: Inference Precision, Alignment Precision, Redundancy, and Boundary Variability. We find that i) Inference Precision grows with merge-length, whereas Alignment Precision decreases – i.e. the longer a segment is the more probable that its two boundaries are correct; ii) Redundancy and Boundary Variability also decrease with the merge-length bound – i.e. the less boundaries we insert, the closer they are to the ideal boundaries. | |
| 695 | |a Nyelvészet - számítógép alkalmazása | ||
| 710 | |a Magyar Számítógépes Nyelvészeti Konferencia (12.) (2016) (Szeged) | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/58982/1/msznykonf_012_273-281.pdf |z Dokumentum-elérés |