643 search results - page 21 / 129 » Parsing And Derivational Equivalence |
106
click to vote
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
79
Voted
ACL
2009
14 years 7 months ago
2009
This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a techniqu...
COLING
1996
14 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
UIST
2004
ACM
15 years 3 months ago
2004
ACM
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
87
Voted
EMNLP
2007
14 years 11 months ago
2007
We use a generative history-based model to predict the most likely derivation of a dependency parse. Our probabilistic model is based on Incremental Sigmoid Belief Networks, a rec...