File size: 20,758 Bytes
6fa4bc9 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 |
{
"paper_id": "A92-1031",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T02:03:44.900939Z"
},
"title": "Tagging and Alignment of Parallel Texts: Current Status of BCP",
"authors": [
{
"first": "Armstrong",
"middle": [
"Winarske"
],
"last": "Issco",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Charles University",
"location": {
"settlement": "Prague ~"
}
},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Gensve",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Charles University",
"location": {
"settlement": "Prague ~"
}
},
"email": ""
},
{
"first": "S",
"middle": [],
"last": "Warwick-",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Charles University",
"location": {
"settlement": "Prague ~"
}
},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Gen~ve",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Charles University",
"location": {
"settlement": "Prague ~"
}
},
"email": ""
},
{
"first": "J",
"middle": [],
"last": "Hajie",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Charles University",
"location": {
"settlement": "Prague ~"
}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "",
"pdf_parse": {
"paper_id": "A92-1031",
"_pdf_hash": "",
"abstract": [],
"body_text": [
{
"text": "Access to on-line corpora is a useful tool for studies in lexicography, linguistics, and translation. Many means of accessing such corpora are available, but few, if any, provide more than a language for matching character strings. As a result, the user is obliged to spend a great deal of time extracting information herself. As more and more texts are put in machine readable format, it becomes increasingly obvious that more specialized, intelligent tools are required to fully exploit the available data. BCP, the Bilingual Concordancy Program under development at ISSCO, is an instance of such a tool.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In previous work done at ISSCO on BCP, a rather oversimplified view of text structure was taken . Attention was focused on the difficulties of alignment and somewhat less so on access questions. Alignment remains a subject of active research, but experience has proven that text marking and morphology are not to be taken so lightly. Indeed, many small difficulties have shown themselves to be insurmountable without the aid of heuristic decision modules. As a result, the initial approach to text tagging and morphology has been thoroughly revised.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The BCP package consists of four submodules: preprocesser, morphology, alignment, and access. The text pre-processor, bcpmark, marks paragraph and sentence boundaries, numbers, words, and punctuation. The morphological analyzer, bcpmorf, is built around a unification-based parser, and returns feature-structure descriptions in SGML format, although the feature structure itself is in a linear notation only. The alignment module is the subject of much experimentation and currently is running with the Church-Gale alignment algorithm . The access module has been described in previous work [Warwick et al., 1989] and will not be discussed further here. The focus of this abstract will be on bcpmark and bcpmorf. *Many thanks to Graham Russell for his invaluable advice on this abstract. tISSCO, 54 route des Acacias, Gen~ve 1227, Switzerland \"*Institute of Formal and Applied Linguistics, Faculty of Mathematics and Physics, Charles University, Malostrauskd n~n~st~ 25, 118 00 Praha 1, Czechoslovakia 3 bcpmark: The Pre-Processor bcpmark is the first step in preparing text for the alignment program. It marks paragraph and sentence boundaries, numbers, words, and punctuation, with the output in SGML notation, bepmark is easily customized to suit a particular text type or language via a userdefined data file. Extensions and alterations to the data are accordingly simple. There are accompanying tools to check number standardization results and sentence boundary marking. Languages currently supported are French, German, Italian, Czech, and English.",
"cite_spans": [
{
"start": 591,
"end": 613,
"text": "[Warwick et al., 1989]",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Brief Overview",
"sec_num": "2"
},
{
"text": "bcpmark is intended to be usable on all text types, so that entails a certain amount of flexibility. Regardless, there are two major problems: no interpretation of the input text, and the need to be \"parameterized\" for different textual conventions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "Problems instantly arise in conjunction with numbers, abbreviations, conflicts with differing punctuation conventions, and capitalization. In particular, German noun capitalization causes great problems to a system which relies heavily on capitalization marking sentence beginnings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "In bcpmark, the sentences are marked by either the onset of a paragraph marker or by encountering an endof-sentence punctuation mark in the appropriate context for a particular language. We define six contexts essential for deliminating sentences:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "1. Characters are always considered part of a word.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "2. Abbreviations which can never end a sentence even if they are followed by a dot. There may also be contracted abbreviations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "3. Abbreviations which in front of a number cannot end a sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "4. Words which followed by a number followed by a period usually signal a sentence boundary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "5. The sequence single-capital-letter, tapir alized-word is normally not recognized to be a sentence boundary. 6. Certain words followed by sequences of the form number, capitalized-word (especially in German texts) should not be marked as sentence boundaries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "7. Words which probably do not start a new sentence if preceded by a sequence number . This is especially useful for languages like German, which mark ordinal numerals by dots which do not indicate an end of sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input Text",
"sec_num": "3.1"
},
{
"text": "Morphological variations can be classified as inflection, derivation, and compounding [van Gaalen et al., 1991] .",
"cite_spans": [
{
"start": 86,
"end": 111,
"text": "[van Gaalen et al., 1991]",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Morphology",
"sec_num": "4"
},
{
"text": "An adequate morphology should be able to handle all three. There are several parts to the BCP morphology: the morphology grammar, the regular and irregular dictionaries, and the code. There is also a facility for testing and debugging the morphology grammar. The output format is an SGML-notation version of feature structures, where ambiguous analyses are expressed in tags raher than multiple word-forms in the text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Morphology",
"sec_num": "4"
},
{
"text": "The technique originally used for aligning texts was to link regions of texts according to regularity of word cooccurrences across texts [Catizone et al., 1989] . Pairs of words were linked if they have similar distributions in their home texts. This strategy doesn't always work well because in many languages a good writer does not use the exact same word many times in a text. Similarly, a good translator does not always translate a word exactly the same way every time it occurs. Clearly this algorithm is heavily text dependent. For texts with limited vocabularies this might work extremely well, but in \"free\" text it falls. Currently we are experimenting with assorted algorithms; a major problem is having good test texts to run them on. So far the best results on reasonable text come from the Gale-Church algorithm . It has been tested on English, German, French, Czech, and Italian parallel texts. The Gale-Church algorithm relies on the length of regions, where the character is the unit of measurement. (For details see their paper.) We have experienced three problems with this method. First, the implementation of the algorithm published in Church-Gale severely limits the size of the input file . This is, however, merely an implementation problem. Second, there is no way to set \"anchor points\" and align around them. That is, one cannot pick two anchor points, one in each text, and have the program align the corresponding regions above and below the anchor points. (See [Brown et al., 1991] for discussion of an alternative.) This is not necessarily a problem either, and can be worked around. Lastly, it does not give usable results on texts which are not absolutely parallel. That is to say, on texts which do not have exactly the same number of large regions, with the same hierarchical structure. A single extra line of characters in one text will cause a complete failure of the alignment algorithm. This is a major difficulty.",
"cite_spans": [
{
"start": 137,
"end": 160,
"text": "[Catizone et al., 1989]",
"ref_id": null
},
{
"start": 1491,
"end": 1511,
"text": "[Brown et al., 1991]",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Alignment",
"sec_num": "5"
},
{
"text": "We are very happy with our marking program and eagerly anticipating thorough testing of the new morphology, especially with regards to extensive experimentation with German texts. We are satisfied with the current alignment method. We may also end up writing a parser to disambiguate the tagged text and this would fit in well with previous ISSCO work on unification-based grammatical formalisms [Estival, 19901. Clearly there is room for expansion and improvement. The modular structure of BCP is a great strength, as it enables independent use of the modules. Similarly, the access module functions to its full capacity on the output of the other three, but can also be used on output of the alignment unit alone. This great flexibility clearly lends itself to ease of integration into other systems.",
"cite_spans": [
{
"start": 396,
"end": 412,
"text": "[Estival, 19901.",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Aligning sentences in Parallel Corpora",
"authors": [
{
"first": "[",
"middle": [],
"last": "References",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Brown",
"suffix": ""
}
],
"year": 1991,
"venue": "Proceedings of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "References [Brown et al., 1991] Brown, P., J. Lal, and R. Mercer. \"Aligning sentences in Parallel Corpora\", Proceed- ings of the Association for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Deriving Translation Data from Bilingual Texts",
"authors": [
{
"first": "",
"middle": [],
"last": "Warwick",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of the First International Lezical Acquisition Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Warwick. \"Deriving Translation Data from Bilingual Texts\", Proceedings of the First International Lezical Acquisition Workshop. Detroit, 1989.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "ELU User Manual",
"authors": [
{
"first": "",
"middle": [],
"last": "Estival",
"suffix": ""
}
],
"year": 1990,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Estival, 1990] \"ELU User Manual.\", Technical Report Fondazione Dalle Molle, Geneva, 1990.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Terminology Translation Checking for Company X', interhal ISSCO/STT proposal",
"authors": [
{
"first": "",
"middle": [],
"last": "Van Gaalen",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[van Gaalen et al., 1991] van Gaalen, M., A. Hugento- bier, L. des Tombe, S. Warwick-Armstrong. \"Termi- nology Translation Checking for Company X', inter- hal ISSCO/STT proposal, 1991. [Gale and Church, 1991] Gale, W., and Church, K. draft version of \"A Program for Aligning Sentences in Bilingual Corpora\", submitted to ACL 1991. See following entry.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A Program for Aligning Sentences in Bilingual Corpora",
"authors": [
{
"first": "W",
"middle": [],
"last": "Gale",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Church",
"suffix": ""
}
],
"year": 1991,
"venue": "Proceedings ACL 1991",
"volume": "",
"issue": "",
"pages": "177--184",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "[Gale and Church, 1991] Gale, W., and K. Church. \"A Program for Aligning Sentences in Bilingual Cor- pora\", Proceedings ACL 1991, Berkeley, 1991, 177- 184.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Deriving Translation Data from Bilingual Texts",
"authors": [
{
"first": "Russell",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1989,
"venue": "Proceedings of the First International Lexical Acquisition Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Russell. \"Deriving Translation Data from Bilingual Texts\", Proceedings of the First International Lexi- cal Acquisition Workshop, Detroit, 1989.",
"links": null
}
},
"ref_entries": {}
}
} |