212 search results - page 20 / 43 » Second-Order Simple Grammars |
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...
123
click to vote
ICDT
2010
ACM
15 years 1 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...
CVPR
2010
IEEE
15 years 5 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...
ECAL
2003
Springer
15 years 3 months ago
2003
Springer
A formal language approach for the specification of ALife models is presented. “Relational Growth Grammars” incorporate rulebased, procedural and object-oriented concepts. By ...
EMNLP
2007
14 years 11 months ago
2007
We present a simple history-based model for sentence generation from LFG f-structures, which improves on the accuracy of previous models by breaking down PCFG independence assumpt...