| 1. |
- Basirat, Ali, et al.
(författare)
-
Greedy Universal Dependency Parsing with Right Singular Word Vectors
- 2016
-
Konferensbidrag (refereegranskat)abstract
- A set of continuous feature vectors formed by right singular vectors of a transformed co-occurrence matrix are used with the Stanford neural dependency parser to train parsing models for a limited number of languages in the corpus of universal dependencies. We show that the feature vector can help the parser to remain greedy and be as accurate as (or even more accurate than) some other greedy and non-greedy parsers.
|
|
| 2. |
|
|
| 3. |
- Basirat, Ali, 1982-, et al.
(författare)
-
Real-valued Syntactic Word Vectors (RSV) for Greedy Neural Dependency Parsing
- 2017
-
Konferensbidrag (refereegranskat)abstract
- We show that a set of real-valued word vectors formed by right singular vectors of a transformed co-occurrence matrix are meaningful for determining different types of dependency relations between words. Our experimental results on the task of dependency parsing confirm the superiority of the word vectors to the other sets of word vectors generated by popular methods of word embedding. We also study the effect of using these vectors on the accuracy of dependency parsing in different languages versus using more complex parsing architectures.
|
|
| 4. |
- Basirat, Ali, Postdoctoral Researcher, 1982-, et al.
(författare)
-
Syntactic Nuclei in Dependency Parsing – : A Multilingual Exploration
- 2021
-
Ingår i: Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics. - Stroudsburg, PA, USA : Association for Computational Linguistics. - 9781954085022 ; , s. 1376-1387
-
Konferensbidrag (refereegranskat)abstract
- Standard models for syntactic dependency parsing take words to be the elementary units that enter into dependency relations. In this paper, we investigate whether there are any benefits from enriching these models with the more abstract notion of nucleus proposed by Tesniere. We do this by showing how the concept of nucleus can be defined in the framework of Universal Dependencies and how we can use composition functions to make a transition-based dependency parser aware of this concept. Experiments on 12 languages show that nucleus composition gives small but significant improvements in parsing accuracy. Further analysis reveals that the improvement mainly concerns a small number of dependency relations, including relations of coordination, direct objects, nominal modifiers, and main predicates.
|
|
| 5. |
- Bengoetxea, Kepa, et al.
(författare)
-
On WordNet Semantic Classes and Dependency Parsing
- 2014
-
Ingår i: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers). ; , s. 649-655
-
Konferensbidrag (refereegranskat)
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Buljan, Maja, et al.
(författare)
-
A Tale of Three Parsers : Towards Diagnostic Evaluation for Meaning Representation Parsing
- 2020
-
Ingår i: Proceedings of the 12th International Conference on Language Resources and Evaluation (LREC 2020). - Paris : European Language Resources Association (ELRA). - 9791095546344 ; , s. 1902-1909
-
Konferensbidrag (refereegranskat)abstract
- We discuss methodological choices in contrastive and diagnostic evaluation in meaning representation parsing, i.e. mapping from natural language utterances to graph-based encodings of semantic structure. Drawing inspiration from earlier work in syntactic dependency parsing, we transfer and refine several quantitative diagnosis techniques for use in the context of the 2019 shared task on Meaning Representation Parsing (MRP). As in parsing proper, moving evaluation from simple rooted trees to general graphs brings along its own range of challenges. Specifically, we seek to begin to shed light on relative strenghts and weaknesses in different broad families of parsing techniques. In addition to these theoretical reflections, we conduct a pilot experiment on a selection of top-performing MRP systems and two of the five meaning representation frameworks in the shared task. Empirical results suggest that the proposed methodology can be meaningfully applied to parsing into graph-structured target representations, uncovering hitherto unknown properties of the different systems that can inform future development and cross-fertilization across approaches.
|
|
| 9. |
- Calacean, Mihaela, et al.
(författare)
-
A Data-Driven Dependency Parser for Romanian
- 2009
-
Ingår i: Proceedings of the Seventh International Workshop on Treebanks and Linguistic Theories.. - 9789078328773 ; , s. 65-76
-
Konferensbidrag (refereegranskat)
|
|
| 10. |
|
|
