Onto.PT: Towards the Automatic Construction of a Lexical Ontology ...

122 Chapter 7. Moving from term-based to synset-based relations
tb-triple = (documento hypernym-of recibo)
(document hypernym-of receipt)
A1: documento, declaração B1: recibo, comprovante, nota, quitação,
senha
A2: escritura, documento
plausible sb-triples = {A1, B1}
tb-triple = (planta part-of floresta)
(plant part-of forest)
A1: relação, quadro, planta, mapa B1: bosque, floresta, mata, brenha, selva
A2: vegetal, planta
A3: traçado, desenho, projeto, planta, plano
plausible sb-triples = {A2, B1}
tb-triple = (passageiro purpose-of carruagem)
(passenger purpose-of carriage)
A1: passageiro, viajante B1: carriagem, carruagem, carraria
A2: passageiro, viador B2: carruagem, carro, sege, coche
A3: passageiro, transeunte B3: carruagem, caleça, caleche
B4: actividade, carruagem, operosidade,
diligência
plausible sb-triples = {A1, B1}, {A1, B2}, {A1, B3}, {A2, B1}, {A2, B2}, {A2, B3}
tb-triple = (máquina hypernym-of câmara)
(machine hypernym-of camera)
A1: motor, máquina B1: câmara, parlamento, assembleia, assembléia
B2: quarto, repartimento, apartamento,
câmara, compartimento, aposento, recâmara,
alcova
plausible sb-triples = {}
Figure 7.5: Example of gold entries.
of using only the 452 tb-triples as a lexical network, we used all the tb-triples
in CARTÃO (see section 4). After comparing the automatic attachments with
the attachments in the gold reference, we computed typical information retrieval
measures, including precision, recall and three variations of the F -score: F1 is the
classic, F0.5 favors precision, and RF1 uses a relaxed recall (RelRecall), instead of
the classic recall – RelRecall is 1 if at least one correct attachment is selected. For
a tb-triple in the set of tb-triples to ontologise, ti ∈ T , these measures are computed
as follows:
P recisioni = |AutomaticAttachmentsi ∩ GoldAttachmentsi|
|AutomaticAttachmentsi|
Recalli = |AutomaticAttachmentsi ∩ GoldAttachmentsi|
|GoldAttachmentsi|
P recision = 1
|T |
Recall = 1
|T |
1, if |AutomaticAttachmentsi ∩ GoldAttachmentsi| > 0
RelRecalli =
0, otherwise
RelRecall = 1
|T |
|T |
RelRecalli
i=1
|T |
|T |
P recisioni
i=1
Recalli
i=1
Fβ = (1 + β 2
P recision × Recall
) ×
(β2
× P recision) + Recall