Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
COLING
/
Paper
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars.
Khalil Sima'an
Venue
B
COLING
Year
1996
Proceedings
COLING
DBLP record
conf/coling/Simaan96 ↗
Browse the full
COLING paper archive
.