paper-with-me

홈 › Papers

Finding Dependency Parsing Limits over a Large Spanish Corpus

2013-10-01 · IJCNLP 2013 10 · Muntsa Padr{\'o}, Miguel Ballesteros, H{\'e}ctor Mart{\'\i}nez, Bernd Bohnet
📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Dependency Parsing

Similar Papers 제목 키워드 기반

A Little Pretraining Goes a Long Way: A Case Study on Dependency Parsing Task for Low-resource Morphologically Rich Languages

2021-02-12 · EACL 2021 2 · Jivnesh Sandhan, Amrith Krishna, Ashim Gupta, Laxmidhar Behera 외

Neural dependency parsing has achieved remarkable performance for many domains and languages. The bottleneck of massive labeled data limits the effectiveness of these approaches for low resource languages. In this work, …

Dependency ParsingMorphological Disambiguation

Growing Trees on Sounds: Assessing Strategies for End-to-End Dependency Parsing of Speech

2024-06-18 · Adrien Pupier, Maximin Coavoux, Jérôme Goulian, Benjamin Lecouteux

Direct dependency parsing of the speech signal -- as opposed to parsing speech transcriptions -- has recently been proposed as a task (Pupier et al. 2022), as a way of incorporating prosodic information in the parsing sy…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Dependency Parsingspeech-recognition+1

On the feasibility of dependency parsing of non-human sequences without a gold standard. Is evaluation possible in other species?

2026-07-07 · Ramon Ferrer-i-Cancho, Catherine Hobaiter, Thore Bergman, Morgan Gustison arxiv

Dependency parsing consists of finding a tree representation for a sequence. Unsupervised dependency parsing aims to develop parsing methods without a gold standard during model training. In human languages, an unsupervi…

Unsupervised Dependency Parsing

Textless Dependency Parsing by Labeled Sequence Prediction

2024-07-14 · Shunsuke Kando, Yusuke Miyao, Jason Naradowsky, Shinnosuke Takamichi

Traditional spoken language processing involves cascading an automatic speech recognition (ASR) system into text processing models. In contrast, "textless" methods process speech representations without ASR systems, enab…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Dependency ParsingPrediction+3

Finding Optimal 1-Endpoint-Crossing Trees

2013-01-01 · TACL 2013 1 · Emily Pitler, Sampath Kannan, Mitchell Marcus

Dependency parsing algorithms capable of producing the types of crossing dependencies seen in natural language sentences have traditionally been orders of magnitude slower than algorithms for projective trees. For 95.8{-…

Dependency ParsingMachine TranslationQuestion Answering