Showing posts with label read paper. Show all posts
Showing posts with label read paper. Show all posts

2009/10/23

read semEval-2010 Task 10

2009/05/25

Information Extraction: Algorithms and Prospects in a

Information Extraction: Algorithms and Prospects in a
Retrieval Context:


2009/05/23

reading exploring Multilingual Semantic Role Labeling

2009/04/13

13 Hidden Markov models

Introduction to machine learning.


urns example

2009/04/07

reading group

EACL2009 paper "Semi-Supervised Semantic Role
Labeling" on Monday the 6th of April (from 4:00 to 5:00)

2009/03/31

clustering by tree distance for parse tree normalisation

2009/03/29

Tree Kernels for semantic role labeling
reading paper

Tree Kernels for semantic role labeling

Tree Kernels for semantic role labeling (32 pages)

0.   Abstract

This paper is based on kernel functions to model parse tree properties in kernel based machines.

1.   Introduction

Recently attention: automatic labeling of semantic roles. It requires:

1. Detection of the target predicate

2. Detection and classification of constituting arguments.

Previous work:

-          Machine learning

-          Linking theories semantic and syntax

Tree kernel for:

-          Parsing re-ranking

-          Relation extraction

-          Name entity recognition.

Recent work with high labeling accuracy,

Joint inference on predicate-argument structure. For this -> extract features from sentence syntactic parse tree.

1-      Feature extraction.

2-      Combination with traditional attribute value models.

3-      Feature engineering using kernel combinations and marking strategies.

4-      Tree kernels….

5-      Identify the most important structured features: highest-weighted features -> better classifiers.

“Tree kernels should always be applied”.

Limitations:

a)      Poor impact on boundary detection.

b)      Limited contribution to overall accuracy.

Tree kernels for srl: types:

-          Canonical mappings

-          Feature extraction functions

Carefully engineered tree kernels always increase accuracy.

 

2.   Automatic shallow semantic parsing

3.   Tree kernels

4.   State of the art architecture for SRL

5.   Structured feature engineering

6.   Experiments

7.   Discursion and conclusions

2009/03/28

Semantic Role Labeling: An Introduction to the Special Issue

®  Sentence + designated verb: SRL identify the arguments of the verb. And label them with semantic roles.

®  Steps:

¯  1 Pruning.

¯  2 Local scoring

¯  3 Joint scoring

(4) Fixing common errors

 

Pruning

®  Filtering the set of arguments for a given predicate.

¯  Any subsequence of words in the sentence is an argument candidate.

®  Xue and Palmer (2004)

Joint scoring      

®  Good structure of labeled arguments.

®  Arguments do not overlap,

®  Core arguments do not repeat, etc.

®  Re-ranking

®  Probabilistic methods.

Conditional random fields

SRL architecture:

®  Combination of systems and input annotations.

¯  Increase robustness,

¯  Gain coverage

¯  Reduce effects of parse errors

®  One my combine:

¯  Output of independents srl basic systems

¯  Outputs from same srl s. changing input annotations or parameters.

Gaing of 2-3 F1 points.  

®  Joint labeling…

®  Dependency parsing

®  Combine parsing and srl in a single step. …

®  Characterize candidate argument
phrase type, headword, …

®  Characterize verb predicate +cntx
lemma, voice,

®  Characterize the relation.
Syntactic + semantic.
Left/right position of the constituent  with respect to the verb…

®  Recall:

®  81% argument identification

®  95% assigned correct semantic role.

®  SemEval-2007

®  Disambiguation of 50 verbs.

®  FrameNet

®  40 frames

®  F1=92% asigning semantic roles

®  F1 83% segmenting and labeling arg.

®  Complete analysis of semantic roles on unseen texts,

®  Precision 60s

®  Recall 30s

®  SRL relies on syntactic structure.

®  Output by statistical parser 90% matching.

®  Is common to use parser trees.

®  Gold-standard trees.???

®  Most of the errors are by having incorrect syntactic constituents.

®  SRL relies on syntactic structure.

®  Output by statistical parser 90% matching.

®  Is common to use parser trees.

®  Gold-standard trees.???

®  Most of the errors are by having incorrect syntactic constituents.

®  CoNLL-2005 Brown corpus annotated

®  Performance drop below 70%

®  They clamed errors are in assigning the semantic roles rather than identification of argument boundaries.

®  Spanish and catalan, CESS-ECE corpus.

®  86% disambiguation predicates

®  83% labeling arguments.

®  chinese

®  semEval-2007 25K SENTENCE

®  80% core elements.

Top performing team use machine learning techniques

2009/03/25

borderline-smote
slides ready for the reading group

2009/03/11

sematic role labeling

2h meeting

sematic role labeling:
how to predict the semantic role relation:

predict the name of the relation.
predict the relation it-selve

1.- tree distance knn
matching with the k neigbours the best fit.

2.- three kernels:
analizing how looks each posible subtree as a target



2009/03/10

reading acm new

2009/03/02

reading foundations of statistical natural language processing

2009/02/27

How does noise affect generalization

How does noise affect generalization

statistical noise
physical noise: variation in the target
injecting artificial noise : jitter


noise in the target" danger of overfitting
nois in the inputs limits the accuracy of generalization.
Genetic Kernel Support Vector Machine: description and evaluation
gp genetic programming

2009/02/22

A study of distance-based machine learning algorithms

(phd thesis)

A study of distance-based machine learning algorithms 

looks a lecture review

Distance Metric Learning for Large Margin Nearest Neighbor Classification

Distance Metric Learning for Large Margin    Nearest Neighbor Classification

key words:
Nahanalobis distance:  not dependent on the scale of measurement. 
knn classification can be significantly improved by using a distance metric learned from labeled examples.

many researches -> knn classification can be significantly improved by using a distance metric learned from labeled examples. 
approach similar to svm
large margin nearest neighbor LMNN classification

linear transformation that optimizes knn

cost funtion
penalizes large distances between each input and its target neighbors and penalizes small distances between each input and all other inputs that do not share the same label. 

matlab implementation online. 

related work

semidefinite programming

neighborhood component analisis. 
relevant component analisis.

PCA

kernelizing the algorithm will  improve it

Distance Metric Learning, with Application to Clustering with Side-Information




not readit jet
book:
fundations of estatistical natural language processing
read up to page 55