Proceedings of the Fifth Conference on Applied Natural Language Processing - 1997
DOI: 10.3115/974557.974568
|View full text |Cite
|
Sign up to set email alerts
|

A non-projective dependency parser

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
101
0
3

Year Published

2005
2005
2010
2010

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 197 publications
(104 citation statements)
references
References 10 publications
0
101
0
3
Order By: Relevance
“…The same proportion of texts is kept for both selected training and test datasets. In order to extract the feature vector for the learning process, all the texts of the corpora were parsed with the Connexor Machinese [17], which provides the dependency parser for the Spanish language model.…”
Section: -Corpus Of Medical Translations By Professionals (Mtp) Whicmentioning
confidence: 99%
“…The same proportion of texts is kept for both selected training and test datasets. In order to extract the feature vector for the learning process, all the texts of the corpora were parsed with the Connexor Machinese [17], which provides the dependency parser for the Spanish language model.…”
Section: -Corpus Of Medical Translations By Professionals (Mtp) Whicmentioning
confidence: 99%
“…The text is parsed using Connexor's English parser (Tapanainen and Jarvinen 1997). The resulting set of parse trees is traversed and parent-child instance (lexeme) pairs are counted.…”
Section: Structural N-gram Model Statistical Surface N-grammentioning
confidence: 99%
“…Our English system proceeds by parsing the set of possibly relevant sentences, as well as the topic document sentences, with the Conexor's FDG Parser [7,5]. For the two sets of sentences and supporting document titles, the time expressions (TEs) are also identified and resolved using the temporal expression recogniser and normaliser previously developed by one of the authors [6].…”
Section: System Descriptionmentioning
confidence: 99%