905 search results - page 57 / 181 » Parsing of Context-Sensitive Languages |
158
click to vote
CICLING
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we propose a new approach to the description of Arabic morphology using 2-tape finite state transducers, based on a particular and systematic use of the operation of ...
192
click to vote
TAL
2010
Springer
15 years 4 months ago
2010
Springer
This paper shows how the best data-driven dependency parsers available today [1] can be improved by learning from unlabeled data. We focus on German and Swedish and show that label...
168
click to vote
AI
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
153
click to vote
HASKELL
2009
ACM
16 years 19 days ago
2009
ACM
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
177
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...