Bootstrapping Structure using Similarity
| dc.creator | van Zaanen, Menno | |
| dc.date | 2001-04-03 | |
| dc.date.accessioned | 2026-07-07T03:17:04Z | |
| dc.date.available | 2026-07-07T03:17:04Z | |
| dc.description | In this paper a new similarity-based learning algorithm, inspired by string edit-distance (Wagner and Fischer, 1974), is applied to the problem of bootstrapping structure from scratch. The algorithm takes a corpus of unannotated sentences as input and returns a corpus of bracketed sentences. The method works on pairs of unstructured sentences or sentences partially bracketed by the algorithm that have one or more words in common. It finds parts of sentences that are interchangeable (i.e. the parts of the sentences that are different in both sentences). These parts are taken as possible constituents of the same type. While this corresponds to the basic bootstrapping step of the algorithm, further structure may be learned from comparison with other (similar) sentences. We used this method for bootstrapping structure from the flat sentences of the Penn Treebank ATIS corpus, and compared the resulting structured sentences to the structured sentences in the ATIS corpus. Similarly, the algorithm was tested on the OVIS corpus. We obtained 86.04 % non-crossing brackets precision on the ATIS corpus and 89.39 % non-crossing brackets precision on the OVIS corpus. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0104005 | |
| dc.identifier | http://arxiv.org/abs/cs/0104005 | |
| dc.identifier | Computational Linguistics in the Netherlands 1999 - Selected Papers from the Tenth CLIN Meeting, pages 235-245 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30583 | |
| dc.subject | Machine Learning | |
| dc.subject | Computation and Language | |
| dc.subject | I.2, I.2.6, I.2.7 | |
| dc.title | Bootstrapping Structure using Similarity | |
| dc.type | text |