905 search results - page 60 / 181 » Parsing of Context-Sensitive Languages |
ECEASST
2008
14 years 10 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
EMNLP
2009
14 years 8 months ago
2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
ACL
2012
13 years 15 days ago
2012
We present a system for cross-lingual parse disambiguation, exploiting the assumption that the meaning of a sentence remains unchanged during translation and the fact that differe...
67
Voted
LREC
2008
14 years 11 months ago
2008
Motivated by the expense in time and other resources to produce hand-crafted grammars, there has been increased interest in automatically obtained wide-coverage grammars from tree...