Sciweavers

1229 search results - page 29 / 246
» A New Method for Dependent Parsing
Sort
View
EMNLP
2008
13 years 9 months ago
Learning Graph Walk Based Similarity Measures for Parsed Text
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
Einat Minkov, William W. Cohen
TSD
2007
Springer
14 years 1 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
NAACL
2007
13 years 9 months ago
Semi-Supervised Learning for Semantic Parsing using Support Vector Machines
We present a method for utilizing unannotated sentences to improve a semantic parser which maps natural language (NL) sentences into their formal meaning representations (MRs). Gi...
Rohit J. Kate, Raymond J. Mooney
COMCOM
2011
13 years 2 months ago
Evaluation of a new method for measuring the internet degree distribution: Simulation results
Many contributions rely on the degree distribution of the Internet topology. However, current knowledge of this property is based on biased and erroneous measurements and is subje...
Christophe Crespelle, Fabien Tarissan