Sciweavers

38 search results - page 7 / 8
» Querying Parse Trees of Stochastic Context-Free Grammars
Sort
View
EMNLP
2004
13 years 7 months ago
Induction of Greedy Controllers for Deterministic Treebank Parsers
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...
Tom Kalt
TSD
2007
Springer
13 years 12 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
ACL
2009
13 years 3 months ago
Semantic Tagging of Web Search Queries
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
Mehdi Manshadi, Xiao Li
RANLP
2003
13 years 7 months ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
ICIP
2003
IEEE
14 years 7 months ago
Stochastic attributed K-d tree modeling of technical paper title pages
Structural information about a document is essential for structured query processing, indexing, and retrieval. A document page can be partitioned into a hierarchy of homogeneous r...
Song Mao, Azriel Rosenfeld, Tapas Kanungo