Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ritwik Bose

dblp:90/10489 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Information extraction and text analysis · 90% Knowledge representation and reasoning · 10%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
semantic parsing
0.412020
Improving Semantic Parsing Using Statistical Word Sense Disambiguation (Student Abstract) · AAAI 2020
Natural language and speech › Information extraction and text analysis
word sense disambiguation
0.412020
Improving Semantic Parsing Using Statistical Word Sense Disambiguation (Student Abstract) · AAAI 2020
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
logical form
0.112020
Improving Semantic Parsing Using Statistical Word Sense Disambiguation (Student Abstract) · AAAI 2020
Natural language and speech › Information extraction and text analysis › natural language semantics › computational semantics
semantic role assignment
0.112020
Improving Semantic Parsing Using Statistical Word Sense Disambiguation (Student Abstract) · AAAI 2020
Graph algorithms and graph theory
graph algorithms
0.012011
Learning General Connotation of Words using Graph-based Algorithms · EMNLP 2011

Methods — techniques the papers use, named apart from their topics

statistical word sense disambiguation · 0.4graph-based algorithm · 0.2
YearPublicationVenuePosition
2020 Improving Semantic Parsing Using Statistical Word Sense Disambiguation (Student Abstract)
abstract
A Semantic Parser generates a logical form graph from an utterance where the edges are semantic roles and nodes are word senses in an ontology that supports reasoning. The generated representation attempts to capture the full meaning of the utterance. While the process of parsing works to resolve lexical ambiguity, a number of errors in the logical forms arise from incorrectly assigned word sense determinations. This is especially true in logical and rule-based semantic parsers. Although the performance of statistical word sense disambiguation methods is superior to the word sense output of semantic parser, these systems do not produce the rich role structure or a detailed semantic representation of the sentence content. In this work, we use decisions from a statistical WSD system to inform a logical semantic parser and greatly improve semantic type assignments in the resulting logical forms.
Ritwik Bose, Siddharth Vashishtha, James F. Allen
AAAI1
2020 A Broad-Coverage Deep Semantic Lexicon for Verbs
abstract
Progress on deep language understanding is inhibited by the lack of a broad coverage lexicon that connects linguistic behavior to ontological concepts and axioms. We have developed COLLIE-V, a deep lexical resource for verbs, with the coverage of WordNet and syntactic and semantic details that meet or exceed existing resources. Bootstrapping from a hand-built lexicon and ontology, new ontological concepts and lexical entries, together with semantic role preferences and entailment axioms, are automatically derived by combining multiple constraints from parsing dictionary definitions and examples. We evaluated the accuracy of the technique along a number of different dimensions and were able to obtain high accuracy in deriving new concepts and lexical entries. COLLIE-V is publicly available.
James F. Allen, Hannah An, Ritwik Bose, William de Beaumont, Choh Man Teng 0001
LREC3
2014 The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye
Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley
Theory Comput. Syst.2
2011 Learning General Connotation of Words using Graph-based Algorithms
Song Feng 0002, Ritwik Bose, Yejin Choi 0001
EMNLP2