Sciweavers

170 search results - page 4 / 34
» Parsing with Non-Deterministic Functions
Sort
View
ANLP
2000
89views more  ANLP 2000»
13 years 8 months ago
Assigning Function Tags to Parsed Text
It is generally recognized that the common nonterminal labels for syntactic constituents (NP, VP, etc.) do not exhaust the syntactic and semantic information one would like about ...
Don Blaheta, Eugene Charniak
COLING
1994
13 years 8 months ago
Parsing Turkish Using The Lexical Functional Grammar Formalism
This paper describes our work on parsing Turkish using the lexical-functional grammar formalism. This work represents the rst e ort for parsing Turkish. Our implementation is based...
Zelal Güngördü, Kemal Oflazer
EMNLP
2011
12 years 7 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
ACL
2003
13 years 8 months ago
A Debug Tool for Practical Grammar Development
We have developed willex, a tool that helps grammar developers to work efficiently by using annotated corpora and recording parsing errors. Willex has two major new functions. Fi...
Akane Yakushiji, Yuka Tateisi, Yusuke Miyao, Naoki...
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford