mbttests/mbtenriched.ok at master · LanguageMachines/mbttests · GitHub

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
rm: cannot remove './tests/*.%': No such file or directory
rm: cannot remove './tests/*.tree': No such file or directory
Constructing a tagger from: tests/enriched.data
  Creating lexicon: ./temp/enriched.data.lex of 12 entries.
  Creating ambitag lexicon: ./temp/enriched.data.lex.ambi.05
  Creating list of most frequent words: ./temp/enriched.data.top100
  Create unknown words case base, Timbl options: ' -a IB1  -FColumns +vS -FColumns '
  Create known words case base,   Timbl options: ' -a IGTREE +D  -FColumns +vS -FColumns '
    Algorithm = IB1
    Algorithm = IGTREE
    Processing data from the file tests/enriched.data...
    Creating case base: ./temp/enriched.data.known.ddfa

    Creating case base: ./temp/enriched.data.unknown.dFapsss
    Deleted intermediate file: ./temp/enriched.data.known.inst.ddfa
    Deleted intermediate file: ./temp/enriched.data.unknown.inst.dFapsss
      ready: 12 words processed.

  Created settings file './temp/enr.settings'

Ready:
  Time used: 1
  Words/sec: 24
ENRICHED
DATA_VERSION 2
e <utt>
l enriched.data.lex.ambi.05
k enriched.data.known.ddfa
u enriched.data.unknown.dFapsss
p ddfa
P dFapsss
O +vS -FColumns K: -a IGTREE +D U: -a IB1
L enriched.data.top100
mbt 3.7 (c) CLST, ILK and CLiPS 1998 - 2021.
Memory Based Tagger
CLST  - Centre for Language and Speech Technology,Radboud University
ILK   - Induction of Linguistic Knowledge Research Group,Tilburg University
CLiPS - Computational Linguistics Group, University of Antwerp
Based on timbl 6.9

  Reading the lexicon from: ./temp/enriched.data.lex.ambi.05 (12 words).
  Read frequent words list from: ./temp/enriched.data.top100 (12 words).
  Reading case-base for known words from: ./temp/enriched.data.known.ddfa...
  case-base for known words read.
  Reading case-base for unknown words from: ./temp/enriched.data.unknown.dFapsss...
  case-base for unknown word read
  Sentence delimiter set to '<utt>'
  Beam size = 1
  Known Tree, Algorithm = IGTREE
  Unknown Tree, Algorithm = IB1

Processing data from the file tests/enriched.test:
Engeland	/	---	N	N
hoopt	/	---	V	V
nog	/	---	Adv	Adv
voor	/	---	Prep	Prep
1973	/	---	Num	Num
lid	/	---	N	N
te	/	---	Prep	Prep
worden	//	---	V	V
van	/	---	Prep	Prep
de	/	---	Art	Art
Euromarkt	/	---	N	N
.	/	---	Punc	Punc


Done: 12 words processed.

Classification Statistics:

  Known Words:

overall accuracy:        1  (11/11)
There were 3 ties of which 3 (1e+02%) were correctly resolved

  UnKnown Words:

overall accuracy:        1  (1/1)

  Total        : 12	correct from 12 (100 %)
  Time used: 1
  Words/sec: 12