57 search results - page 7 / 12 » Parsing Tree Adjoining Grammars using Evolutionary Algorithm... |
120
Voted
DLT
2003
15 years 1 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
106
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
TAPD
1998
15 years 1 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
140
click to vote
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
114
click to vote
ISMB
1993
15 years 1 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...