DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5...64
Hits 1 – 20 of 1.270

1
Chinese character decomposition for neural MT with multi-word expressions
In: Han, Lifeng orcid:0000-0002-3221-2185 , Jones, Gareth J.F. orcid:0000-0003-2923-8365 , Smeaton, Alan F. orcid:0000-0003-1028-8389 and Bolzoni, Paolo (2021) Chinese character decomposition for neural MT with multi-word expressions. In: 23rd Nordic Conference on Computational Linguistics (NoDaLiDa 2021), 31 May- 2 June 2021, Reykjavik, Iceland (Online). (In Press) (2021)
BASE
Show details
2
Dependency Patterns of Complex Sentences and Semantic Disambiguation for Abstract Meaning Representation Parsing ...
BASE
Show details
3
Phrase-Level Action Reinforcement Learning for Neural Dialog Response Generation ...
BASE
Show details
4
10D: Phonology, Morphology and Word Segmentation #1 ...
BASE
Show details
5
Sample-efficient Linguistic Generalizations through Program Synthesis: Experiments with Phonology Problems ...
BASE
Show details
6
19th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology - Part 2 ...
BASE
Show details
7
18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology - Part 1 ...
BASE
Show details
8
SpeakEasy Pronunciation Trainer: Personalized Multimodal Pronunciation Training ...
BASE
Show details
9
The Match-Extend Serialization Algorithm in Multiprecedence ...
Abstract: Raimy (1999; 2000a; 2000b) proposed a graphical formalism for modeling reduplication, originallymostly focused on phonological overapplication in a derivational framework. This framework is now known as Precedence-based phonology or Multiprecedence phonology. Raimy's idea is that the segments at the input to the phonology are not totally ordered by precedence. This paper tackles a challenge that arose with Raimy's work, the development of a deterministic serialization algorithm as part of the derivation of surface forms. The Match-Extend algorithm introduced here requires fewer assumptions and sticks tighter to the attested typology. The algorithm also contains no parameter or constraint specific to individual graphs or topologies, unlike previous proposals. Match-Extend requires nothing except knowing the last added set of links. ...
Keyword: Computational Linguistics; Condensed Matter Physics; Electromagnetism; FOS Physical sciences; Information and Knowledge Engineering; Neural Network; Semantics
URL: https://underline.io/lecture/30079-the-match-extend-serialization-algorithm-in-multiprecedence
https://dx.doi.org/10.48448/rgky-kt38
BASE
Hide details
10
Recognizing Reduplicated Forms: Finite-State Buffered Machines ...
BASE
Show details
11
Correcting Chinese Spelling Errors with Phonetic Pre-training ...
BASE
Show details
12
PLOME: Pre-training with Misspelled Knowledge for Chinese Spelling Correction ...
BASE
Show details
13
SpeakEasy Pronunciation Trainer: Personalized Multimodal Pronunciation Training ...
BASE
Show details
14
Including Signed Languages in Natural Language Processing ...
BASE
Show details
15
Quantification: the view from natural language generation ...
Carstensen, Kai-Uwe. - : Universitätsbibliothek Siegen, 2021
BASE
Show details
16
When is Char Better Than Subword: A Systematic Study of Segmentation Algorithms for Neural Machine Translation ...
BASE
Show details
17
The Reading Machine: a Versatile Framework for Studying Incremental Parsing Strategies ...
BASE
Show details
18
To POS Tag or Not to POS Tag: The Impact of POS Tags on Morphological Learning in Low-Resource Settings ...
BASE
Show details
19
Superbizarre Is Not Superb: Derivational Morphology Improves BERT's Interpretation of Complex Words ...
BASE
Show details
20
HIT - A Hierarchically Fused Deep Attention Network for Robust Code-mixed Language Representation ...
BASE
Show details

Page: 1 2 3 4 5...64

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
1.270
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern