Sciweavers

621 search results - page 94 / 125
» Parsing As Tree Traversal
Sort
View
ICFP
2003
ACM
14 years 10 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
CACM
1998
110views more  CACM 1998»
13 years 9 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
LREC
2008
142views Education» more  LREC 2008»
13 years 11 months ago
Enriching Frame Semantic Resources with Dependency Graphs
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
Hagen Fürstenau
CORR
1999
Springer
118views Education» more  CORR 1999»
13 years 9 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
INTERSPEECH
2010
13 years 4 months ago
Memory-based active learning for French broadcast news
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...
Frédéric Tantini, Christophe Cerisar...