252 search results - page 27 / 51 » Automata for Data Words and Data Trees |
133
click to vote
ACL
2009
14 years 11 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
106
click to vote
IJCNLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
130
click to vote
ALT
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
103
click to vote
CICLING
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
110
click to vote
ACL
2010
14 years 12 months ago
2010
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...