Name
Abstract | ||
|---|---|---|
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas of our new parser. Finally, the parser is evaluated. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.3115/974557.974568 | ANLP |
Keywords | Field | DocType |
new parser,practical parser,unrestricted dependency,older constraint grammar parser,central idea,non-projective dependency parser,syntactic function | Recursive descent parser,Top-down parsing,Programming language,Computer science,Simple LR parser,GLR parser,LL parser,LALR parser,Parser combinator,Canonical LR parser | Conference |
Citations | PageRank | References |
187 | 23.23 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pasi Tapanainen | 1 | 512 | 101.53 |
| Timo Järvinen | 2 | 323 | 56.75 |