-
Notifications
You must be signed in to change notification settings - Fork 0
/
TEPostprocess.pm
656 lines (600 loc) · 22 KB
/
TEPostprocess.pm
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
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
#!/usr/bin/perl
#===========File: TEpostprocess.pm==============
#Title: TEPostprocess.pm - Data Postprocessing Module for Tilde's CollTerm Wrapper System.
#Description: The Module contains data post-processing methods for term extraction.
#Author: Kârlis Gediòð, SIA Tilde.
#Created: May, 2011.
#Last Changes: 01.08.2011. by Mârcis Pinnis, SIA Tilde.
#===============================================
package TEPostprocess;
use strict;
use warnings;
#======File: TagTermsFromMultipleFiles==========
#Title: TagTermsFromMultipleFiles
#Description: Tags terms from a term list file array (argument 1) in a POS tagged file (argument 0) using a term ranking method combining all lists using weights (argument 2) and prints them in file (argument 3). The term list files should be in equal number to the weights.
#Author: Mârcis Pinnis, SIA Tilde.
#Created: Jan, 2012.
#Last Changes: 24.01.2012. by Mârcis Pinnis, SIA Tilde.
#===============================================
sub TagTermsFromMultipleFilesV2
{
#Checking if all required parameters are set.
if(defined($_[0])&&defined($_[1])&&defined($_[2])&&defined($_[3]))
{
open(TOKENS, "<:encoding(UTF-8)", $_[0]);
open(OUT, ">:encoding(UTF-8)", $_[3]);
}
else{die "Usage: TEPostprocess::TagTerms [Pos Taged File] [Term File Name Array] [Lambda Array] [Output File]\n";}
#@termFiles - a list of files that contain term lists. Every single file must contain terms of the same length (token N-grams of a fixed size - N). The files must be in descending order according to term length.
my @termFiles = @{$_[1]};
my @lambdas = @{$_[2]};
#%emptyLineHash - hash table that stores preceding empty lines of tokens in the POS-tagged document (required to print ampty lines in the output file).
my %emptyLineHash;
my %tokenHash;
my $currentToken = 0;
#@tokens - an array of tokens of the POS-tagged file.
my @tokens;
#Saves tokens from the POS-tagged file in an array and empty lines in the empty line hash table.
while (my $tokenLine = <TOKENS>)
{
$tokenLine =~ s/\n//;
$tokenLine =~ s/\r//;
$tokenLine =~ s/^\x{FEFF}//; #Removes BOM.
if ($tokenLine =~ /^([^\t]+)\t([^\t]*)\t([^\t]*)\t([^\t]*)\t([^\t]*)\t([^\t]+)\t([^\t]+)\t([^\t]+).*$/)
{
my @token = ($1,$2,$3,$4,$5,$6,$7,$8,"O",0); # $1 - token, $2 - POS tag, $3 - lemma, $4 - Morphological tag, $5 - starting line, $6 - starting position, $7 - end line, $8 - end position, "O" - empty term tag, 0 - empty term tag probibility.
push @tokens, [@token];
if (!defined($tokenHash{$3}))
{
$tokenHash{$3} = ();
}
my $lcLemma = lc ($3);
push @{$tokenHash{$lcLemma}}, $currentToken;
$currentToken ++;
}
else
{
#Counts the amount of empty lines before the next non-empty line and fills the hash table with the amounts assigned to the non-empty line.
if (defined $emptyLineHash{$currentToken})
{
$emptyLineHash{$currentToken}++ ;
}
else
{
$emptyLineHash{$currentToken} = 1;
}
}
}
my %termHash;
#Reads each term file and creates an ordered list of terms.
my $idx = -1;
for my $TermFileIndex (0 .. $#termFiles)
{
$idx++;
open(TERMS, "<:encoding(UTF-8)",$termFiles[$TermFileIndex]) or die "cant open $termFiles[$TermFileIndex]\n";
#Saves terms and their probabilities in a hash.
while (my $term = <TERMS>)
{
$term =~ s/\n//;
$term =~ s/\r//;
$term =~ s/^\x{FEFF}//; #Removes BOM.
if($term =~ /^([^\t]+)\t([^\t]+)$/)
{
#Splits term in to tokens.
#my @splitTerm = split(" ",$1);
my $realTerm = $1;
#Gets term probobility.
#print "L $idx: ".$lambdas[$idx]."\n";
#print $2."\n";
my $prob = $2*$lambdas[$idx];
#print $prob."\n";
$termHash{$realTerm} = $prob;
}
}
}
my $tokenCount = @tokens;
my @sortedTerms = reverse sort { $termHash{$a} cmp $termHash{$b} } keys %termHash;
for my $i (0 .. $#sortedTerms)
{
#print $sortedTerms[$i]."\n";
#print $termHash{$sortedTerms[$i]}."\n";
#print $sortedTerms[$i]."\n";
my @splitTerm = split(" ",$sortedTerms[$i]);
my $candidateTerm = lc($splitTerm[0]);
if (defined ($tokenHash{$candidateTerm}))
{
my @rootIdxArray = @{$tokenHash{$candidateTerm}};
for my $r (0 .. $#rootIdxArray)
{
my $startIdx = $rootIdxArray[$r];
my $goodToMark = 1;
my $row = -1;
SPTERM: for my $t (0 .. $#splitTerm)
{
my $lcTermLemma = lc($splitTerm[$t]);
my $currIdx = $startIdx+$t;
if ($currIdx>=$tokenCount)
{
$goodToMark=0;
last SPTERM;
}
else
{
if ($row == -1)
{
$row = $tokens[$currIdx][4];
}
elsif ($tokens[$currIdx][4] != $row)
{
$goodToMark=0;
last SPTERM;
}
my $lcTokenLemma = lc($tokens[$currIdx][2]);
if($tokens[$currIdx][8] ne "O")
{
$goodToMark=0;
last SPTERM;
}
elsif($lcTokenLemma ne $lcTermLemma)
{
$goodToMark=0;
last SPTERM;
}
}
}
if ($goodToMark == 1)
{
for my $t (0 .. $#splitTerm)
{
my $currIdx = $startIdx+$t;
if ($startIdx==$currIdx)
{
$tokens[$currIdx][8] = "B-TERM";
$tokens[$currIdx][9] = $termHash{$sortedTerms[$i]};
}
else
{
$tokens[$currIdx][8] = "I-TERM";
$tokens[$currIdx][9] = $termHash{$sortedTerms[$i]};
}
}
}
}
}
}
#Save the POS-tagged tokens with newly added term tags in the output file.
for my $z (0 .. $#tokens)
{
if (defined $emptyLineHash{$z})
{
for (1 .. $emptyLineHash{$z}) {print OUT "\n"; }
}
print OUT join ( "\t", @{$tokens[$z]} )."\n";
}
close OUT;
close TOKENS;
}
#======File: TagTermsFromMultipleFiles==========
#Title: TagTermsFromMultipleFiles
#Description: Tags terms from a term list file array (argument 1) in a POS tagged file (argument 0) and prints them in file (argument 2). The term list files should be sorted in a descending order regarding the term length withing the term list files.
#Author: Kârlis Gediòð, SIA Tilde.
#Created: May, 2011.
#Last Changes: 01.08.2011. by Mârcis Pinnis, SIA Tilde.
#===============================================
sub TagTermsFromMultipleFiles
{
#Checking if all required parameters are set.
if(defined($_[0])&&defined($_[1])&&defined($_[2]))
{
open(TOKENS, "<:encoding(UTF-8)", $_[0]);
open(OUT, ">:encoding(UTF-8)", $_[2]);
}
else{die "Usage: TEPostprocess::TagTerms [Pos Taged File] [Term File Name Array] [Output File]\n";}
#@termFiles - a list of files that contain term lists. Every single file must contain terms of the same length (token N-grams of a fixed size - N). The files must be in descending order according to term length.
my @termFiles = @{$_[1]};
#%emptyLineHash - hash table that stores preceding empty lines of tokens in the POS-tagged document (required to print ampty lines in the output file).
my %emptyLineHash;
my $currentToken = 0;
#@tokens - an array of tokens of the POS-tagged file.
my @tokens;
#Saves tokens from the POS-tagged file in an array and empty lines in the empty line hash table.
while (my $tokenLine = <TOKENS>)
{
$tokenLine =~ s/\n//;
$tokenLine =~ s/\r//;
$tokenLine =~ s/^\x{FEFF}//; #Removes BOM.
if ($tokenLine =~ /^([^\t]+)\t([^\t]*)\t([^\t]*)\t([^\t]*)\t([^\t]*)\t([^\t]+)\t([^\t]+)\t([^\t]+).*$/)
{
my @token = ($1,$2,$3,$4,$5,$6,$7,$8,"O",0); # $1 - token, $2 - POS tag, $3 - lemma, $4 - Morphological tag, $5 - starting line, $6 - starting position, $7 - end line, $8 - end position, "O" - empty term tag, 0 - empty term tag probibility.
push @tokens, [@token];
$currentToken ++;
}
else
{
#Counts the amount of empty lines before the next non-empty line and fills the hash table with the amounts assigned to the non-empty line.
if (defined $emptyLineHash{$currentToken})
{
$emptyLineHash{$currentToken}++ ;
}
else
{
$emptyLineHash{$currentToken} = 1;
}
}
}
#Reads each term file and tags terms in tokens that have not already been tagged.
for my $TermFileIndex (0 .. $#termFiles)
{
open(TERMS, "<:encoding(UTF-8)",$termFiles[$TermFileIndex]) or die "cant open $termFiles[$TermFileIndex]\n";
#%termHash - a hash that holds terms as tokens in hash. The primary key of the hash is a list of tokens in terms. The primary key is linked to secondary key which is the term number identifying the term(s) the token is in. The secondary key is linked to an array which holds the position(s) the token is in the term.
#Structure: %termHash{Term Token}{Term Number}[Array Of Token Position(s) In Term]
my %termHash;
#An array that holds term probabilities.
my @termProb;
#%operationalHash holds term numbers linked to starting positions of possible terms, relevant to current examined token.
#Structure: %oprationalHash{Term Number}[Array Of Possible Starting Positions Of Term]
my %oprationalHash;
#termSize - token count in term.
my $termSize;
#A number that identifies each term.
my $termNumber = 0;
#Saves terms in a hash and their probabilities in an array.
while (my $term = <TERMS>)
{
$term =~ s/\n//;
$term =~ s/\r//;
$term =~ s/^\x{FEFF}//; #Removes BOM.
if($term =~ /^([^\t]+)\t([^\t]+)$/)
{
#Splits term in to tokens.
my @splitTerm = split(" ",$1);
#Saves term probobility.
push (@termProb,$2);
#Saves the count of tokens in term. (Actually the diference between the end and starting positions, which is by one less than the token count ($#splitTerm))
if ($termNumber == 0){$termSize = $#splitTerm;}
#Creates a hash value for each token in terms.
for my $i (0 .. $#splitTerm)
{
if(defined $termHash{$splitTerm[$i]})
{
if(defined $termHash{$splitTerm[$i]}{$termNumber})
{
push (@{$termHash{$splitTerm[$i]}{$termNumber}}, $i);
}
else
{
my @tempArr = ($i);
$termHash{$splitTerm[$i]}{$termNumber} = \@tempArr;
}
}
else
{
my @tempArr = ($i);
$termHash{$splitTerm[$i]}{$termNumber} = \@tempArr;
}
}
}
$termNumber++;
}
#Iterates through POS tagged tokens looking for tokens that match the Term tokens and tags them if the whole term matches.
for my $i (0 .. $#tokens)
{
#If the token has alredy been taged ignores it and clears %oprationalHash.
if ($tokens[$i][8] eq "O")
{
#If the token isn't a part of any of the terms ignores it and clears %oprationalHash.
if(defined ($termHash{$tokens[$i][2]}))
{
#%temphash - a temporary hash that stores operational hash values and replaces operational hash after adding current token term position values. This is done to separate newly added term tokens from the ones added from the last POS-tagged token.
my %temphash;
#Iterates through all terms the token is in.
TERMTOK: for my $termNumber (keys %{$termHash{$tokens[$i][2]}})
{
#Iterates through all positions in the term, in which the token is in.
for my $tokenPosInTerm (0 .. $#{$termHash{$tokens[$i][2]}{$termNumber}} )
{
#If the term has been added in operational hash and matched so far, check if it matches now and tag it if the full term has matched.
if(defined($oprationalHash{$termNumber}))
{
#Iterate through start positions of a term. This is done to handle the cases when a term has two (or more) identical tokens.
for my $termsStartPosIndex(0 .. $#{$oprationalHash{$termNumber}})
{
#If the token position in term is equal to the amount of tokens that have matched so far, update the term in the operational hash.
if ( ${$termHash{$tokens[$i][2]}{$termNumber}}[$tokenPosInTerm] = $i-$oprationalHash{$termNumber}[$termsStartPosIndex])
{
#If one of the terms is fully matched, add the tag to tokens and go to the next token.
if ($i- $oprationalHash{$termNumber}[$termsStartPosIndex] == $termSize)
{
#Add "B-TERM" tag to the first token of the term and "I-TERM" tag to the proceding tokens. Add the term probability from @termProb array.
for my $j (0 .. $termSize)
{
if ($j==0)
{
$tokens[${$oprationalHash{$termNumber}}[$termsStartPosIndex]][8] = "B-TERM";
$tokens[$oprationalHash{$termNumber}[$termsStartPosIndex]][9] = $termProb[$termNumber];
}
else
{
$tokens[${$oprationalHash{$termNumber}}[$termsStartPosIndex] + $j][8]= "I-TERM";
$tokens[${$oprationalHash{$termNumber}}[$termsStartPosIndex] + $j][9]= $termProb[ $termNumber];
}
}
undef %temphash; # FAST BUGFIX - please check if correct!
undef %oprationalHash;
last TERMTOK;
}
#If the Term is not fully matched, save it in the oprationalHash.
elsif ( defined($temphash{$termNumber}))
{
push (@{$temphash{$termNumber}}, ${$oprationalHash{$termNumber}}[$termsStartPosIndex]);
}
else
{
my @tempArr = (${$oprationalHash{$termNumber}}[$termsStartPosIndex]);
$temphash{$termNumber} = \@tempArr;
}
}
}
}
#If the matched token is in the beginning of a term, add it to oprationalHash.
if (${$termHash{$tokens[$i][2]}{$termNumber}}[$tokenPosInTerm] == 0)
{
if ( defined($temphash{$termNumber}))
{
push (@{$temphash{$termNumber}},$i);
}
else
{
my @tempArr = ($i);
$temphash{$termNumber} = \@tempArr;
}
#If the matched token is in the beginning and the term consists of a single token, tag the token and go to the next token.
if($termSize == 0)
{
$tokens[$i][8]= "B-TERM";
$tokens[$i][9] = $termProb[$termNumber];
undef %oprationalHash;
undef %temphash; # FAST BUGFIX - please check if correct!
last TERMTOK;
}
}
}
}
undef %oprationalHash;
%oprationalHash = %temphash;
}
else
{
undef %oprationalHash;
}
}
else
{
undef %oprationalHash;
}
}
close TERMS;
}
#Save the POS-tagged tokens with newly added term tags in the output file.
for my $z (0 .. $#tokens)
{
if (defined $emptyLineHash{$z})
{
for (1 .. $emptyLineHash{$z}) {print OUT "\n"; }
}
print OUT join ( "\t", @{$tokens[$z]} )."\n";
}
close OUT;
close TOKENS;
}
#===============File: TagTerms==================
#Title: TagTerms
#Description: Tags terms (argument 1) in a list of POS-tagged tokens (argument 0) and prints them in a file (argument 2). The method is NOT IN USE by the system.
#Author: Kârlis Gediòð, SIA Tilde.
#Created: May, 2011.
#Last Changes: 04.07.2011. by Mârcis Pinnis, SIA Tilde.
#===============================================
sub TagTerms
{
#Checking if all required parameters are set.
if(defined($_[0])&&defined($_[1])&&defined($_[2]))
{
open(TOKENS, "<:encoding(UTF-8)", $_[0]);
open(TERMS, "<:encoding(UTF-8)", $_[1]);
open(OUT, ">:encoding(UTF-8)", $_[2]);
}
else{die "Usage: TEPostprocess::TagTerms [Pos Taged File] [Term File] [Output File]\n";}
my %emptyLineHash;
my $currentToken = 0;
my %terms;
my @tokens;
#Saves terms in a hash %terms;
#Stucture: %terms{Full Term}[[An Array Of Each Token In Term][Term Probability]]
while (my $term = <TERMS>)
{
$term =~ s/\n//;
$term =~ s/\r//;
$term =~ s/^\x{FEFF}//; #Removes BOM.
if($term =~ /^([^\t]+)\t([^\t]+)$/)
{
my @splitTerm =split(" ",$1);
@{$terms{$1}} = (\@splitTerm,$2);
}
}
#Saves the tokens in an array and the empty lines of the file in hash.
while (my $tokenLine = <TOKENS>)
{
$tokenLine =~ s/\n//;
$tokenLine =~ s/\r//;
$tokenLine =~ s/^\x{FEFF}//; #Removes BOM.
if ($tokenLine =~ /^([^\t]+)\t([^\t]*)\t([^\t]*)\t([^\t]*)\t([^\t]*)\t([^\t]+)\t([^\t]+)\t([^\t]+).*$/)
{
my @token = ($1,$2,$3,$4,$5,$6,$7,$8,"O",0); # $1 - token, $2 - POS tag, $3 - lemma, $4 - Morphological tag, $5 - starting line, $6 - starting position, $7 - end line, $8 - end position, "O" - empty term tag, 0 - empty term tag probibility
push @tokens, [@token];
$currentToken ++;
}
else
{
#Saves empty lines in a hash and counts the amount of successing the empty lines.
if (defined $emptyLineHash{$currentToken})
{
$emptyLineHash{$currentToken}++ ;
}
else
{
$emptyLineHash{$currentToken} = 1;
}
}
}
# Tags terms one by one. Tags the longest terms first.
for my $key (sort {length($b)<=>length($a)} (keys %terms))
{
#Iterates through untagged tokens and compares the POS tagged token with the first token in term and it matches tries to match the entire term.
for my $i (0 .. $#tokens)
{
if ($tokens[$i][8] eq "O")
{
if ($tokens[$i][0] eq ${$terms{$key}}[0][0])
{
my $matches = 1;
for my $termTokens (1 .. $#{$terms{$key}[0]})
{
if ($#tokens < $i+$termTokens) {$matches = 0; last;}
if ($tokens[$i+$termTokens][8] ne "O") {$matches = 0; last;}
if ($tokens[$i+$termTokens][0] ne ${$terms{$key}}[0][$termTokens])
{
$matches = 0;
last;
}
}
if ($matches)
{
$tokens[$i][8] = "B-TERM";
$tokens[$i][9] = $terms{$key}[1];
for my $termTokens (1 .. $#{$terms{$key}[0]})
{
$tokens[$i+$termTokens][8] = "I-TERM";
$tokens[$i+$termTokens][9] = $terms{$key}[1];
}
}
}
}
}
}
#Save the POS tagged tokens with newly added term tags in the output file.
for my $i (0 .. $#tokens)
{
if (defined $emptyLineHash{$i})
{
for (1 .. $emptyLineHash{$i}) {print OUT "\n"; }
}
print OUT join ( "\t", @{$tokens[$i]} )."\n";
}
close OUT;
close TOKENS;
close TERMS;
}
#=====File: TaggedTokensToTaggedPlaintext=======
#Title: TaggedTokensToTaggedPlaintext
#Description: Applies term markup to a plaintext document (argument 1) from a POS-tagged document (argument 0). The results are saved in a term-tagged plaintext document (argument 2).
#Author: Kârlis Gediòð, SIA Tilde.
#Created: July, 2011.
#Last Changes: 01.08.2011. by Mârcis Pinnis, SIA Tilde.
#===============================================
sub TaggedTokensToTaggedPlaintext
{
#Checking if all required parameters are set.
if(defined($_[0])&&defined($_[1])&&defined($_[2]))
{
open(TOKENS, "<:encoding(UTF-8)", $_[0]);
open(PLAIN, "<:encoding(UTF-8)", $_[1]);
open(OUT, ">:encoding(UTF-8)", $_[2]);
}
else{die "Usage: TEPostprocess::TagTerms [Taged Token File] [Output File]\n";}
#@termPos - an array of term tag positions.
#Structure: @termPos[Term Number][Positions]
# Positions: [0] - start line, [1] - start position in the line, [2] - end line, [3] - end position in the line.
my @termPos;
my @singleTermPos;
my $inNETag = 0;
#Gets term positions from the POS-tagged file.
while (my $tokenLine = <TOKENS>)
{
$tokenLine=~s/\n//;
$tokenLine=~s/\r//;
$tokenLine =~ s/^\x{FEFF}//; #Removes BOM.
if ($tokenLine =~ /^[^\t]+\t[^\t]*\t[^\t]*\t[^\t]*\t([^\t]*)\t([^\t]+)\t([^\t]+)\t([^\t]+)\t([^\t]+)/g)
{
# $1 - starting line, $2 - starting position, $3 - end line, $4 - end position, 5 - term tag,
my $termTag = $5;
my @tokenPositions = ($1,$2,$3,$4);
#If there has been a term tag that has not been closed so far.
if ($inNETag)
{
#If the term has ended, save it in the @termPos array.
if ($termTag !~ /^I/)
{
if($singleTermPos[0]==$singleTermPos[2] ) { push @termPos,[@singleTermPos]; }
$inNETag = 0;
undef @singleTermPos;
}
#If the token is the first token in term, save its positions and set the indicator to the status "Within a term".
if ($termTag =~ /^B/)
{
@singleTermPos = ($tokenPositions[0],$tokenPositions[1],$tokenPositions[2],$tokenPositions[3]);
$inNETag = 1;
}
#If the current token is a part of a previously opened term, save its end positions in @singleTermPos.
elsif ($termTag =~ /^I/)
{
$singleTermPos[2] = $tokenPositions[2];
$singleTermPos[3] = $tokenPositions[3];
}
next;
}
#If the token is the first token in a term, save its positions and specify that there has been a beginning of a term.
if ($termTag =~ /^B/)
{
@singleTermPos = ($tokenPositions[0],$tokenPositions[1],$tokenPositions[2],$tokenPositions[3]);
$inNETag = 1;
}
}
}
#Saves the last term, if the beginning was found but the term was not saved.
if ($inNETag)
{
push @termPos,[@singleTermPos];
$inNETag = 0;
undef @singleTermPos;
}
#Count plaintext line numbers, to match term positions used in POS tagged token files.
my $linenum = 0;
#Add starting and ending term tags to a plaintext line using starting and ending positions in @termPos array.
while (my $plainLine = <PLAIN>)
{
#Saves the length of added tags to get term positions after adding a tag.
my $addedTagLenght =0;
#Looks for line matches in the @termPos array and adds the tag if a match is found.
for my $i (0 .. $#termPos)
{
$plainLine =~ s/^\x{FEFF}//; #Removes BOM.
if ($termPos[$i][0]==$linenum)
{
$plainLine = substr($plainLine,0,$termPos[$i][1]+$addedTagLenght).'<TENAME>'. substr($plainLine,$termPos[$i][1]+$addedTagLenght);
$addedTagLenght = $addedTagLenght + 8;
}
if ($termPos[$i][2]==$linenum)
{
$plainLine = substr($plainLine,0,$termPos[$i][3]+$addedTagLenght+1).'</TENAME>'. substr($plainLine,$termPos[$i][3]+$addedTagLenght+1);
$addedTagLenght = $addedTagLenght + 9;
}
}
#Prints the tagged line to the output file.
print OUT $plainLine;
$linenum++;
}
close OUT;
close TOKENS;
close PLAIN;
}
1;