Variants of tree similarity in a question answering task

Authors:
Martin Emms
Affiliations:
Trinity College, Ireland
Venue:
LD '06 Proceedings of the Workshop on Linguistic Distances
Year:
2006

Citing 3
Cited 1

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Computer Evaluation of Indexing and Text Processing

Journal of the ACM (JACM)
Head-driven statistical models for natural language parsing

Head-driven statistical models for natural language parsing

Edit tree distance alignments for semantic role labelling

ACLstudent '10 Proceedings of the ACL 2010 Student Research Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

The results of experiments on the application of a variety of distance measures to a question-answering task are reported. Variants of tree-distance are considered, including whole-vs-sub tree, node weighting, wild cards and lexical emphasis. We derive string-distance as a special case of tree-distance and show that a particular parameterisation of tree-distance outperforms the string-distance measure.