| Challenge: | Existing methods for paraphrasing nouncompounds lack the ability to generalize and have a hard time interpreting infrequent or new noun-compound. |
| Approach: | They propose a neural model that generalizes better by representing paraphrases in a continuous space, generalizing for both unseen noun-compounds and rare paraphrase. |
| Outcome: | The proposed model generalizes better by representing paraphrases in a continuous space, generalizing for unseen noun-compounds and rare paraphrase. |
Similar Papers
Olive Oil is Made of Olives, Baby Oil is Made for Babies: Interpreting Noun Compounds Using Paraphrases in a Neural Model (N18-2)
Copied to clipboard
| Challenge: | Recent work suggests that success stems from memorizing single prototypical words for each relation. |
| Approach: | They propose a neural paraphrasing approach that maps NCs to paraphrases that express the relation between constituent words. |
| Outcome: | The proposed method performs better when memorization is not possible. |
Can Large Language Models Interpret Noun-Noun Compounds? A Linguistically-Motivated Study on Lexicalized and Novel Compounds (2024.acl-long)
Copied to clipboard
| Challenge: | Noun-noun compounds represent an important challenge for Natural Language Understanding . correct interpretation of noun-nomin compounds is essential for many applications . |
| Approach: | They test whether Large Language Models can interpret the semantic relation between nouns . they also test whether they can abstract from such knowledge to predict the relation . |
| Outcome: | The proposed models can interpret the semantic relation between nouns and compounds using analogical comparisons. |
Looking inside Noun Compounds: Unsupervised Prepositional and Free Paraphrasing (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Noun compound interpretation is the task of uncovering the semantic relation between the components of a noun compound. |
| Approach: | They propose an unsupervised method for identifying such relations between the components of a noun compound using pre-trained contextualized language models. |
| Outcome: | The proposed method outperforms supervised approaches for free paraphrasing and prepositional paraphrases using pre-trained language models to uncover ‘missing’ words. |
Towards a Standardized Dataset for Noun Compound Interpretation (L18-1)
Copied to clipboard
| Challenge: | Noun compounds are interesting constructs in Natural Language Processing . lack of standardized set of relation inventories and annotated datasets hinders interpretation . |
| Approach: | They propose a dataset that uses FrameNet as its semantic relation inventory to examine noun compounds. |
| Outcome: | The proposed dataset is linguistically grounded and uses FrameNet as its semantic relation inventory. |
Treat us like the sequences we are: Prepositional Paraphrasing of Noun Compounds using LSTM (C18-1)
Copied to clipboard
| Challenge: | Using prepositions, noun compounds are interpreted in two ways: labelling and paraphrasing. |
| Approach: | They propose to paraphrase noun compounds using prepositions by using parallelly aligned sequences of words. |
| Outcome: | The proposed approach performs well on datasets manually annotated with prepositions. |
Transfer and Multi-Task Learning for Noun–Noun Compound Interpretation (D18-1)
Copied to clipboard
| Challenge: | In computational linguistics, nounnoun compound interpretation is approached as an automatic classification problem. |
| Approach: | They empirically evaluate the utility of transfer and multi-task learning on a challenging semantic classification task. |
| Outcome: | The proposed methods improve the accuracy of a neural classifier and its F1 scores on the less frequent, but more difficult relations. |
Unsupervised Paraphrasability Prediction for Compound Nominalizations (2022.naacl-main)
Copied to clipboard
| Challenge: | Nominalizations can be difficult to interpret because of ambiguous semantic relations between deverbal noun and its arguments. |
| Approach: | They propose to over-generate clausal paraphrases to predict whether a prenominal modifier can be re-written as a noun or adverb in a claual paraphrasability. |
| Outcome: | The proposed method improves paraphrasability prediction and paraphrase generation in English . it shows that the prenominal modifier can be re-written as a noun or adverb in a clausal paraphrase . |
COGS: A Compositional Generalization Challenge Based on Semantic Interpretation (2020.emnlp-main)
Copied to clipboard
| Challenge: | Natural language is characterized by compositionality: meaning of complex expressions is constructed from the meanings of its constituent parts. |
| Approach: | They propose a semantic parsing dataset based on a fragment of English to assess compositional generalization abilities. |
| Outcome: | The proposed model can generalize meanings in a given sentence in 96–99% of the tests, but generalization accuracy is lower and the generalization sensitivity is higher. |
Paraphrasing Compound Nominalizations (2021.emnlp-main)
Copied to clipboard
| Challenge: | Nominalizations are difficult to interpret because of ambiguous semantic relations between deverbal noun and its arguments. |
| Approach: | They propose to generate clausal paraphrases for nominalizations by mapping arguments to verbs . they use a contextualized language model to re-rank nominalization candidates . |
| Outcome: | The proposed task is based on a pre-trained model to re-rank paraphrase candidates identified by a textual entailment model. |
Improving Compositional Generalization in Classification Tasks via Structure Annotations (2021.acl-short)
Copied to clipboard
| Challenge: | Compositional generalization is the ability to generalize systematically to a new data distribution by combining known components. |
| Approach: | They propose to convert a natural language sequence-to-sequence dataset into a classification dataset that requires compositional generalization. |
| Outcome: | The proposed model can generalize compositionally by providing hints on the structure of the input. |